Search arXivSearch

arXiv · 2609.16913

Further results on non-negativity conjectures for copartition products

Abstract

Burson and Eichhorn proposed infinite and finite coefficientwise non-negativity conjectures for products arising from copartitions. We obtain several further results. First, both products admit decompositions into elementary local blocks, and the finite conjecture reduces exactly to its diagonal specialization. The finite conjecture is proved when the first truncation parameter is one or when the two residue parameters are equal. We also prove that every finite product has non-negative coefficients below the third shifted signed exponent. For fixed finite parameters, the coefficient sequence is shown to be eventually quasipolynomial; an explicit period bound, an explicit onset for the quasipolynomial formula, and the leading term on every residue class are obtained. This yields eventual strict positivity, apart from forced odd-degree zeros in one solved diagonal case. For the infinite conjecture, we prove non-negativity under the broader condition $a\equiv b\pmod m$, which includes the known case $a=b$. Finally, for arbitrary $b\mid a$, we improve the uniform initial non-negative range from degrees below $a+m$ to degrees below $a+2m$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Haijun Li. 2026-09-15. Further results on non-negativity conjectures for copartition products. https://arxiv.org/abs/2609.16913

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO