Search arXivSearch

arXiv · 2402.13248

Explicit expressions for the gamma vector leading to connections to upper/lower bounds and structural properties

Abstract

We find an explicit formula for the gamma vector in terms of the input polynomial in a way that extends it to arbitrary polynomials. More specifically, we find explicit linear combination in terms of coefficients of the input polynomial (using Catalan numbers and binomial coefficients) and an expression involving the derivative of the input polynomial. The first expression suggests connections to common Coxeter group/noncrossing partition structures in existing gamma positivity examples. In the case where the input is the $h$-polynomial of a simplicial complex, this gives an interpretation of the gamma vector as a measure of differences in local and global contributions. We also apply them to connect signs/inequalities of (shifts of) the gamma vector to upper/lower bound conditions on coefficients of the input polynomial. Finally, we make use of the shape of the sums used to make these estimates and connections with intersection numbers to relate these properties of the gamma vector to algebraic structures (e.g. characteristic classes involved in existing log concavity and Schur positivity properties).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Soohyun Park. 2024-03-25. Explicit expressions for the gamma vector leading to connections to upper/lower bounds and structural properties. https://arxiv.org/abs/2402.13248

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

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO