Disjunct matrix¶

A binary nonadaptive group-testing design in which every column has a row containing 1 while any chosen set of at most d other columns all contain 0.

Version: v2 · 2026-09-19 · History
Domain-specific #: 4213
Domain group: Formal Sciences
Origin domain: Mathematics
Subdomain: Combinatorial Group Testing → Mathematics

Core Idea¶

A d-disjunct matrix assigns items to pooled tests so the Boolean union of any d columns cannot cover another column, enabling unique recovery of up to d positives under the noiseless model. Each item owns a distinguishing test against every competing d-set; observed positive-test unions can therefore eliminate nondefective items or support simple decoding. The abstraction is therefore identified by a declared carrier, a transformation or constraint over that carrier, and an invariant that tells an analyst whether the named structure is genuinely present.

How would you explain it like I'm…

The Crumb-Tasting Plan

Imagine you need to find a few bad cookies in a big batch, but instead of tasting each one, you taste little mixes of crumbs from several cookies. A mix tastes bad if any cookie in it is bad. A disjunct matrix is a clever plan for which cookies go in which mix, so that as long as there are only a few bad ones, you can always tell exactly which ones they are.

No-Hiding Test Table

Group testing means testing mixtures of samples: if a mixture tests positive, at least one sample in it is positive. A disjunct matrix is a table that says which items go into which test. It's built so that, for any item and any group of up to d other items, there is at least one test that includes that item but none of the others. That means a few positive items can never 'hide' a healthy one by covering all its tests. So if there are at most d positives and the tests make no mistakes, you can figure out exactly which ones they are, often just by clearing every item that shows up in a negative test.

Witness-Guaranteed Pooling Design

In combinatorial group testing, a test matrix has one row per pooled test and one column per item, with a 1 where the item is in that test. A pool is positive if it contains any positive item, so the result vector is the Boolean OR (union) of the columns of the positive items. A matrix is d-disjunct if the union of any d columns never covers another column: for every column and any set of at most d other columns, some row has a 1 in that column and 0s in all the others. That row is a 'witness' for the item. With at most d positives and no testing errors, this guarantees the positives can be identified uniquely, and a simple decoder works: any item appearing in a negative test is cleared, and whatever remains is positive.

A d-disjunct matrix is a binary test-by-item matrix for nonadaptive combinatorial group testing in which the Boolean union of any d columns does not cover any other column. Equivalently, for every column j and every set S of at most d columns not containing j, there exists a row with a 1 in column j and 0 in every column of S. Under the noiseless Boolean outcome model, where a test is positive iff it contains at least one defective, this property guarantees unique recovery of any defective set of size at most d. It also supports simple decoding: every item appearing in some negative test is declared nondefective, and the disjunct property ensures that every nondefective item has such a witnessing negative test when there are at most d defectives. The identity rests on this per-column witness condition relative to the stated outcome model, not on group testing in general; the guarantee does not automatically extend to noisy tests or more than d positives.

Scope of Application¶

Disjunct matrix belongs to combinatorial group testing and is useful where the analyst can specify the typed combinatorial group testing carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, then evaluate for every column and every set of at most d other columns, a row witnesses the column with 1 and all competitors with 0 under the stated Boolean outcome model. The scope is broad within that domain but bounded by the need for for every column and every set of at most d other columns, a row witnesses the column with 1 and all competitors with 0 under the stated Boolean outcome model. Conceptual combinatorial identity only; no biomedical testing or laboratory pooling protocol is provided.

Clarity¶

The abstraction clarifies a crowded vocabulary by making for every column and every set of at most d other columns, a row witnesses the column with 1 and all competitors with 0 under the stated Boolean outcome model the center of the account. A claim should name the carrier, the governing operation or relation, the applicable assumptions, and the recognition test.

Manages Complexity¶

Without the abstraction, an analyst must reason directly over many local details: the carrier roles, admissibility assumptions, competing conventions, derived invariants, boundary cases, and proof or validation obligations specific to Disjunct matrix. Disjunct matrix compresses them into the roles in the structural signature. That compression permits comparison across instances without erasing the variables that determine validity. It also exposes which details may be varied safely and which are constitutive.

Abstract Reasoning¶

Identify the carrier. State what the elements, states, objects, or observations are: the typed combinatorial group testing carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets. Reject examples whose alleged carrier belongs to a different problem.
Lock the constitutive rule. Express for every column and every set of at most d other columns, a row witnesses the column with 1 and all competitors with 0 under the stated Boolean outcome model independently of one notation or implementation.

Knowledge Transfer¶

Knowledge transfers strongly among subfields of combinatorial group testing because they reuse the typed combinatorial group testing carrier, defining objects and relations, parameters, conventions, evidence, boundary cases, and comparison targets, Each item owns a distinguishing test against every competing d-set; observed positive-test unions can therefore eliminate nondefective items or support simple decoding., and type the carrier, state every parameter and convention in the definition, test that for every column and every set of at most d other columns, a row witnesses the column with 1 and all competitors with 0 under the stated Boolean outcome model, compare the nearest accepted identity, and report counterexamples, uncertainty, and limiting cases.

Relationships to Other Abstractions¶

Current abstraction Disjunct matrix Domain-specific

Parents (1) — outgoing typed relations

Disjunct matrix is a kind of Constraint Prime

What makes it its own entry: the domain-specific identity determined by for every column and every set of at most d other columns, a row witnesses the column with 1 and all competitors with 0 under the stated Boolean outcome model.

Hierarchy path (1) — routes to 1 parentless root

Disjunct matrix → is a kind of Constraint

Neighborhood in Abstraction Space¶

Disjunct matrix sits in a crowded region of the domain-specific corpus (14^th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.

Family — Clustering Methods & Validity Measures (14 abstractions)

Nearest neighbors

Discrepancy theory — 0.92
Representation theory of the symmetric group — 0.91
Addition principle — 0.91
Maximum satisfiability problem — 0.91
Permutation group — 0.90

Computed from structural-signature embeddings · 2026-10-25