Pith. sign in

REVIEW

Preservation of log-concavity on gamma polynomials

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.08948 v2 pith:I3SZ6PGS submitted 2025-02-13 math.CO

Preservation of log-concavity on gamma polynomials

classification math.CO
keywords gammacombinationferronijochemkolinearlog-concavitypolynomialpolynomials
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

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 linear combination. Two decades ago, Br\"and\'en and Gal independently showed that if $\gamma_h(x)$ has nonpositive real roots only, then so does $h(x)$. More recently, Br\"and\'en, Ferroni, and Jochemko proved using Lorentzian polynomials that if $\gamma_h(x)$ is ultra log-concave, then so is $h(x)$, and they raised the question of whether a similar statement can be proved for the usual notion of log-concavity. The purpose of this article is to show that the answer to the question of Br\"and\'en, Ferroni, and Jochemko is affirmative. One of the crucial ingredients of the proof is an inequality involving binomial numbers that we establish via a path-counting argument.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.