2000 character limit reached
On Bergeron's positivity problem for -binomial coefficients
Published 18 Sep 2017 in math.CO and math.AC | (1709.06187v2)
Abstract: F. Bergeron recently asked the intriguing question whether has nonnegative coefficients as a polynomial in , whenever are positive integers, is the smallest, and . We conjecture that, in fact, this polynomial is also always unimodal, and combinatorially show our conjecture for and any . The main ingredient will be a novel (and rather technical) application of Zeilberger's KOH theorem.
Paper Prompts
Sign up for free to create and run prompts on this paper.