Strong Formal Subdivisions in Combinatorics
- Strong formal subdivisions are combinatorial abstractions that generalize classical geometric subdivisions by enforcing strong surjectivity and parity-sum conditions in lower Eulerian posets.
- They enable the decomposition of complex invariants like the cd-index and local h-polynomials, offering recursive formulas and explicit computations in poset theory.
- This framework bridges combinatorics, geometry, and algebra by linking subdivision data with Kazhdan–Lusztig–Stanley invariants and equivariant Ehrhart theory.
A strong formal subdivision is a combinatorial abstraction of geometric subdivisions, generalizing classical polyhedral and fan subdivisions to the category of lower Eulerian posets. This concept provides a framework for decomposing combinatorial invariants of posets, such as the -index and local -polynomials, and establishing canonical correspondences with Kazhdan–Lusztig–Stanley (KLS) invariants and equivariant Ehrhart theory. The theory of strong formal subdivisions has been developed to unify and extend existing subdivisions in the paper of poset invariants and to serve as a bridge to deep algebraic and topological invariants arising in combinatorics and geometry (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025, Dornian et al., 2020).
1. Lower Eulerian Posets and the Definition of Strong Formal Subdivision
Let and be finite lower Eulerian posets equipped with rank functions (that is, for any element covering , , and every closed interval in contains the same number of even- and odd-ranked elements).
An order-preserving, rank-increasing, surjective map is called a strong formal subdivision (SFS) if it satisfies:
- Strong Surjectivity: For every , with , there exists with and .
- Parity-sum Condition (Incidence Parity): For every , with ,
Equivalently,
These conditions rigorously generalize the axioms satisfied by geometric subdivisions and ensure that compositions and restrictions of strong formal subdivisions themselves yield strong formal subdivisions (Stapledon, 20 Nov 2025, Dornian et al., 2020).
2. The Non-Hausdorff Mapping Cylinder and Canonical Bijection
Given any order-preserving map between posets, the non-Hausdorff mapping cylinder $\Cyl(\sigma)$ is the poset on with covering relations:
- if and in ,
- if and in ,
- if in .
The mapping cylinder construction provides a functorial and combinatorial gluing of and via . This leads to the canonical bijection:
- Each strong formal subdivision gives rise to , where $\Gamma = \Cyl(\sigma)$, , and the rank function extends those on and .
- Conversely, given a lower Eulerian poset and a join-admissible , one obtains via .
This bijection establishes a structural correspondence between subdivisions and pairs , with a lower Eulerian poset and a non-minimal join-admissible element (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).
3. -Index, Local -Index, and the Mixed -Index
Given an Eulerian poset of rank , the -index is a homogeneous non-commutative polynomial in variables that encodes the flag enumeration of the chains in . For near-Eulerian posets (certain subsets of Eulerian posets satisfying parity conditions), the local -index refines by isolating the local contribution of a poset in a subdivision.
For a strong formal subdivision with associated mapping cylinder $\Gamma = \Cyl(\sigma)$, the -index satisfies a recursive formula:
with all terms of strictly smaller rank (Stapledon, 20 Nov 2025).
The mixed -index is a polynomial in noncommuting variables which encodes both the subdivision and the base poset:
where is the fiber over (Dornian et al., 2020).
These indices give rise to mixed and local -polynomials via canonical maps and capture decomposition properties of subdivisions.
4. Relations to Kazhdan–Lusztig–Stanley Theory
The local -polynomials associated to strong formal subdivisions are tightly linked to the invariants in KLS theory. For lower Eulerian posets with suitable kernels in their incidence algebras, the left and right KLS functions satisfy canonical involution identities:
and assemble to a symmetric -function.
In the context of a subdivision , the local -polynomial and its differences govern the restriction of KLS functions:
and similar formulas for . These identities provide deep combinatorial and representation-theoretic structure, including applications to the computation and interpretation of relative -polynomials in terms of local -polynomials (Stapledon, 20 Nov 2025).
5. Equivariant and Polyhedral Generalizations
If a finite group acts by order automorphisms preserving a -invariant rank function, the incidence algebra and all associated invariants admit natural -equivariant analogues. In this context:
- The equivariant kernel satisfies .
- All KLS-theoretic and -function results extend to the -equivariant setting, with explicit invariants computed via evaluation on fixed-point posets .
- For -invariant fans or polyhedral subdivisions, there is a canonical equivariant kernel via determinants of induced affine actions, making the entire formalism applicable to equivariant Ehrhart theory.
When applied to lattice polytopes and their subdivisions, equivariant Ehrhart series and -series can be explicitly described in terms of subdivisions and associated local KLS data. If a -invariant unimodular triangulation exists, the equivariant -polynomial coincides with the -polynomial derived from the strong formal subdivision structure (Stapledon, 20 Nov 2025).
6. Decomposition Theorem and Explicit Examples
The decomposition theorem for the -index, extended to strong formal subdivisions, states:
breaking complex invariants into local contributions from fibers over elements . This result generalizes and organizes classical decompositions (e.g., for barycentric subdivisions and explicit combinatorial polytopal subdivisions).
Explicit calculations for small examples confirm the framework. For instance, for the barycentric subdivision (edge subdivided at its midpoint), the mixed -index is . For (triangle to hexagon), the expansion involves several , , , terms, reflecting the finer structure of the subdivision (Dornian et al., 2020).
7. Significance and Applications
The machinery of strong formal subdivisions provides a robust abstraction of geometric and combinatorial subdivision phenomena, enabling:
- Precise decomposition and recursion formulas for -indices and -polynomials.
- Unified connections among poset invariants, KLS theory, representation theory, and Ehrhart theory.
- Novel approaches to local and relative invariants (e.g., the connection between relative -polynomials and local -polynomials).
- Equivariant generalizations necessary for applications in localization, invariants under group actions, and combinatorial representation theory.
The framework thus represents an overview of combinatorial, topological, and algebraic techniques, with further developments anticipated in poset-theoretic models of geometric representation theory and algebraic combinatorics (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025, Dornian et al., 2020).