Face numbers of barycentric subdivisions of cubical complexes

The $h$-polynomial of the barycentric subdivision of any $n$-dimensional cubical complex with nonnegative cubical $h$-vector is shown to have only real roots and to be interlaced by the Eulerian polynomial of type $B_n$. This result applies to barycentric subdivisions of shellable cubical complexes and, in particular, to barycentric subdivisions of cubical convex polytopes and answers affirmatively a question of Brenti, Mohammadi and Welker.Comment: Final version; minor changes, 11 page

Enumerative gg-theorems for the Veronese construction for formal power series and graded algebras

Let $(a_n)_{n \geq 0}$ be a sequence of integers such that its generating series satisfies $\sum_{n \geq 0} a_nt^n = \frac{h(t)}{(1-t)^d}$ for some polynomial $h(t)$. For any $r \geq 1$ we study the coefficient sequence of the numerator polynomial $h_0(a^{}) +...+ h_{\lambda'}(a^{}) t^{\lambda'}$ of the $r$\textsuperscript{th} Veronese series $a^{}(t) = \sum_{n \geq 0} a_{nr} t^n$. Under mild hypothesis we show that the vector of successive differences of this sequence up to the $\lfloor \frac{d}{2} \rfloor$\textsuperscript{th} entry is the $f$-vector of a simplicial complex for large $r$. In particular, the sequence satisfies the consequences of the unimodality part of the $g$-conjecture. We give applications of the main result to Hilbert series of Veronese algebras of standard graded algebras and the $f$-vectors of edgewise subdivisions of simplicial complexes

Face enumeration on simplicial complexes

Let $M$ be a closed triangulable manifold, and let $\Delta$ be a triangulation of $M$. What is the smallest number of vertices that $\Delta$ can have? How big or small can the number of edges of $\Delta$ be as a function of the number of vertices? More generally, what are the possible face numbers ($f$-numbers, for short) that $\Delta$ can have? In other words, what restrictions does the topology of $M$ place on the possible $f$-numbers of triangulations of $M$? To make things even more interesting, we can add some combinatorial conditions on the triangulations we are considering (e.g., flagness, balancedness, etc.) and ask what additional restrictions these combinatorial conditions impose. While only a few theorems in this area of combinatorics were known a couple of decades ago, in the last ten years or so, the field simply exploded with new results and ideas. Thus we feel that a survey paper is long overdue. As new theorems are being proved while we are typing this chapter, and as we have only a limited number of pages, we apologize in advance to our friends and colleagues, some of whose results will not get mentioned here.Comment: Chapter for upcoming IMA volume Recent Trends in Combinatoric