Bialgebraic structures on boolean functions

Abstract: We study several bialgebraic structures on boolean functions, that is to say maps defined on the set of subsets of a finite set $X$, taking the value $0$ on $\emptyset$. Examples of boolean functions are given by the indicator function of the hyperedges of a given hypergraph, or the rank function of a matroid. We give the species of boolean functions a two-parameters family of products and a coproduct, and this defines a two-parameters family of twisted bialgebras. We then try to define a second coproduct on boolean functions, based on contractions, in order to obtain a double bialgebra. We show that this is not possible on the whole species of boolean functions, but that there exists a maximal subspecies where this is possible. This subspecies being rather mysterious, we introduce rigid boolean functions and show that this subspecies has indeed a second coproduct, as wished, and that it contains rank functions of matroids and indicator functions associated to hypergraphs. As a consequence, we obtain a unique polynomial invariant on rigid boolean functions, which is a generalization of the chromatic polynomial of graphs.

• The paper introduces a bialgebraic framework on Boolean functions, revealing unique decompositions into indecomposable factors across combinatorial classes.
• It employs twisted bialgebras and species theory to define product operations and restriction coproducts, establishing conditions for double bialgebra structures.
• The study defines rigid Boolean functions and constructs a novel polynomial invariant that generalizes the chromatic polynomial for hypergraphs and matroids.

Bialgebraic Structures on Boolean Functions: A Comprehensive Exposition

Introduction and Context

The study investigates bialgebraic and double bialgebraic structures on the class of boolean functions, which are defined as maps from the power set of a finite set $X$ to $\mathbb{Z}$ vanishing at the empty set. Boolean functions serve as a unifying framework that subsumes indicator functions of hypergraph hyperedges and rank functions of matroids. The motivation arises from attempts to generalize combinatorial bialgebras, especially double bialgebras—bialgebras in the category of comodules over another bialgebra—where contextually significant combinatorial classes like rooted trees and hypergraphs naturally fit, yet matroids have remained elusive in this algebraic setting.

Twisted Bialgebras and the Species of Boolean Functions

The framework of combinatorial species, particularly twisted bialgebras, is employed due to its capacity for capturing isomorphism-invariant algebraic structures among combinatorial objects. Boolean functions form a species, denoted $\mathsf{Bool}$, and its linearization supports the introduction of a two-parameter family of product operations $*_{q_1,q_2}$ and a canonical restriction coproduct $A$. This creates a rich family of bialgebras parameterized by $(q_1, q_2) \in \mathbb{Z}^2$. Isomorphisms between different parameter values are established via explicit transformations.

The algebraic decomposition theory is studied thoroughly: every boolean function admits a unique (up to order and commutation relations) decomposition into indecomposable factors with respect to the $*_{q_1, q_2}$ product. For the commutative case $(q_1 = q_2 = 1)$, indecomposables correspond to connected blocks (indecomposable with respect to set partition); algebra generation and commutation relations are characterized, including in the noncommutative regime.

Contraction-Restriction Coproducts and Obstacles to Double Bialgebras

A central question is the extension of the single bialgebra structure to a double structure via a second, "contraction-restriction" coproduct inspired by the contraction operation in graph and matroid theory. Such a coproduct is defined, for a boolean function $f$ and an equivalence relation $\sim$ on $X$, by $(f / \sim) \otimes (f |_\sim)$, provided $\sim$ satisfies conditions tied to decomposability and modularity.

However, the analysis demonstrates that on the universe of all boolean functions, no family of contraction-restriction equivalences yields full compatibility with required axioms (coassociativity, counitarity, and compatibility with both product and the restriction-coproduct). Weak and strong classes of equivalence relations, based on the structure of indecomposables and modularity upon contraction, are explicitly defined and investigated; yet neither is sufficient on its own to produce the desired double bialgebra structure across all boolean functions.

A main negative result asserts that only on certain maximal subfamilies (convenient subspecies) of boolean functions—those stable under product, restriction, contraction, and with coincidence of weak and strong equivalence relations—does the double bialgebra formalism hold.

Rigid and Hyper-rigid Boolean Functions

To proceed constructively, the notion of rigid and hyper-rigid boolean functions is developed. A boolean function is rigid if any modular-like additivity among disjoint sets must extend to all their subsets; hyper-rigid requires no nontrivial additivity except for the trivial case. These subclasses (shown to coincide) provide explicit, tractable families where the double bialgebra theory functions correctly.

Hypergraph indicator functions (after suitable transformation) and matroid rank functions reside in the class of rigid boolean functions. These inclusions are established, showing compatibility with the broader combinatorial context.

Polynomial Invariant: Generalizing the Chromatic Polynomial

Leveraging the double bialgebra structure on convenient species, a unique polynomial invariant $\Phi$ is constructed for rigid boolean functions and their convenient superspecies. For $f$ in such a family on $X$, and $n \geq 1$, $\Phi(f)(n)$ counts colorings $c: X \to \{1, \ldots, n\}$ such that the induced fibers $f_{c^{-1}(i)}$ are modular. Several critical interpretations arise:

• For hypergraph indicator functions, $\Phi$ recovers the classical chromatic polynomial.
• For graphical matroids (matroids derived from graphs), $\Phi$ counts edge colorings where each color class induces a forest.
• For linear matroids, the polynomial counts colorings where each color class forms an independent vector set.

This invariant generalizes the chromatic polynomial to broader contexts, and its algebraic construction connects combinatorial invariants to underlying bialgebraic operations.

Implications and Future Directions

The technical strategy of axiomatizing double bialgebra structures via contraction-restriction coproducts on boolean functions unifies and robustifies previous approaches to combinatorial Hopf algebras of graphs, hypergraphs, and matroids. The explicit characterization of (hyper-)rigid boolean functions enables further investigation of polynomial invariants beyond the chromatic and related graph polynomials, suggesting possible extensions to invariants in more general combinatorial geometries.

From a theoretical perspective, the necessity of restricting to maximal convenient subspecies for the existence of a double bialgebra structure illuminates intrinsic obstructions in the algebraic organization of independence and modularity in combinatorial families. This framework may provide a foundational language for subsequent classification results or for constructing new invariants in combinatorial algebra and possibly in categorical or higher-homological settings.

One expects that further exploration into operational or categorical characterizations of the maximal convenient species will yield additional insights. The results suggest new research avenues at the intersection of combinatorial species theory, universal algebra, and combinatorial invariants of matroids, hypergraphs, and beyond.

Conclusion

This work provides a comprehensive algebraic framework for boolean functions with a focus on bialgebraic and double bialgebraic structures, identifies the precise limitations for such structures in terms of contraction-restriction compatibility, and introduces polynomial invariants generalizing the chromatic polynomial. The restriction to rigid and hyper-rigid boolean functions is both natural and necessary, encompassing important cases such as those arising from hypergraphs and matroids. The polynomial invariants constructed on these classes are robust generalizations with deep combinatorial and algebraic significance, opening pathways for the systematic study of invariants in algebraic combinatorics (2601.13773).