Related papers: Local $h$-polynomials, uniform triangulations and …
The $r$-fold edgewise subdivision is a well studied flag triangulation of the simplex with interesting algebraic, combinatorial and geometric properties. An important enumerative invariant, namely the local $h$-polynomial, of this…
An enumerative theory of triangulations of simplicial complexes has been developed by Stanley. A key role in his theory is played by the local $h$-polynomial of a triangulation of a simplex. This paper develops a parallel theory, in which…
The antiprism triangulation provides a natural way to subdivide a simplicial complex $\Delta$, similar to barycentric subdivision, which appeared independently in combinatorial algebraic topology and computer science. It can be defined as…
In this paper, we answer two questions on local $h$-vectors, which were asked by Athanasiadis. First, we characterize all possible local $h$-vectors of quasi-geometric subdivisions of a simplex. Second, we prove that the local…
The enumerative theory of simplicial subdivisions (triangulations) of simplicial complexes was developed by Stanley in order to understand the effect of such subdivisions on the $h$-vector of a simplicial complex. A key role there is played…
Face numbers of triangulations of simplicial complexes were studied by Stanley by use of his concept of a local $h$-vector. It is shown that a parallel theory exists for cubical subdivisions of cubical complexes, in which the role of the…
A triangulation of a simplicial complex $\Delta$ is called uniform if the $f$-vector of its restriction to a face of $\Delta$ depends only on the dimension of that face. This paper proves that the entries of the $h$-vector of a uniform…
Motivated by connections to intersection homology of toric morphisms, the motivic monodromy conjecture, and a question of Stanley, we study the structure of triangulations of simplices whose local h-polynomial vanishes. As a first step, we…
Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…
Athanasiadis conjectured that, for every positive integer $r$, the local $h$-polynomial of the $r$th edgewise subdivision of any simplex has only real zeros. In this paper, based on the theory of interlacing polynomials, we prove that a…
There are natural polynomial invariants of polytopes and lattice polytopes coming from enumerative combinatorics and Ehrhart theory, namely the $h$- and $h^*$-polynomials, respectively. In this paper, we study their generalization to…
The coefficients of the local $h$-polynomial of the barycentric subdivision of the simplex with $n$ vertices are known to count derangements in the symmetric group $\mathfrak{S}_n$ by the number of excedances. A generalization of this…
We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…
Hypersimplices are well-studied objects in combinatorics, optimization, and representation theory. For each hypersimplex, we define a new family of subpolytopes, called r-stable hypersimplices, and show that a well-known regular unimodular…
This article introduces Gamma-triangles, which are closely related to and more fundamental than F-triangles and H-triangles that have been used in the combinatorics of cluster complexes. It is proved that Gamma-triangles can be expressed as…
Every symmetric polynomial $h(x)$ with center of symmetry $n/2$ can be expressed as a linear combination in the basis $x^i(1+x)^{n-2i}$. The $\gamma$-polynomial of $h(x)$, which we denote $\gamma_h(x)$, records the coefficients of this…
The derangement polynomial for the symmetric group enumerates derangements by the number of excedances. It can be interpreted as the local $h$-polynomial, in the sense of Stanley, of the barycentric subdivision of the simplex. Motivated by…
There is currently a growing interest in understanding which lattice simplices have unimodal local $h^\ast$-polynomials (sometimes called box polynomials); specifically in light of their potential applications to unimodality questions for…
Reduction trees are a way of encoding a substitution procedure dictated by the relations of an algebra. We use reduction trees in the subdivision algebra to construct canonical triangulations of flow polytopes which are shellable. We…
Athanasiadis raised the question whether the local $h$-polynomials of type $A$ cluster subdivisions have only real zeros. In this paper, we confirm this conjecture and prove the real-rootedness of local $h$-polynomials for all the other…