Searcharxiv⌕ Search

arXiv · 2610.33653

A new arrangement inequality (revised and extended version)

Abstract

We study the cyclic inequality \[ \sum_{i=1}^n x_i\,\sum_{i=1}^n x_i^a x_{i+1}^b\;\le\;\Big(\sum_{i=1}^n x_i^{(1+a+b)/2}\Big)^2, \] where $x_1,\dots,x_n\ge 0$ and indices are taken modulo $n$. Let $N(a,b)$ be the largest $n$ for which the inequality holds for all nonnegative $x_i$. We show that $N(a,b)$ is bounded above by an explicit quantity $N^*(a,b)$ obtained from the second variation at the constant vector, and we conjecture that $N(a,b)=N^*(a,b)$. For $a=b=1$ we prove that the inequality holds if and only if $n\le 8$, which settles the case left open in the original version of this paper. For $n=4$ the inequality holds whenever $1,a,b$ are the sides of a triangle, with an explicit remainder term. We show that $N$ is monotone along rays emanating from the line $a+b=1$; this corrects and extends an earlier monotonicity statement. Finally, any $n$ nonnegative numbers can be arranged so that the inequality holds; for $n\neq 6$ this is achieved by one of $n-1$ prescribed arrangements, which yields a volume bound for every such $n$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohammad Javaheri. 2026-10-24. A new arrangement inequality (revised and extended version). https://arxiv.org/abs/2610.33653

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

KEEP EXPLORING

Related papers

On the Bounds of Stopping and Cycle Numbers in the Collatz Process

We study the stopping time and cycle structure of the normalized Collatz iteration using a binary sequence formalism. By introducing a recursive rooted sequence tree by Winkler (2017), we establish a bijection between admissible binary sequences and integers $m \equiv 3 \pmod{4}$, showing that every such integer arises uniquely in this construction. Within this framework, we derive sharp lower and upper bounds for the weighted digit-sum $\sum_{i=1}^{r} 3^{r-i} 2^{\mathbf{1}(i)-1}$, namely \[ 3^r - 2^r \;\leq\; \sum_{i=1}^{r} 3^{r-i}\, 2^{\mathbf{1}(i)-1} \;\leq\; r \cdot 3^{r-1}, \] the upper bound being strictly tighter than the bound $s \cdot 3^r$ previously established by Luca (2005). These bounds yield corresponding sharp bounds on any hypothetical cycle number $m_c$, and imply that the ratio $F_q(m)/m$ satisfies \[ 1 - \varepsilon_1 \;<\; \frac{F_q(m)}{m} \;<\; 1 + \varepsilon_2, \] with $F_q(m)/m \to 1$ as $r \to \infty$, while the ratio $3^r/2^s$ approaches but never reaches $1$ for any finite admissible sequence. We further show that the ratio of the maximum to minimum summation satisfies $α(r) \sim r/3$ as $r \to \infty$, providing a theoretical basis for the empirically observed scaling $α\approx \max(r)/3$. Together, these results imply that any nontrivial cycle number, if one exists, must grow without bound and satisfy increasingly stringent arithmetic constraints, consistent with all known computational and theoretical bounds on the Collatz conjecture.

math.GM↗

A systematic approach to Diophantine equations: two thousand solved examples

Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete solutions to all these equations. The difficulties of solved equations range from elementary to research level. In the last section, we present a summary table of all solved equations ordered by their size, which makes them easy to find. As a result, this document may be used as a database of solved Diophantine equations of small size, to which more difficult equations can be reduced.

math.GM↗