Signed Chromatic Quasisymmetric Invariant
- The signed chromatic quasisymmetric invariant is defined for directed signed graphs, extending traditional chromatic symmetric functions by incorporating a proper coloring weighted by an ascent statistic.
- It organizes colorings via signed-graphic hyperplane arrangements, linking proper colorings with chamber decompositions and refined reciprocity theorems.
- The invariant takes values in the algebra SQSym, offering a framework that connects signed graph theory with quasisymmetric functions through explicit fundamental expansions.
Searching arXiv for papers on signed chromatic quasisymmetric invariants and closely related work. The signed chromatic quasisymmetric invariant is a chromatic generating function for a directed signed graph that records proper colorings together with an ascent statistic derived from Zaslavsky’s compatibility condition for signed orientations. For a directed signed graph , it is defined by
where the variables are indexed by , , and counts the edges on which the coloring is not compatible with the chosen signed orientation. The construction extends Stanley’s chromatic symmetric function, the Shareshian–Wachs–Ellzey chromatic quasisymmetric function, and the earlier chromatic signed-symmetric function of a signed graph; its natural target is the algebra of signed quasisymmetric functions (Aval et al., 27 Aug 2025).
1. Definition on directed signed graphs
A signed graph is , where . In the directed setting, each edge is equipped with a bidirection satisfying
for 0, with 1. A proper coloring is a map 2 such that
3
for every edge 4. Thus positive edges impose 5, while negative edges impose 6. This is the signed analogue of the ordinary proper-coloring condition, but with the color set expanded from positive integers to all integers (Aval et al., 27 Aug 2025).
The ascent statistic is defined from Zaslavsky’s compatibility relation. For a coloring 7 and an oriented signed edge 8, compatibility means
9
An ascent is an edge on which this inequality is violated, equivalently one satisfying
0
The invariant 1 is obtained by weighting each proper coloring by 2. When 3, the statistic is forgotten and one recovers the previously studied signed chromatic symmetric function of Kuroda–Tsujie and related work (Aval et al., 27 Aug 2025).
2. Hyperplane arrangements and chamber decompositions
The invariant is organized by the signed-graphic hyperplane arrangement associated with 4. For a signed graph on vertices 5, the arrangement is
6
Proper colorings correspond to integer points outside this arrangement, and acyclic orientations in the sense of Zaslavsky correspond to chambers of 7. The signed chromatic quasisymmetric invariant can therefore be regrouped chamberwise as
8
where 9 is constant on each chamber (Aval et al., 27 Aug 2025).
This chamber description refines the earlier arrangement-theoretic definition of the chromatic signed-symmetric function
0
for a signed graph 1. In that earlier theory, the arrangement chambers and their closures also support a reciprocity theorem
2
with 3 defined by summing over integer points in chamber closures. This extends Stanley’s reciprocity from ordinary graphic arrangements to signed-graphic arrangements (Kuroda et al., 2021).
3. The target algebra 4
The signed chromatic quasisymmetric invariant takes values in 5, where 6 is the algebra of signed quasisymmetric functions. A formal power series 7, with variables 8, is signed quasisymmetric if it has bounded degree and if its coefficients depend only on the pattern of exponents on 9, the positive-index variables, and the negative-index variables, not on the specific indices. Concretely, for any increasing positive index sequences 0 and 1, any bicomposition 2, and 3,
4
This is the signed analogue of ordinary quasisymmetry (Aval et al., 27 Aug 2025).
The monomial basis is indexed by pairs 5, where 6 is a bicomposition, that is, a pair of integer vectors 7 with no column equal to 8. The corresponding basis element is
9
Multiplication is given by a quasi-shuffle product on bicompositions,
0
and the coproduct is defined by deconcatenation. The algebra is graded, and its Hilbert series is
1
The space is invariant under the action of the signed symmetric group, and the paper explicitly presents it as a type 2 extension of 3 (Aval et al., 27 Aug 2025).
4. Fundamental expansions and structural properties
The fundamental family for 4 is built from signed 5-partitions on signed chains. These functions generalize the classical fundamental basis of 6, and the paper extracts a basis using “minimal chains” together with an explicit bijection to bicompositions. In this basis the signed chromatic quasisymmetric invariant admits an explicit expansion: 7 where 8 is the signed symmetric group, 9 is the fundamental function indexed by the descent set and sign word of 0, and 1 is the corresponding inversion statistic (Aval et al., 27 Aug 2025).
Several formal properties parallel the ordinary chromatic theory. The invariant is multiplicative on disjoint unions: 2 It specializes to the signed chromatic symmetric function at 3, and setting 4 yields the zero-free version. However, the output is usually not signed symmetric: it generally lies in 5, not in the algebra 6 of signed symmetric functions, except for specific classes of graphs treated in the symmetry results of the paper (Aval et al., 27 Aug 2025).
5. Relation to earlier chromatic invariants
The new invariant sits at the intersection of two established lines of generalization. In the unsigned direction, Stanley’s chromatic symmetric function 7 was refined by Shareshian, Wachs, and Ellzey to a chromatic quasisymmetric function for directed graphs, and the signed construction is designed to recover that theory when all edge signs are positive and the orientation is the standard unsigned one. In the signed direction, the specialization 8 recovers the chromatic signed-symmetric function, whose ordinary-graph specialization is obtained by the projection 9 sending 0 for 1 and retaining 2 for 3; for a positive simple graph 4, one has 5 (Aval et al., 27 Aug 2025, Kuroda et al., 2021).
A separate unsigned refinement is the 6-chromatic quasisymmetric function 7, defined by summing over 8-balanced colorings of a simple graph. It satisfies 9, is positive in the fundamental basis, and gives rise to a generalized chromatic polynomial 0 whose negative evaluations generalize Stanley’s theorem relating 1 to acyclic orientations (Humpert, 2010). This places the signed chromatic quasisymmetric invariant within a broader program in which chromatic generating functions are refined by orientation data, although the signed-graph setting uses signed edge constraints and signed quasisymmetry rather than 2-balancedness.
At the 3 level, the earlier signed-symmetric theory also investigated distinguishing power. The chromatic signed-symmetric function was shown to distinguish signed paths up to 4 vertices computationally, and it was proved that for signed paths indexed by compositions of length at most 5, or by unimodal compositions, equality of the functions implies isomorphism of the signed paths. The same work also showed that a signed tree is connected if and only if its chromatic signed-symmetric function is irreducible in the ring of signed-symmetric functions (Kuroda et al., 2021). A plausible implication is that analogous structural questions for the quasisymmetric refinement may become central in the signed setting.
6. Terminological boundaries and adjacent signed theories
The phrase “signed” appears in this area in more than one sense. In the signed chromatic quasisymmetric invariant, “signed” refers primarily to signed graphs, signed orientations, and the signed quasisymmetric target algebra 6. In a different line of work, “signed” refers to coefficient signs in basis expansions. For the chromatic quasisymmetric function 7 of a graph, a signed 8-expansion was proved for any natural unit interval graph: 9 and a sign-reversing involution then yields explicit positive 0-expansions for 1-chains and almost-2-chains. The same paper gives a signed 3-expansion for arbitrary graphs using no-broken-circuit trees, with the claw graph exhibiting negative terms and thus failure of 4-positivity (Tom, 2023). This is a different notion of “signed” from the signed-graph framework, even though both are attached to chromatic quasisymmetric constructions.
A further structural boundary is supplied by kernel results for chromatic quasisymmetric maps. For graphs, the kernel of the noncommutative chromatic quasisymmetric map is spanned by modular relations, and in the commutative case one adds isomorphism relations. For hypergraphic polytopes, the kernel is generated by simple relations and generalized modular relations, and the image of the noncommutative map is the singleton commuting space 5 (Penaguiao, 2018). That work does not construct signed chromatic quasisymmetric invariants, but it states that any signed or “signed quasisymmetric” invariant that factors through the universal chromatic morphism must vanish on the same modular-type obstructions. This suggests that the signed chromatic quasisymmetric invariant is not only a new enumerator but also part of a tightly constrained universal chromatic framework.