Rigid Boolean Functions & Polynomial Invariants

• Rigid boolean functions are defined on power sets (vanishing at the empty set) and exhibit structural decompositions through genuine additive splitting.
• The unique polynomial invariant generalizes the chromatic polynomial by encoding deep bialgebraic symmetries present in combinatorial and algebraic frameworks.
• This framework applies to hypergraphs, graphs, and matroids, providing deletion–contraction recurrences that mirror classical algorithms for computing polynomial invariants.

A polynomial invariant on rigid boolean functions is a uniquely defined polynomial arising from the double bialgebra structure imposed on the subspecies of rigid boolean functions. Boolean functions in this context are functions $f: P(X) \to \mathbb{Z}$ for a finite set $X$, vanishing at the empty set, and encompassing important combinatorial constructs such as the indicator function of hypergraphs and the rank function of matroids. The construction of the polynomial invariant generalizes the chromatic polynomial of graphs and encodes deep bialgebraic symmetries present in combinatorics and algebraic structures (Foissy, 20 Jan 2026).

1. Boolean Functions, Bialgebraic Structures, and Products

Let $X$ be a finite set. The species $\mathrm{Bool}(X)$ consists of all functions $f: P(X) \to \mathbb{Z}$ with $f(\emptyset) = 0$. This species supports a two-parameter family of associative products defined as follows: given $f \in \mathrm{Bool}(X)$, $g \in \mathrm{Bool}(Y)$, and $X$ disjoint from $Y$,

$X$0

This product is commutative if and only if $X$1. The canonical (commutative) instance is $X$2.

The restriction-coproduct is given by

$X$3

with $X$4. The triple $X$5 defines a twisted (set-graded) bialgebra.

Applying the Fock functor $X$6, one obtains a genuine commutative bialgebra $X$7, with $X$8 for $X$9.

2. Contraction, Restriction, and the Maximal Subspecies

Attempting to define a second coproduct, namely a contraction–restriction coproduct, necessitates additional structure: $X$0 For any equivalence relation $X$1 on $X$2, define: $X$3 where $X$4 is the canonical quotient. Imposing bialgebraic compatibility axioms, it is established that no rule for $X$5 works globally for all boolean functions. Thus, one is forced to work inside a maximal subspecies $X$6 where weak and strong equivalence families coincide.

3. Rigid Boolean Functions and Double Bialgebra Structure

A boolean function $X$7 is called indecomposable if it cannot be written nontrivially as $X$8, for a partition $X$9. The unique maximal factorization

$\mathrm{Bool}(X)$0

yields equivalence classes defining the indecomposable blocks.

A function $\mathrm{Bool}(X)$1 is called rigid if any additive splitting over disjoint subsets $\mathrm{Bool}(X)$2,

$\mathrm{Bool}(X)$3

implies a structural decomposition $\mathrm{Bool}(X)$4. Thus, rigid functions account only for "genuine" additive splitting reflecting actual disconnected blocks in $\mathrm{Bool}(X)$5. Rigid boolean functions form a maximal subspecies $\mathrm{Bool}(X)$6 stable under $\mathrm{Bool}(X)$7, $\mathrm{Bool}(X)$8, and the contraction–restriction coproduct.

On $\mathrm{Bool}(X)$9, the weak and strong equivalences coincide, and a bona fide second coproduct $f: P(X) \to \mathbb{Z}$0 exists,

$f: P(X) \to \mathbb{Z}$1

After linearization using the Fock functor, one obtains a connected double bialgebra: $f: P(X) \to \mathbb{Z}$2

4. Second Coproduct and Polynomial Invariant

The second coproduct for $f: P(X) \to \mathbb{Z}$3 is defined as: $f: P(X) \to \mathbb{Z}$4 where equivalence relations respect indecomposable components. The map $f: P(X) \to \mathbb{Z}$5 is coassociative and compatible with both $f: P(X) \to \mathbb{Z}$6 and $f: P(X) \to \mathbb{Z}$7, and admits a two-sided counit $f: P(X) \to \mathbb{Z}$8, with $f: P(X) \to \mathbb{Z}$9 iff $f(\emptyset) = 0$0 is modular (splitting as a pure sum of singleton restrictions).

By general results on double bialgebras, there exists a unique morphism

$f(\emptyset) = 0$1

to the binomial Hopf algebra, characterized by

$f(\emptyset) = 0$2

This morphism gives rise to the fundamental polynomial invariant $f(\emptyset) = 0$3 for rigid boolean functions.

The morphism satisfies the following recursion: $f(\emptyset) = 0$4 and a Taylor-style expansion: $f(\emptyset) = 0$5 Combinatorially,

$f(\emptyset) = 0$6

for $f(\emptyset) = 0$7. $f(\emptyset) = 0$8 is thus a polynomial of degree $f(\emptyset) = 0$9 with integer coefficients.

5. Chromatic Polynomial, Matroids, and Hypergraph Examples

For a hypergraph $f \in \mathrm{Bool}(X)$0 with vertex set $f \in \mathrm{Bool}(X)$1 and hyperedge set $f \in \mathrm{Bool}(X)$2, the indicator function

$f \in \mathrm{Bool}(X)$3

is rigid, and $f \in \mathrm{Bool}(X)$4 yields the chromatic polynomial of the hypergraph (i.e., the number of proper colorings avoiding monochromatic hyperedges). For graphs $f \in \mathrm{Bool}(X)$5 (as $f \in \mathrm{Bool}(X)$6-uniform hypergraphs), this reduces to the classical chromatic polynomial.

For matroids:

• If $f \in \mathrm{Bool}(X)$7 is the rank-function of the graphic matroid on the edges $f \in \mathrm{Bool}(X)$8 of a graph $f \in \mathrm{Bool}(X)$9, then

$g \in \mathrm{Bool}(Y)$0

• For a linear matroid, $g \in \mathrm{Bool}(Y)$1, then

$g \in \mathrm{Bool}(Y)$2

The table below summarizes key rigid boolean function classes and their associated polynomial invariants:

Structure	Boolean Function	Polynomial Invariant
Hypergraph	Indicator $g \in \mathrm{Bool}(Y)$3	Chromatic polynomial of $g \in \mathrm{Bool}(Y)$4
Graph	Indicator of $g \in \mathrm{Bool}(Y)$5-uniform	Classical chromatic polynomial
Graphic Matroid	Rank function $g \in \mathrm{Bool}(Y)$6	Coloring forests per edge-set
Linear Matroid	Rank of vectors	Coloring independent sets

6. Universality and Relation to the Tutte Polynomial

The construction $g \in \mathrm{Bool}(Y)$7 is universal among invariants that factor through the double bialgebra $g \in \mathrm{Bool}(Y)$8 into the binomial Hopf algebra. Special cases and parameter specializations recover the classical graph-chromatic, hypergraph-chromatic, and via bivariate refinements, the Tutte polynomial of a matroid.

A plausible implication is that this framework systematically subsumes and generalizes major combinatorial polynomial invariants, providing a unified platform for their algebraic and structural analysis.

7. Computational Aspects and Applications

Evaluation of $g \in \mathrm{Bool}(Y)$9 is $X$0-hard even for graph-theoretic instances. Nonetheless, the bialgebraic approach yields deletion–contraction recurrences and broken-circuit expansions that mirror efficient algorithms for computing chromatic and Tutte polynomials, emphasizing both theoretical clarity and computational tractability where possible.

Potential applications include graph and hypergraph coloring, reliability of networks, moment–cumulant relations in algebraic probability (through duality in species theory), and the combinatorics underlying regularity structures in stochastic PDEs (Foissy, 20 Jan 2026).