Marked Multi-Colorings in Lie Superalgebras

• Marked multi-colorings are combinatorial colorings on marked graphs that assign prescribed color multiplicities to vertices, with repetitions allowed only on designated isotropic vertices.
• They extend ordinary graph colorings by using marked chromatic polynomials indexed by multiplicity vectors, thereby linking independence series and PBW-type combinatorics with Lie superalgebra root multiplicities.
• Applications of this theory include analyzing growth series in right-angled Coxeter groups and extending the framework to hypergraphs and subspace arrangements with polynomial counting functions.

Marked multi-colorings are combinatorial colorings attached to a marked graph in which each vertex carries a prescribed color multiplicity, while the marking determines where repetitions of colors are permitted. They were introduced to encode root multiplicities of partially commutative Lie superalgebras and, through denominator identities, certain Borcherds–Kac–Moody superalgebras by graph-theoretic invariants (P et al., 14 Mar 2025). In this framework, the ordinary chromatic polynomial is replaced by a family of marked chromatic polynomials indexed by multiplicity vectors, and the resulting theory links graph colorings, independence series, PBW-type combinatorics, and right-angled Coxeter groups. The construction was later extended from graphs to hypergraphs and subspace arrangements, where analogous polynomiality and positivity phenomena appear (P et al., 28 Jul 2025).

1. Marked graphs and the defining constraints

A marked multi-coloring is defined on a simple graph $\mathcal G=(I,E)$ with countable vertex set $I$. The marking data consist of a subset $I_1\subseteq I$ of odd vertices, its complement $I_0=I\setminus I_1$ of even vertices, and a distinguished subset $I_1^{\mathrm{it}}\subseteq I_1$ of odd isotropic vertices. In the graphical conventions of the original work, odd isotropic vertices are drawn by $\Circle$, while even and odd non-isotropic vertices are drawn by $\CIRCLE$ (P et al., 14 Mar 2025).

Fix a multiplicity vector $\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$ with finite support and an integer $q\in\mathbb N$. A marked multi-coloring associated to $\mathbf m$ using at most $I$0 colors is a map from $I$1 to multisets of $I$2 such that three conditions hold. First, if $I$3, then the image at $I$4 is an ordinary subset, so no color may repeat there. Second, the cardinality of the multiset at $I$5, counted with multiplicity, is exactly $I$6. Third, if $I$7, then the color multisets at $I$8 and $I$9 are disjoint. Repetition is therefore permitted only at odd isotropic vertices, and even there it is constrained by adjacency.

This definition simultaneously generalizes several familiar notions. When $I_1\subseteq I$0 is the all-ones vector and $I_1\subseteq I$1, it reduces to ordinary proper colorings. For general $I_1\subseteq I$2, it becomes a vertex multi-coloring problem with prescribed multiplicities. The marking by $I_1\subseteq I$3 is not an auxiliary decoration: it is the combinatorial reflection of the parity and isotropy data carried by the associated Lie superalgebra.

A common simplification is to regard marked multi-colorings as a routine weighted variant of ordinary graph coloring. That is inaccurate. The essential novelty is not merely that vertices may carry several colors, but that multiplicities are permitted only on the isotropic part of the marking, and properness is enforced by disjointness of entire multisets rather than inequality of single color labels.

2. Marked chromatic polynomials and their relation to ordinary colorings

The number of marked multi-colorings of $I_1\subseteq I$4 associated to $I_1\subseteq I$5 using at most $I_1\subseteq I$6 colors is denoted

$I_1\subseteq I$7

For fixed $I_1\subseteq I$8, this counting function is a polynomial in $I_1\subseteq I$9, called the marked chromatic polynomial associated to $I_0=I\setminus I_1$0 (P et al., 14 Mar 2025).

Its first combinatorial expansion is indexed by ordered decompositions of the vertex multiset into nonempty independent multisets. If $I_0=I\setminus I_1$1 denotes the set of ordered $I_0=I\setminus I_1$2-tuples $I_0=I\setminus I_1$3 of nonempty multisets such that each $I_0=I\setminus I_1$4 is independent and their disjoint union is exactly the multiset $I_0=I\setminus I_1$5, then

$I_0=I\setminus I_1$6

The linear coefficient in $I_0=I\setminus I_1$7 is therefore an alternating sum built from the cardinalities $I_0=I\setminus I_1$8, exactly paralleling classical chromatic-polynomial expansions.

A second formula relates the marked theory to ordinary chromatic polynomials of blow-up graphs. For $I_0=I\setminus I_1$9, one forms $I_1^{\mathrm{it}}\subseteq I_1$0 by replacing each vertex $I_1^{\mathrm{it}}\subseteq I_1$1 with a clique of size $I_1^{\mathrm{it}}\subseteq I_1$2 and connecting distinct cliques according to $I_1^{\mathrm{it}}\subseteq I_1$3. Let $I_1^{\mathrm{it}}\subseteq I_1$4 be the set of families of partitions $I_1^{\mathrm{it}}\subseteq I_1$5 such that $I_1^{\mathrm{it}}\subseteq I_1$6 for all $I_1^{\mathrm{it}}\subseteq I_1$7, with $I_1^{\mathrm{it}}\subseteq I_1$8 whenever $I_1^{\mathrm{it}}\subseteq I_1$9. Writing $\Circle$0, the exact relation is

$\Circle$1

Thus marked multi-colorings are a refined version of ordinary colorings of a blown-up graph, with factorial denominators correcting for indistinguishable permutations of equal parts in the partition data.

This formula shows precisely how the marked theory extends classical coloring. When no isotropic vertices are present, every partition is forced to be trivial, and the marked polynomial reduces to the ordinary chromatic polynomial of the corresponding blow-up graph. When isotropic vertices are present, nontrivial partitions record the admissible repetitions of colors at those vertices.

3. Independence series and explicit evaluation formulas

The generating object behind the entire family of marked chromatic polynomials is the marked multivariate independence series. A multiset $\Circle$2 on $\Circle$3 is called independent if its underlying set spans no edges and every vertex in $\Circle$4 appears with multiplicity at most one. Denoting by $\Circle$5 the set of all finite such multisets and by

$\Circle$6

the associated monomial, one defines

$\Circle$7

Its $\Circle$8-th powers encode all marked chromatic polynomials through the coefficient identity

$\Circle$9

(P et al., 14 Mar 2025). In other words, the coefficient of $\CIRCLE$0 in $\CIRCLE$1 is exactly the marked chromatic polynomial associated to $\CIRCLE$2.

For graphs admitting a perfect elimination ordering, the marked chromatic polynomial has an explicit product formula. If $\CIRCLE$3 is a PEO-graph and $\CIRCLE$4 denotes the sum of partition lengths over the clique determined by the elimination ordering at vertex $\CIRCLE$5, then

$\CIRCLE$6

This gives a closed combinatorial expression for a large class of graphs, particularly relevant when multiplicity formulas for Lie superalgebra roots are applied afterward.

The worked star-graph example makes the mechanism concrete. If vertex $\CIRCLE$7 is the center of a star and $\CIRCLE$8, then the center contributes $\CIRCLE$9, while each leaf contributes a factor of the form

$\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$0

The distinction between isotropic and non-isotropic leaves appears entirely through the admissible partition families $\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$1.

4. Partially commutative Lie superalgebras and the denominator identity

Given marked graph data $\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$2, the associated partially commutative Lie superalgebra is

$\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$3

where $\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$4 is the free Lie superalgebra on generators $\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$5 of parity determined by $\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$6 and $\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$7, and $\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$8 is generated by

$\mathbf m=(m_i:i\in I)\in\mathbb Z_+^I$9

The $q\in\mathbb N$0-grading is given by $q\in\mathbb N$1, and the root multiplicity of $q\in\mathbb N$2 is

$q\in\mathbb N$3

(P et al., 14 Mar 2025).

The universal enveloping algebra $q\in\mathbb N$4 has Hilbert series

$q\in\mathbb N$5

The key combinatorial statement is the denominator identity

$q\in\mathbb N$6

This is the direct analogue, for partially commutative Lie superalgebras, of the denominator identity familiar from Borcherds–Kac–Moody theory.

Its proof is combinatorial rather than purely representation-theoretic. The underlying mechanism is a modified Cartier–Foata monoid $q\in\mathbb N$7, or equivalently a super heaps monoid, in which words ending and beginning with the same isotropic letter produce zero, reflecting the relation $q\in\mathbb N$8. The inversion lemma identifies the generating series of this monoid with $q\in\mathbb N$9, while a PBW basis identifies the same series with the Hilbert series of $\mathbf m$0. Marked multi-colorings then enter through the expansion of $\mathbf m$1.

This placement of marked multi-colorings inside the proof architecture is essential. They are not merely a post hoc interpretation of multiplicity formulas; they are the graph-side invariants that mediate between independence series and the Lie-theoretic denominator identity.

5. Root multiplicities, root structure, and Coxeter-theoretic consequences

Combining the denominator identity with the coefficient formula for marked chromatic polynomials yields an explicit root-multiplicity formula. Define

$\mathbf m$2

If $\mathbf m$3 means $\mathbf m$4 for every coordinate and $\mathbf m$5 is the Möbius function, then

$\mathbf m$6

When the coordinates of $\mathbf m$7 are relatively prime, only $\mathbf m$8 contributes, and one obtains the simpler identity

$\mathbf m$9

For primitive degree vectors, root multiplicities are therefore exactly the absolute values of linear coefficients of marked chromatic polynomials (P et al., 14 Mar 2025).

The same framework also detects non-roots. A combinatorial description of the root set $I$00 is given in terms of an admissible subset $I$01 together with forbidden star configurations $I$02, yielding

$I$03

The forbidden sets are precisely families where the multiplicity formula forces vanishing.

The paper further identifies partially commutative Lie superalgebras as positive parts of suitable Borcherds–Kac–Moody superalgebras. In the classes considered there, the corresponding BKM root multiplicities coincide with $I$04, so marked multi-colorings become explicit combinatorial formulas for BKM multiplicities as well.

A separate specialization occurs when every vertex is odd isotropic, i.e. $I$05. Then the universal enveloping algebra satisfies $I$06 and super-commutation relations matching those of the right-angled Coxeter group

$I$07

In this case

$I$08

as graded vector spaces, and therefore

$I$09

After the specialization $I$10, one recovers the Poincaré series formula

$I$11

A plausible implication is that marked multi-colorings provide a common language for multiplicity formulas on the Lie side and growth series on the Coxeter side, rather than two unrelated enumerative constructions.

6. Extensions to hypergraphs and subspace arrangements

The later extension to hypergraphs replaces the marked graph by a simple hypergraph $I$12 together with a subset $I$13 of special vertices. A marked-independent multiset may use arbitrary multiplicities on $I$14 and multiplicity at most one elsewhere, subject to the condition that its underlying set contain no edge. The marked independence series is then

$I$15

For a multiplicity vector $I$16 and $I$17, a marked multi-coloring assigns a multiset of colors to each vertex, forbids repetitions at non-special vertices, prescribes $I$18, and imposes the hypergraph properness condition

$I$19

The resulting counting function $I$20 is again polynomial, and the basic generating identity survives unchanged: $I$21 (P et al., 28 Jul 2025).

The same paper extends the theory to subspace arrangements. If $I$22 is an arrangement in $I$23, $I$24, and $I$25, an $I$26-marked multi $I$27-coloring is a map $I$28, $I$29, such that non-special coordinates use sets rather than multisets, $I$30, and there is no vector $I$31 with $I$32 for all $I$33 lying in any subspace of the induced arrangement over $I$34. The number of such colorings is polynomial in $I$35, with an explicit formula as a sum of characteristic polynomials of derived arrangements divided by factorial symmetry factors.

For hyperplane arrangements, the associated independence series has a sign-positivity property: $I$36 meaning that every coefficient is nonnegative. The hypergraph analogue remains conjectural: the proposed criterion is that $I$37 has nonnegative coefficients for all $I$38 if and only if every edge of $I$39 has even cardinality. The necessity of evenness is proved; the sufficiency is open.

These extensions show that marked multi-colorings are not confined to graph-theoretic Lie combinatorics. They persist at the level of hypergraph independence theory and arrangement complements, where they interact with characteristic polynomials, Möbius inversion on intersection lattices, and additive-combinatorial avoidance problems.