Search arXivSearch

arXiv · 2402.11620

The Briggs inequality of Boros-Moll sequences

Abstract

Briggs conjectured that if a polynomial $a_0+a_1x+\cdots+a_nx^n$ with real coefficients has only negative zeros, then $$a^2_k(a^2_k - a_{k-1}a_{k+1}) > a^2_{k-1}(a^2_{k+1} - a_ka_{k+2})$$ for any $1\leq k\leq n-1$. The Boros-Moll sequence $\{d_i(m)\}_{i=0}^m$ arises in the study of evaluation of certain quartic integral, and a lot of interesting inequalities for this sequence have been obtained. In this paper we show that the Boros-Moll sequence $\{d_i(m)\}_{i=0}^m$, its normalization $\{d_i(m)/i!\}_{i=0}^m$, and its transpose $\{d_i(m)\}_{m\ge i}$ satisfy the Briggs inequality. For the first two sequences, we prove the Briggs inequality by using a lower bound for $(d_{i-1}(m)d_{i+1}(m))/d_i^2(m)$ due to Chen and Gu and an upper bound due to Zhao. For the transposed sequence, we derive the Briggs inequality by establishing its strict ratio-log-convexity. As a consequence, we also obtain the strict log-convexity of the sequence $\{\sqrt[n]{d_i(i+n)}\}_{n\ge 1}$ for $i\ge 1$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhong-Xue Zhang, James Jing Yu Zhao. 2024-02-18. The Briggs inequality of Boros-Moll sequences. https://arxiv.org/abs/2402.11620

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