Papers
Topics
Authors
Recent
2000 character limit reached

Strong Formal Subdivision Theory

Updated 21 November 2025
  • Strong formal subdivision is an order-preserving, rank-increasing surjective map between lower Eulerian posets, defined by a strict local Euler characteristic condition.
  • It arises from a canonical mapping cylinder construction that establishes a bijection with join-admissible triples, linking combinatorial, topological, and algebraic properties.
  • Applications include polytope subdivisions, fan morphisms, and computations of invariants such as the cd-index and local h-polynomials in both standard and equivariant contexts.

A strong formal subdivision is an order-preserving, rank-increasing surjective morphism between lower Eulerian posets that satisfies a strict local Euler characteristic condition. This concept simultaneously abstracts polyhedral subdivisions of polytopes and proper surjective morphisms of fans, encapsulating their combinatorial, topological, and algebraic properties. The framework naturally leads to a canonical bijection with certain join-admissible triples in lower Eulerian posets via the non-Hausdorff mapping cylinder construction, resulting in deep connections to flag invariants, the cd-index, local hh-polynomials, and Kazhdan–Lusztig–Stanley theory.

1. Lower Eulerian Posets and Strong Formal Subdivisions

A finite poset PP is ranked if there exists a rank function ρ:PZ\rho:P\to\mathbb{Z} such that ρ(y)=ρ(x)+1\rho(y) = \rho(x) + 1 whenever yy covers xx. The poset is locally Eulerian if for every interval [x,y][x,y], the number of elements of even rank equals that of odd rank; it is lower Eulerian if, in addition, a unique minimal element 0^\hat{0} exists. A poset is Eulerian if it is lower Eulerian with a unique maximal element 1^\hat{1} (Stapledon, 20 Nov 2025).

Let XX and YY be lower Eulerian posets with rank functions ρX\rho_X and ρY\rho_Y. A map σ:XY\sigma: X\to Y is called a strong formal subdivision if it is:

  • order-preserving,
  • rank-increasing: ρX(x)ρY(σ(x))\rho_X(x)\le\rho_Y(\sigma(x)) for all xXx\in X,
  • strongly surjective: for every xXx\in X, yYy\in Y with σ(x)y\sigma(x)\le y, there is xxx'\ge x in XX so that ρX(x)=ρY(y)\rho_X(x')=\rho_Y(y) and σ(x)=y\sigma(x')=y,
  • and for every xXx\in X and yYy\in Y with σ(x)y\sigma(x)\le y,

xxXsigma(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.

These properties are designed to guarantee that the fibers over points in YY have the right local Euler characteristic, ensuring compatibility with subdivisions arising in geometry or topology (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).

2. The Canonical Cylinder Bijection and Join-Admissible Triples

Each strong formal subdivision σ:XY\sigma:X\to Y corresponds canonically to a triple (Γ,ρΓ,q)(\Gamma, \rho_\Gamma, q), where Γ\Gamma is a lower Eulerian poset with rank function ρΓ\rho_\Gamma and q0^Γq\ne \hat{0}_\Gamma is join-admissible (i.e., zqz\vee q exists for all zΓz\in\Gamma). This relationship is established via the non-Hausdorff mapping cylinder construction:

  • The mapping cylinder Cyl(σ)\mathrm{Cyl}(\sigma) is the disjoint union XYX\sqcup Y with the original orders and additional relations xyx\le y whenever xXx\in X, yYy\in Y, and σ(x)y\sigma(x)\le y.
  • The rank function is defined by ρCyl(z)=ρX(z)\rho_{\mathrm{Cyl}}(z) = \rho_X(z) for zXz\in X, ρCyl(z)=ρY(z)+1\rho_{\mathrm{Cyl}}(z)=\rho_Y(z)+1 for zYz\in Y.
  • The triple (Γ,ρΓ,q)(\Gamma, \rho_\Gamma, q) is (Cyl(σ),ρCyl,0^Y)(\mathrm{Cyl}(\sigma), \rho_{\mathrm{Cyl}}, \hat{0}_Y).

Conversely, starting from such a triple, the strong formal subdivision is recovered as

σ:ΓΓqΓq,xxq\sigma: \Gamma \setminus \Gamma_{\ge q} \longrightarrow \Gamma_{\ge q},\quad x \mapsto x\vee q

with the appropriate (possibly shifted) rank functions. This bijection underpins the combinatorial abstraction of geometric subdivision phenomena and provides a natural vehicle for structural translation across discrete and geometric settings (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).

3. Examples and Structural Significance

Strong formal subdivisions naturally model a range of examples:

  • Polytope Subdivisions: A refinement SS' of a polyhedral subdivision SS of a polytope PP induces

σ:face(S)face(S)\sigma:\mathrm{face}(S')\to\mathrm{face}(S)

mapping each cell to the minimal SS-cell containing it, giving a strong formal subdivision of rank $0$ (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).

  • Fan Morphisms: A proper surjective map of fans ΣΣ\Sigma'\to\Sigma induces face(Σ)face(Σ)\mathrm{face}(\Sigma')\to\mathrm{face}(\Sigma), a strong formal subdivision of rank equal to the kernel dimension of the underlying vector space map.
  • Identity Map: For any lower Eulerian poset BB, the identity map idB:BB\mathrm{id}_B: B\to B is a strong formal subdivision, whose cylinder is the pyramid poset Pyr(B)\mathrm{Pyr}(B).
  • One-Point Adjunctions: The join-admissible element qq in the cylinder construction corresponds combinatorially to joining with an "adjoined" minimum.

The mapping cylinder provides a categorical 'join' operation interpolating between domain and codomain posets, supporting recursion and uniform proofs for invariants (Stapledon, 20 Nov 2025).

4. Invariants: cd-Index and Flag Polynomials

For Eulerian posets, the flag ff-polynomial

Ψ(B;a,b)=S[n]fSwS,wS=i=1n[iSb;  iS(ab)]\Psi(B;a,b) = \sum_{S\subseteq[n]} f_S\,w_S,\quad w_S = \prod_{i=1}^n [i\in S\mapsto b;\;i\notin S\mapsto (a-b)]

encodes face incidence data. The unique polynomial Φ(B;c,d)\Phi(B;c,d) in noncommuting cc and dd satisfying Φ(a+b,ab+ba)=Ψ(B;a,b)\Phi(a+b, ab+ba) = \Psi(B;a,b) is the cd-index.

Under the strong formal subdivision setting and cylinder construction, the cd-index can be computed recursively:

Φ(Γ)=Φ(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) + \tfrac{1}{2}\bigl[\Phi(\overline{\partial X})\,c + \Phi\bigl(\overline{X_{\le \hat0_Y}}\bigr)c\,\Phi(Y) + \sum_{\hat0_Y<y<\hat1_Y} \bigl(\ell^\Phi(X_{\le y})c + \Phi(\overline{X_{<y})}d\bigr)\,\Phi([y,\hat1_Y]) \bigr]

where Φ(X)\ell^\Phi(X) is the local cd-index, and overbars indicate certain quotient posets (Stapledon, 20 Nov 2025).

This recurrence applies to standard constructions, such as pyramids, prisms, and bipyramids, and demonstrates the algorithmic tractability of computing the cd-index via strong formal subdivision theory.

5. Local hh-Polynomials and Kazhdan–Lusztig–Stanley Invariants

Given a strong formal subdivision ϕ:PQ\phi: P\to Q with cylinder Γ\Gamma, the local hh-polynomial ϕ\ell_\phi is constructed via the incidence algebras associated to the Eulerian kernel κ(x,y)=(t1)ρ(y)ρ(x)\kappa(x,y) = (t-1)^{\rho(y)-\rho(x)}. For P,QP, Q Eulerian,

ϕ=ϕ(0^P,1^Q)\ell_\phi = \ell_\phi(\hat0_P, \hat1_Q)

is symmetric and unimodal, as proved by Karu.

The main connection to Kazhdan–Lusztig–Stanley (KLS) invariants is as follows. Let gΓg_\Gamma, gQg_Q be the left-KLS functions for Γ\Gamma, QQ respectively, and define the involution and Δ\Delta operator on symmetric polynomials

prev(x,y;t)=trΓ(x,y)p(x,y;t1),Δp=(prevp)/(t1)p^{\mathrm{rev}}(x,y;t) = t^{r_\Gamma(x,y)} p(x,y; t^{-1}),\qquad \Delta p = (p^{\mathrm{rev}} - p)/(t-1)

Then,

gΓ(x,y)=yΔϕ(x,y)gQ(y,y)g_\Gamma(x,y) = \sum_{y'} \Delta \ell_\phi(x, y')\, g_Q(y', y)

with analogous statements for right-KLS and the ZZ-function (Stapledon, 20 Nov 2025).

This formalism further unifies local hh-polynomials, KLS functions, and relative gg-polynomials. For instance, when QQ is a polytope face lattice and PP arises from a projective subdivision,

g(Q,F)=Δϕ(0^P,1^Q)g(Q,F) = \Delta\, \ell_\phi(\hat0_P, \hat1_Q)

demonstrating that Braden–MacPherson's relative gg-polynomials coincide with these local hh-polynomials (Stapledon, 20 Nov 2025).

6. Equivariant Generalizations and Ehrhart Theory Applications

If a finite group WW acts compatibly on the posets, all incidence algebra constructions lift to the equivariant setting, resulting in equivariant KLS functions and local hh-polynomials valued in representation rings. For a WW-invariant lattice polytope PP subdivided by a WW-invariant subdivision SS,

h(P,W;t)=FSWFWIndWFW((F,WF;t)hϕ(F,1^))h^*(P,W;t) = \sum_{F\in S} \frac{|W_F|}{|W|} \,\mathrm{Ind}_{W_F}^W \left( \ell^*(F,W_F;t)\,h_\phi(F, \hat1)\right)

where h(P,W;t)h^*(P,W;t) is the equivariant hh^*-series, and \ell^* denotes the local equivariant hh^*-series. For unimodular triangulations, h(P,W;t)h^*(P,W;t) equals the equivariant hh-polynomial hϕ(0^,1^)h_\phi(\hat0, \hat1) (Stapledon, 20 Nov 2025).

This framework unifies and generalizes combinatorial and cohomological results: Stanley's theory of subdivisions, intersection cohomology-based proofs of local hh symmetry and unimodality, and the equivariant Braden–MacPherson gg-polynomials—all subsumed via the strong formal subdivision theory and the canonical cylinder bijection.

7. Summary Table: Key Structures in Strong Formal Subdivision Theory

Structure Description Origin/Example
Lower Eulerian poset Ranked poset with unique 0^\hat0, locally Eulerian intervals Face lattice of a polytope, fan poset
Strong formal subdivision Order-preserving, rank-increasing surjection satisfying ()(*) Polytope/fan subdivision morphism
Mapping cylinder Cyl(σ)\mathrm{Cyl}(\sigma) Poset on XYX \sqcup Y with induced and bridging order Used in canonical bijection construction
Join-admissible element qq Non-minimum qq s.t.\ zqz\vee q exists for all zz in Γ\Gamma Pointed face in a face lattice
Local hh-polynomial Derived from fibers of σ\sigma in incidence algebra; symmetric Tracks refined face structure
cd-index Encodes flag ff-vector information via noncommuting variables c,dc,d Provides recursive invariants
KLS-invariants Kazhdan–Lusztig–Stanley functions; recover local hh via subdivision Enables intersection cohomology linkage
Equivariant versions Invariance under group actions; values in representation rings Ehrhart theory, group-labeled polytopes

Strong formal subdivisions provide a unified combinatorial structure for analyzing subdivisions in discrete geometry and topology. This theory supports explicit calculation of invariants relevant in enumerative, geometric, and representation-theoretic contexts, and facilitates their extension to equivariant and cohomological settings (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).

Definition Search Book Streamline Icon: https://streamlinehq.com
References (2)

Whiteboard

Topic to Video (Beta)

Follow Topic

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