Metraipolis › archive › dc_048126378fad

The sharp constant in the Mashreghi-Ransford inequality — arXiv:2609.08852

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.08852
License (as archived)
CC0-1.0
Archived
2026-10-16T14:49:30.691Z
SHA-256 of the archived text
829dcda308ea08e529cfe9f7b1ac5c7da7439c35d44e3d03315496fd1de5f7f5
Stable URL of this page
https://metraipolis.com/documento/dc_048126378fad

How to cite

The sharp constant in the Mashreghi-Ransford inequality — arXiv:2609.08852 — arXiv (en), https://arxiv.org/abs/2609.08852 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_048126378fad (Metraipolis archive dc_048126378fad, sha256 829dcda308ea08e529cfe9f7b1ac5c7da7439c35d44e3d03315496fd1de5f7f5)
BibTeX
@misc{dc048126378fad,
  title = {The sharp constant in the Mashreghi-Ransford inequality — arXiv:2609.08852},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.08852},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_048126378fad; sha256 829dcda308ea08e529cfe9f7b1ac5c7da7439c35d44e3d03315496fd1de5f7f5},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08852. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Let $(a_n)_{n\geq0}$ be a sequence of complex numbers, and define \[ b_n=\sum_{k=0}^n \binom{n}{k} a_k, \qquad c_n=\sum_{k=0}^n \binom{n}{k}(-1)^{n-k}a_k. \] Let $\beta>1$, put $\alpha=\sqrt{\beta^2-1}$, and suppose that $b_n,c_n=O(\beta^n)$. Mashreghi and Ransford proved that \[ \limsup_{n\to\infty}\frac{|a_n|}{\alpha^n} \leq \kappa \left(\limsup_{n\to\infty}\frac{|b_n|}{\beta^n}\right)^{\!1/2}\! \left(\limsup_{n\to\infty}\frac{|c_n|}{\beta^n}\right)^{\!1/2} \] with a universal constant satisfying $2/\sqrt{3} \leq \kappa\leq2$. We prove that the optimal constant is indeed $\kappa=2/\sqrt{3}$. The proof, which uses exponential generating functions, Phragmén-Lindelöf estimates, and Cauchy's formula, is compared to the classical one of Mashreghi and Ransford.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO).
Categorie arXiv: Complex Variables (math.CV) ; Combinatorics (math.CO); Number Theory (math.NT).
Pagina del lavoro: https://arxiv.org/abs/2609.08852 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:32:29.954Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).