Improper Partition Matrices

• Improper partition matrices are defined by relaxing traditional ordering or structural constraints in partition systems, crucial for varied combinatorial frameworks.
• In graph theory, they enable partitions that allow internal edges within parts, bridging proper colorings with clique formations and NP-complete cases.
• Enumerative and Ramsey theoretic approaches reveal their inversion statistics and raise open questions on partition regularity and finite structural criteria.

Searching arXiv for the cited papers and related usages of “improper partition matrices” to ground the article in the literature. “Improper partition matrices” is not a single standardized notion across the arXiv literature. The phrase is used explicitly in enumerative combinatorics for a parity-restricted subclass of partition matrices, while closely related work uses it informally for graph matrix partitions that allow edges inside parts, and for partition-regular matrices that fall outside familiar structural criteria. The common thread is a departure from a canonical “proper” regime, but the underlying objects, equivalence notions, and proof methods differ substantially (Chern et al., 29 Aug 2025).

1. Terminological scope

The literature separates into several distinct frameworks. In the combinatorics of set-partition matrices, “improper partition matrices” is an explicit term. In graph matrix partitions and Ramsey-theoretic partition regularity, by contrast, the phrase is interpretive rather than standard; the papers define the relevant classes precisely but do not adopt a uniform global terminology for “improperness” (Claesson et al., 2010).

Framework	Underlying object	Sense of “improper”
Partition matrices on $[n]$	Upper-triangular set-valued matrices	Explicit parity condition on ascents/descents
$M$-partitions of graphs	Symmetric $M\in\{0,1,\ast\}^{m\times m}$	Allowing clique or unconstrained diagonal parts
Partition regular matrices	Finite or infinite rational matrices	Interpreted as violating customary structural criteria

In the 2010 theory of partition matrices, a partition matrix on a finite set $X$ is an upper triangular matrix over the powerset of $X$ such that every row and column contains a non-empty set, the non-empty entries partition $X$, and the column-ordering condition $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$ holds. That paper does not define “improper partition matrices,” but it explicitly contrasts partition matrices with composition matrices, which satisfy the first two axioms but not the ordering condition. A plausible interpretation in that framework is therefore: matrices satisfying the base axioms but violating the ordering constraint (Claesson et al., 2010).

By contrast, the 2025 paper “Signed counting of partition matrices” introduces improper partition matrices as a specific subclass of partition matrices defined by parity restrictions on local ascents and descents, and derives signed-enumerative and lattice-path correspondences from that definition (Chern et al., 29 Aug 2025).

2. Graph matrix partitions and improper colorings

In graph theory, a symmetric matrix $M\in\{0,1,\ast\}^{m\times m}$ defines an $M$-partition problem: for a graph $G=(V,E)$, one asks whether $M$0 can be partitioned as $M$1 so that for all $M$2 and all $M$3, $M$4, the implications

$M$5

hold, while $M$6 imposes no restriction. The case $M$7 is included, so $M$8 forces $M$9 to induce a clique, $M\in\{0,1,\ast\}^{m\times m}$0 forces $M\in\{0,1,\ast\}^{m\times m}$1 to be an independent set, and $M\in\{0,1,\ast\}^{m\times m}$2 imposes no internal constraint. This framework generalizes proper graph coloring and graph homomorphisms (Montgomery, 2014).

Within this setting, “improper” refers to allowing edges inside parts. Choosing $M\in\{0,1,\ast\}^{m\times m}$3 gives clique parts; choosing $M\in\{0,1,\ast\}^{m\times m}$4 allows arbitrary internal structure. The paper assumes no $M\in\{0,1,\ast\}^{m\times m}$5 on the diagonal, since otherwise all graphs have an $M\in\{0,1,\ast\}^{m\times m}$6-partition unless additional constraints such as nonempty parts are imposed. Proper colorings correspond to diagonal zeroes, while improper colorings in the sense of allowing monochromatic edges are represented by taking $M\in\{0,1,\ast\}^{m\times m}$7 for the relevant colors (Montgomery, 2014).

A graph with no $M\in\{0,1,\ast\}^{m\times m}$8-partition but whose every proper induced subgraph does have an $M\in\{0,1,\ast\}^{m\times m}$9-partition is a minimal obstruction. For friendly matrices, defined by the absence of the $X$0 principal submatrices

$X$1

Feder, Hell, and Xie had shown that friendly matrices can have finitely many minimal obstructions, infinitely many minimal obstructions, or NP-complete partition problems. The 2014 paper proves that almost all friendly matrices have infinitely many minimal obstructions and an NP-complete partition problem. More precisely, if $X$2 is drawn uniformly from friendly $X$3 matrices with $X$4 zeroes and $X$5 ones on the diagonal, then

$X$6

and

$X$7

as $X$8; moreover, for the unrestricted random type model, almost all matrices have NP-complete partition problems (Montgomery, 2014).

The proof operates through the equivalent language of types: red vertices encode diagonal $X$9, blue vertices encode diagonal $X$0, and red/blue/green edges encode $X$1. Two structural ingredients are central. First, random types satisfy a fixed-point phenomenon for edge-homomorphisms of large subtypes. Second, common-neighborhood sets

$X$2

admit sharp lower and upper bounds that support obstruction gadgets and NP-hardness reductions. The resulting picture is that, in the friendly regime with both clique and independent-set parts, “almost all” large matrices lie on the intractable and infinite-obstruction side (Montgomery, 2014).

A restricted but fully classified example appears for chordal graphs. For

$X$3

an $X$4-partition requires $X$5 to be independent sets, with $X$6 and $X$7 completely joined and no restrictions between $X$8 and the other parts. The complete family of chordal minimal obstructions consists of seven fixed graphs $X$9 together with an infinite family $X$0 obtained from an odd chordless path of length at least $X$1 by adjoining a vertex adjacent to all internal path vertices and non-adjacent to the endpoints. A chordal graph admits an $X$2-partition if and only if it is $X$3-free (García-Altamirano et al., 2020).

3. Improper partition matrices in enumerative combinatorics

The explicit modern definition appears in “Signed counting of partition matrices.” A partition matrix $X$4 on $X$5 is an upper-triangular square matrix whose entries are subsets of $X$6, with each row and column containing at least one nonempty subset, the nonempty subsets partitioning $X$7, and the column monotonicity condition $X$8. On such a matrix, for $X$9, a descent at $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$0 occurs if $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$1 and $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$2; an ascent occurs if $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$3 and $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$4. Writing $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$5 for the minimal element in the column of $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$6, a descent or ascent is proper if $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$7 and improper otherwise. An improper partition matrix is then a partition matrix in which every descent and every ascent, if any, is improper (Chern et al., 29 Aug 2025).

This notion is tied to the inversion statistic. A pair $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$8 is an inversion in $$\operatorname{col}(i)<\operatorname{col}(j)\Rightarrow i<j$$9 if $M\in\{0,1,\ast\}^{m\times m}$0, $M\in\{0,1,\ast\}^{m\times m}$1, and $M\in\{0,1,\ast\}^{m\times m}$2; let $M\in\{0,1,\ast\}^{m\times m}$3 be the number of such pairs. The paper defines a sign-reversing involution $M\in\{0,1,\ast\}^{m\times m}$4 on all partition matrices: if $M\in\{0,1,\ast\}^{m\times m}$5 is not improper, $M\in\{0,1,\ast\}^{m\times m}$6 swaps the labels of the smallest proper ascent or descent $M\in\{0,1,\ast\}^{m\times m}$7 and $M\in\{0,1,\ast\}^{m\times m}$8, and one has

$M\in\{0,1,\ast\}^{m\times m}$9

The fixed points of $M$0 are precisely the improper partition matrices, and every improper partition matrix has even inversion number. Consequently,

$M$1

The main theorem sharpens this by identifying the signed count with inversion-sequence avoidance:

$M$2

where $M$3 is the set of inversion sequences of length $M$4 with no triple $M$5 satisfying $M$6 (Chern et al., 29 Aug 2025).

The same paper isolates a nondecreasing subclass. A partition matrix is nondecreasing if $M$7 implies $M$8 and $M$9. The subset $G=(V,E)$0 of nondecreasing improper partition matrices is equinumerous with Motzkin paths of length $G=(V,E)$1, and the pair of statistics $G=(V,E)$2 on $G=(V,E)$3 is equidistributed with $G=(V,E)$4 on Motzkin paths. In particular,

$G=(V,E)$5

the $G=(V,E)$6th Motzkin number (Chern et al., 29 Aug 2025).

This usage should be distinguished from the earlier 2010 partition-matrix theory. There, partition matrices are in bijection with inversion tables, row-ordered partition matrices correspond to non-decreasing inversion tables and are counted by Catalan and Narayana numbers, and composition matrices correspond to $G=(V,E)$7-free posets. Since that paper does not use the adjective “improper,” any such terminology in its context is necessarily interpretive rather than canonical (Claesson et al., 2010).

4. Partition regular matrices: standard terminology and informal “improper” readings

In Ramsey theory, the established terms are image partition regular (IPR) and kernel partition regular (KPR) matrices, not “improper partition matrices.” A finite or infinite matrix $G=(V,E)$8 is image partition regular over $G=(V,E)$9 if whenever $M$00 is finitely colored, one can find $M$01 such that all entries of $M$02 lie in a single color class. Centrally image partition regular (CIPR) matrices strengthen this by demanding monochromatic images inside every central set in $M$03, with the algebra of $M$04 providing the basic machinery (Patra et al., 2017).

A principal closure result concerns diagonal sums. If $M$05 is a subtracted centrally image partition regular matrix and $M$06 is a Milliken–Taylor matrix, then

$M$07

is image partition regular over $M$08; the same conclusion holds when $M$09 is subtracted segmented image partition regular. The proof uses the sets

$M$10

together with additive and multiplicative ideal properties in $M$11, and combines these with Milliken–Taylor structure. The paper also proves that if $M$12 is finite IPR and $M$13 is any infinite IPR matrix, then $M$14 is IPR (Patra et al., 2017).

The same framework is extended from “near zero” to “near an idempotent” in an arbitrary Hausdorff semitopological semigroup. For an idempotent $M$15, a matrix is image partition regular over $M$16 near $M$17 if monochromatic images can be forced inside arbitrary neighborhoods of $M$18. For finite matrices, three conditions are equivalent: classical IPR over $M$19, IPR over $M$20 near $M$21, and the property that every central set near $M$22 contains an image of the matrix. For infinite systems, insertion matrices built from finite IPR blocks and Milliken–Taylor matrices are IPR near $M$23, and segmented image partition regular matrices are centrally IPR near $M$24 under the stated IP$M$25 hypothesis on scalar multiples $M$26 (Biswas, 2014).

A different dual perspective appears over $M$27. For any rational matrix $M$28, there exists a matrix $M$29 such that

$M$30

so $M$31 is an idempotent projection with range equal to the kernel of $M$32. This yields an exact duality: $M$33 is KPR over a nontrivial subsemigroup $M$34 if and only if $M$35 is IPR over $M$36, equivalently weakly IPR over $M$37. Conversely, for any rational matrix $M$38, one can build a matrix $M$39 whose monochromatic kernel vectors are exactly the monochromatic images of $M$40 in $M$41 (Hindman et al., 2016).

Taken together, these results suggest that in Ramsey theory “improperness” is best understood as an informal label for matrices that lie outside the cleanest finite templates—such as diagonal-sum closure for arbitrary infinite IPR matrices, exact finite columns criteria, or strict image-versus-kernel separations—rather than as a standard technical term.

5. Infinite partition regularity beyond the columns property and maximality phenomena

A stronger informal sense of “improper” appears in the study of infinite kernel partition regular matrices that fail the columns property. For a matrix $M$42 with rational entries, partition regularity in the kernel sense means that every finite coloring of $M$43 admits a monochromatic vector $M$44 with $M$45. Rado’s theorem characterizes finite partition regular matrices by the columns property, but the infinite case is more subtle. The paper “Partition regularity without the columns property” constructs an infinite system

$M$46

whose coefficient matrix is $M$47, with entries in $M$48 and bounded column support, and proves that it is partition regular over $M$49 even though no non-empty subset of columns sums to the zero vector. Thus the matrix fails even the first requirement of the columns property (Barber et al., 2014).

The proof replaces columns-based arguments with ultrafilter algebra and central-set largeness. A key lemma states that if $M$50 is central, then there exist $M$51 such that for all $M$52,

$M$53

This absorption property allows an inductive construction of monochromatic solutions inside a central set. The same paper conjectures that bounded row sums may restore a columns-style necessity: if an $M$54 rational matrix is partition regular and has bounded row sums, then it should satisfy an infinite version of the columns property. The proved first step is that bounded row sums already force the existence of a non-empty set of columns summing to zero (Barber et al., 2014).

A related extension problem arises on the image side. In “Maximality of Infinite Partition Regular Matrices,” a matrix is maximal IPR if no new finitely supported row can be added while preserving IPR. The paper also defines image domination and image maximality: $M$55 image dominates $M$56 if every image set of $M$57 is contained in some image set of $M$58. Within this theory, the Finite Sums matrix $M$59 is not image maximal, but it is maximal among rapidly IPR integer matrices; the DH-matrix $M$60 is finitely image maximal; and no universally image maximal matrix is known. Throughout, “improper” solutions are understood in the standard IPR sense that variables need not be distinct unless a stronger notion such as strongly centrally IPR is imposed (Hindman et al., 2014).

6. Comparative perspective and open directions

Across these literatures, “improperness” consistently marks the failure of a preferred normal form. In graph matrix partitions, it is the failure of strictly independent color classes, replaced by clique or unrestricted diagonal parts. In partition-matrix enumeration, it is the failure of parity-compatible local ascents and descents. In Ramsey theory, it is the failure of standard finite criteria such as the columns property, or the need to move from classical partition regularity to central, near-idempotent, or translated infinite systems. This suggests a unifying editorial description: improper partition matrices are matrices whose partition-theoretic behavior is controlled by a relaxation of the regularity constraints that define the canonical model in their respective frameworks.

The open problems are correspondingly framework-specific. For graph $M$61-partitions, it remains unknown whether every fixed $M$62-partition problem is either polynomial-time solvable or NP-complete, and a full characterization of which friendly matrices have finitely many minimal obstructions or polynomial-time algorithms is still open (Montgomery, 2014). For enumerative improper partition matrices, open directions include a direct bijective proof of the equidistribution with inversion sequences and further analysis of the polynomials $M$63 (Chern et al., 29 Aug 2025). In the diagonal-sum and central-set theory of IPR matrices, the paper poses questions on simultaneous left/right images, common-vector products of images, and avoidance partitions for product-of-sums configurations (Patra et al., 2017). For infinite kernel partition regularity, the bounded-row-sums conjecture remains a central unresolved problem (Barber et al., 2014).

The resulting encyclopedia picture is therefore plural rather than singular. “Improper partition matrices” denotes a precise parity-defined class in one active combinatorial line of work, while in graph partition theory and Ramsey theory it functions more as a descriptive label for matrices whose partition behavior departs from the standard proper regime. The term is best understood through its local framework, not as a universally fixed definition.