Papers
Topics
Authors
Recent
Search
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 study 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 hh0, hh1 with hh2, there exists hh3 with hh4 and hh5.
  • Parity-sum Condition (Incidence Parity): For every hh6, hh7 with hh8,

hh9

Equivalently,

XX0

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 XX1 between posets, the non-Hausdorff mapping cylinder XX2 is the poset on XX3 with covering relations:

  • XX4 if XX5 and XX6 in XX7,
  • XX8 if XX9 and YY0 in YY1,
  • YY2 if YY3 in YY4.

The mapping cylinder construction provides a functorial and combinatorial gluing of YY5 and YY6 via YY7. This leads to the canonical bijection:

  • Each strong formal subdivision YY8 gives rise to YY9, where ρX,ρY\rho_X, \rho_Y0, ρX,ρY\rho_X, \rho_Y1, and the rank function ρX,ρY\rho_X, \rho_Y2 extends those on ρX,ρY\rho_X, \rho_Y3 and ρX,ρY\rho_X, \rho_Y4.
  • Conversely, given a lower Eulerian poset ρX,ρY\rho_X, \rho_Y5 and a join-admissible ρX,ρY\rho_X, \rho_Y6, one obtains ρX,ρY\rho_X, \rho_Y7 via ρX,ρY\rho_X, \rho_Y8.

This bijection establishes a structural correspondence between subdivisions and pairs ρX,ρY\rho_X, \rho_Y9, with zz'0 a lower Eulerian poset and zz'1 a non-minimal join-admissible element (Stapledon, 20 Nov 2025, Stapledon, 20 Nov 2025).

3. zz'2-Index, Local zz'3-Index, and the Mixed zz'4-Index

Given an Eulerian poset zz'5 of rank zz'6, the zz'7-index zz'8 is a homogeneous non-commutative polynomial in variables zz'9 that encodes the flag enumeration of the chains in zz0. For near-Eulerian posets (certain subsets of Eulerian posets satisfying parity conditions), the local zz1-index zz2 refines zz3 by isolating the local contribution of a poset zz4 in a subdivision.

For a strong formal subdivision zz5 with associated mapping cylinder zz6, the zz7-index satisfies a recursive formula:

zz8

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

The mixed zz9-index is a polynomial in noncommuting variables ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 10 which encodes both the subdivision and the base poset:

ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 11

where ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 12 is the fiber over ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 13 (Dornian et al., 2020).

These indices give rise to mixed and local ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 14-polynomials via canonical maps and capture decomposition properties of subdivisions.

4. Relations to Kazhdan–Lusztig–Stanley Theory

The local ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 15-polynomials associated to strong formal subdivisions are tightly linked to the invariants in KLS theory. For lower Eulerian posets with suitable kernels ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 16 in their incidence algebras, the left and right KLS functions ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 17 satisfy canonical involution identities:

ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 18

and assemble to a symmetric ρB(z)=ρB(z)+1\rho_B(z') = \rho_B(z) + 19-function.

In the context of a subdivision BB0, the local BB1-polynomial BB2 and its differences govern the restriction of KLS functions:

BB3

BB4

and similar formulas for BB5. These identities provide deep combinatorial and representation-theoretic structure, including applications to the computation and interpretation of relative BB6-polynomials in terms of local BB7-polynomials (Stapledon, 20 Nov 2025).

5. Equivariant and Polyhedral Generalizations

If a finite group BB8 acts by order automorphisms preserving a BB9-invariant rank function, the incidence algebra and all associated invariants admit natural σ:XY\sigma: X \to Y0-equivariant analogues. In this context:

  • The equivariant kernel satisfies σ:XY\sigma: X \to Y1.
  • All KLS-theoretic and σ:XY\sigma: X \to Y2-function results extend to the σ:XY\sigma: X \to Y3-equivariant setting, with explicit invariants computed via evaluation on fixed-point posets σ:XY\sigma: X \to Y4.
  • For σ:XY\sigma: X \to Y5-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 σ:XY\sigma: X \to Y6-series can be explicitly described in terms of subdivisions and associated local KLS data. If a σ:XY\sigma: X \to Y7-invariant unimodular triangulation exists, the equivariant σ:XY\sigma: X \to Y8-polynomial coincides with the σ:XY\sigma: X \to Y9-polynomial derived from the strong formal subdivision structure (Stapledon, 20 Nov 2025).

6. Decomposition Theorem and Explicit Examples

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

hh01

breaking complex invariants into local contributions from fibers over elements hh02. 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 hh03 (edge subdivided at its midpoint), the mixed hh04-index is hh05. For hh06 (triangle to hexagon), the expansion involves several hh07, hh08, hh09, hh10 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 hh11-indices and hh12-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 hh13-polynomials and local hh14-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)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

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