Papers
Topics
Authors
Recent
2000 character limit reached

Strong Formal Subdivisions in Combinatorics

Updated 21 November 2025
  • 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 cdcd-index and local hh-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 XX and YY be finite lower Eulerian posets equipped with rank functions ρX,ρY\rho_X, \rho_Y (that is, for any element zz' covering zz, ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 1, and every closed interval in BB contains the same number of even- and odd-ranked elements).

An order-preserving, rank-increasing, surjective map σ:XY\sigma: X \to Y is called a strong formal subdivision (SFS) if it satisfies:

  • Strong Surjectivity: For every xXx\in X, yYy\in Y with σ(x)y\sigma(x) \leq y, there exists xxx'\geq x with ρX(x)=ρY(y)\rho_X(x') = \rho_Y(y) and σ(x)=y\sigma(x') = y.
  • Parity-sum Condition (Incidence Parity): For every xXx\in X, yYy\in Y with σ(x)y\sigma(x) \leq y,

xxX σ(x)=y(1)ρY(y)ρX(x)=1.\sum_{\substack{x\le x'\in X \ \sigma(x')=y}} (-1)^{\rho_Y(y) - \rho_X(x')} = 1.

Equivalently,

xxX σ(x)y(1)ρY(y)ρX(x)={1if σ(x)=y, 0if σ(x)<y.\sum_{\substack{x\le x'\in X \ \sigma(x')\le y}} (-1)^{\rho_Y(y) - \rho_X(x')} = \begin{cases} 1 & \text{if } \sigma(x) = y, \ 0 & \text{if } \sigma(x) < y. \end{cases}

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 σ:XY\sigma: X \to Y between posets, the non-Hausdorff mapping cylinder $\Cyl(\sigma)$ is the poset on XYX \sqcup Y with covering relations:

  • x<xx < x' if x,xXx, x' \in X and x<xx < x' in XX,
  • y<yy < y' if y,yYy, y' \in Y and y<yy < y' in YY,
  • x<yx < y if σ(x)y\sigma(x) \leq y in YY.

The mapping cylinder construction provides a functorial and combinatorial gluing of XX and YY via σ\sigma. This leads to the canonical bijection:

  • Each strong formal subdivision σ:XY\sigma: X \to Y gives rise to (Γ,ρΓ,q)(\Gamma, \rho_\Gamma, q), where $\Gamma = \Cyl(\sigma)$, q=0^Yq = \hat{0}_Y, and the rank function ρΓ\rho_\Gamma extends those on XX and YY.
  • Conversely, given a lower Eulerian poset (Γ,ρΓ)(\Gamma, \rho_\Gamma) and a join-admissible q0^Γq \neq \hat{0}_\Gamma, one obtains σ:X=ΓΓqY=Γq\sigma: X = \Gamma \setminus \Gamma_{\ge q} \to Y = \Gamma_{\ge q} via xxqx \mapsto x \vee q.

This bijection establishes a structural correspondence between subdivisions and pairs (Γ,q)(\Gamma, q), with Γ\Gamma a lower Eulerian poset and qq a non-minimal join-admissible element (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).

3. cdcd-Index, Local cdcd-Index, and the Mixed cdcd-Index

Given an Eulerian poset BB of rank n+1n+1, the cdcd-index Φ(B;c,d)\Phi(B; c, d) is a homogeneous non-commutative polynomial in variables c,dc, d that encodes the flag enumeration of the chains in BB. For near-Eulerian posets (certain subsets of Eulerian posets satisfying parity conditions), the local cdcd-index Φ(P)\ell^\Phi(P) refines Φ\Phi by isolating the local contribution of a poset PP in a subdivision.

For a strong formal subdivision σ:XY\sigma: X \to Y with associated mapping cylinder $\Gamma = \Cyl(\sigma)$, the cdcd-index satisfies a recursive formula:

Φ(Γ)=Φ(X)+12[Φ(X)c+Φ(X0^Y)cΦ(Y)+0^Y<y<1^Y(Φ(Xy)c+Φ(X<y)d)Φ([y,1^Y])],\Phi(\Gamma) = \ell^\Phi(X) + \frac{1}{2} \Big[ \Phi(\overline{\partial X}) c + \Phi(\overline{X_{\le \hat0_Y}}) c \Phi(Y) + \sum_{\hat0_Y < y < \hat1_Y} (\ell^\Phi(X_{\le y}) c + \Phi(\overline{X_{<y}}) d ) \Phi([y, \hat1_Y]) \Big],

with all terms of strictly smaller rank (Stapledon, 20 Nov 2025).

The mixed cdcd-index is a polynomial in noncommuting variables c,d,c,d,ec', d', c, d, e which encodes both the subdivision and the base poset:

Ωϕ(c,d;c,d,e)=xBΓxΦ(c,d)Φ[x,1^B](c,d,e),\Omega_\phi(c', d'; c, d, e) = \sum_{x \in B} \ell^\Phi_{\Gamma_x}(c', d') \cdot \Phi_{[x, \hat1_B]}(c, d, e),

where Γx\Gamma_x is the fiber over xx (Dornian et al., 2020).

These indices give rise to mixed and local hh-polynomials via canonical maps and capture decomposition properties of subdivisions.

4. Relations to Kazhdan–Lusztig–Stanley Theory

The local hh-polynomials associated to strong formal subdivisions are tightly linked to the invariants in KLS theory. For lower Eulerian posets with suitable kernels κΓ\kappa_\Gamma in their incidence algebras, the left and right KLS functions gΓ,fΓg_\Gamma, f_\Gamma satisfy canonical involution identities:

fBrev=κBfB,gBrev=gBκB,f_B^{\mathrm{rev}} = \kappa_B f_B, \quad g_B^{\mathrm{rev}} = g_B \kappa_B,

and assemble to a symmetric ZZ-function.

In the context of a subdivision σ:XY\sigma: X \to Y, the local hh-polynomial σ\ell_\sigma and its differences govern the restriction of KLS functions:

gΓX/Y=ΔσgΓ,g_\Gamma|_{X/Y} = \Delta\ell_\sigma \cdot g_\Gamma,

ZΓX/Y=ZΓXΔσ^+(Δσ)revZΓY,Z_\Gamma|_{X/Y} = -Z_\Gamma|_X \Delta\widehat{\ell_\sigma} + (\Delta\ell_\sigma)^{\mathrm{rev}} Z_\Gamma|_Y,

and similar formulas for fΓf_\Gamma. These identities provide deep combinatorial and representation-theoretic structure, including applications to the computation and interpretation of relative gg-polynomials in terms of local hh-polynomials (Stapledon, 20 Nov 2025).

5. Equivariant and Polyhedral Generalizations

If a finite group WW acts by order automorphisms preserving a WW-invariant rank function, the incidence algebra and all associated invariants admit natural WW-equivariant analogues. In this context:

  • The equivariant kernel satisfies κ1=κrev\kappa^{-1} = \kappa^{\mathrm{rev}}.
  • All KLS-theoretic and ZZ-function results extend to the WW-equivariant setting, with explicit invariants computed via evaluation on fixed-point posets BwB^w.
  • For WW-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 hh^*-series can be explicitly described in terms of subdivisions and associated local KLS data. If a WW-invariant unimodular triangulation exists, the equivariant hh^*-polynomial coincides with the hh-polynomial derived from the strong formal subdivision structure (Stapledon, 20 Nov 2025).

6. Decomposition Theorem and Explicit Examples

The decomposition theorem for the cdcd-index, extended to strong formal subdivisions, states:

ΦΓ(c,d)=xBΓxΦ(c,d)Φ[x,1^B](c,d),\Phi_\Gamma(c,d) = \sum_{x \in B} \ell^\Phi_{\Gamma_x}(c,d) \Phi_{[x, \hat1_B]}(c,d),

breaking complex invariants into local contributions from fibers over elements xx. 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 S2B2S_2 \to B_2 (edge subdivided at its midpoint), the mixed cdcd-index is ΩS2B2=c+de\Omega_{S_2 \to B_2} = c + d'e. For S3B3S_3 \to B_3 (triangle to hexagon), the expansion involves several cc, dd, cc', dd' 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 cdcd-indices and hh-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 gg-polynomials and local hh-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).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (3)
Slide Deck Streamline Icon: https://streamlinehq.com

Whiteboard

Forward Email Streamline Icon: https://streamlinehq.com

Follow Topic

Get notified by email when new papers are published related to Strong Formal Subdivisions.