SearcharxivSearch

arXiv · 2609.22324

Sign patterns of real powers of infinite products: resolution of four conjectures of Schlosser and Zhou

Abstract

For an infinite product P(q) = prod_{m>=1} (1-q^m)^{eps(m)} and real delta, write P(q)^delta = sum_{n>=0} c_delta(n) q^n. Schlosser and Zhou conjectured precise sign patterns for these coefficients, for several products and ranges of delta. We resolve four of their conjectures completely, in each case extending partial results already in the literature: those for the Goellnitz-Gordon product Q_8 = (q,q^7;q^8)_inf/(q^3,q^5;q^8)_inf (Conjecture 21), for Q_12 = (q,q^11;q^12)_inf/(q^5,q^7;q^12)_inf (Conjecture 24), and for the Borwein products G_7 and G_11 (Conjectures 20 and 23). Conjecture 23 is true. Conjecture 21 fails exactly on [beta, 8/3), where beta is approximately 2.66448; the threshold 8/3 is sharp, and the first counterexamples occur near n = 7.6 x 10^5. Conjecture 24 fails exactly on (delta_1, 0), where delta_1 = -0.64411... is a root of the 22nd coefficient polynomial. Conjecture 20 fails exactly on (delta_c, 5), where delta_c = 4.8735075853867342634... is a root of the 897th coefficient polynomial. All other stated ranges are proved. Parts of Conjecture 21 were settled independently by He and Li; what is new here is the range near delta = -1, where their threshold diverges. Each failure has the same mechanism: a leading circle-method amplitude vanishes, and a secondary term with the wrong sign overtakes it. The proofs are self-contained apart from classical facts. The cusp analysis is exact, via finite orbits of Weil representations; the Hardy-Ramanujan-Rademacher expansion is made fully explicit; and certified computations in exact and ball arithmetic handle the finite ranges and the degenerate regimes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jaideep Sai Padhi. 2026-09-16. Sign patterns of real powers of infinite products: resolution of four conjectures of Schlosser and Zhou. https://arxiv.org/abs/2609.22324

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