Unimodality conjecture for products of q-analogs
Unimodality conjecture for products of q-analogs
Let , , and let be positive integers. Write and, for an integer , write . The product q-analog conjecture. If for some , or
then the polynomial
is unimodal. Moreover, if or , this condition is also necessary. This proposed generalization is motivated by preceding results on products of -analogs; the stated cases and necessity claim are not established in the source and remain open.
Progress summary
The conjecture was newly formulated and computationally tested in small cases in May 2026, but no proof or disproof has been publicly verified.
Connelly, Ito, Martinez, Shevchenko, and Yang proposed that the product is unimodal under the stated divisibility or inequality condition, and that the condition is necessary when or . The paper presents both assertions as conjectures.
Known results
- Computationally verified for , , and (Connelly, Ito, Martinez, Shevchenko, and Yang, 2026).
- Outside the proposed necessity ranges, the condition is known not to be necessary: is unimodal despite violating it (2026).
May 2026 paper
The authors’ paper records Conjecture 5.4 but gives no proof of either sufficiency or necessity, and no verified counterexample within the claimed necessity ranges. The retrieved literature contains no later proof, disproof, or corroborating settlement.
Current status (as of August 2026): The conjecture remains open; only bounded computational checks and examples outside the proposed necessity ranges are established.
Sources
Sources & referencesView supporting material
Primary source
Brendan B. Connelly, Ezekiel Ito, Thomas C. Martinez, Olha Shevchenko and Kacey Yang, “Unimodality of q-Fibonomial coefficients for small cases”, arXiv:2605.12822 (2026).
Solutions 1
Sign in to submit a solution.
Infinitely many counterexamples to the claimed necessity, beginning immediately beyond the tested range. The conjecture asserts that if or , then unimodality of
requires either for some , or
Set
No is divisible by , and
Thus both supposedly necessary alternatives fail. Nevertheless,
whose coefficient sequence
is symmetric and unimodal. Since , this lies directly within the conjectured necessity range.
More generally, for every , take , , and . The two numerical alternatives still both fail, while
remains symmetric and unimodal. Indeed, if is symmetric, unimodal, and nonnegative, the coefficients of are ; they are symmetric and increase up to the midpoint because
Induction proves the claim for every .
The authors explicitly tested only , explaining why this entire infinite family was missed. This disproves the asserted necessity when ; the separate sufficiency assertion and the necessity assertion are not decided here.
Source: Connelly, Ito, Martinez, Shevchenko, and Yang, Unimodality of -Fibonomial coefficients for small cases, Conjecture 5.4.