Search arXiv⌕ Search

arXiv · 2603.19202

Gamma positivity, PL homeomorphism types, and orthogonal polynomials

Abstract

Using preservations of piecewise linear (PL) homeomorphism types under edge contractions (the link condition) as a topological proxy for flagness, we give a quantitative description of the effect flagness on on gamma positivity of simplicial spheres. In particular, we show that the link condition has a trivial effect on the $g$-vectors (and thus gamma vectors) of high-dimensional simplicial spheres with nonnegative gamma vectors in many cases. Note that this reflects a dichotomy between quantitative behavior arising from $g_1$ components (e.g. measuring ``net number of edge subdivisions'' from the boundary of a cross polytope) that are linear in the dimension and those that are superlinear in the dimension. When the link condition is nontrivial, we show that it gives a lower bound for growth rates of $g$-vector components. This lower bound increases as the number of edges and the distance of the $M$-vector condition on $g$-vectors of simplicial spheres from equality decrease. These lower bounds translate to ones on top gamma vector components and give lower bounds on gamma vector growth rates when the gamma vector components are dominant terms in the $g$-vector components with the same index (e.g. $g$-vectors with components increasing quickly compared to the dimension). Finally, we show that the same results apply to positivity properties generalizing gamma positivity arising from connections between orthogonal polynomials and lattice paths. In the course of doing this, we describe gamma vector components in terms of monomer/dimer covers and point out connections between repeated (stellar) edge subdivisions (Tchebyshev subdivisions) and dimer covers.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Soohyun Park. 2026-03-26. Gamma positivity, PL homeomorphism types, and orthogonal polynomials. https://arxiv.org/abs/2603.19202

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗