Skip to content
DraconiticResearch
Search Sources API
197,761 studies31 sourcesUpdated 10 min ago
PreprintarXiv licencearXiv

The sharp constant in the Mashreghi-Ransford inequality

Abstract

Let (an)n≥0 be a sequence of complex numbers, and define bn=∑k=0n binomnk ak, cn=∑k=0n binomnk(−1)n−kak. Let β>1, put α=√(β2−1), and suppose that bn,cn=O(βn). Mashreghi and Ransford proved that limsupn→∞|an|/αn ≤ κ(limsupn→∞|bn|/βn) 1/2 (limsupn→∞|cn|/βn) 1/2 with a universal constant satisfying 2/√3 ≤ κ≤2. We prove that the optimal constant is indeed κ=2/√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.

Related

  1. The sharp constant in the Chang--Marshall inequality
    Rupert L. Frank, Paata Ivanisvili
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  2. Attainment of the sharp stability constant of Beckner conformal log-Sobolev inequality
    Lu Chen, Bohan Wang
    arXivPreprintarXiv licenceFull textAnalysis & PDEsarXiv
  3. Digesting the proof of the sharp thin-shell inequality
    Yuansi Chen, Bo’az Klartag
    arXiv (Cornell University)PreprintLicence not statedFull text13 citedGeneral mathematicsOpenAlex
  4. Stability of Szarek's inequality with best constant
    Xinyuan Xie
    arXivPreprintarXiv licenceFull textAnalysis & PDEsGeometry & topologyarXiv
  5. The Sharp Isoperimetric Inequality in the First Heisenberg Group
    Wei-Chun Chen, Wei-Ting Kao, Chun-Kai Lien
    arXivPreprintarXiv licenceFull textGeometry & topologyarXiv
BibTeX
@misc{bouthat2026sharp,
  title = {{The sharp constant in the Mashreghi-Ransford inequality}},
  author = {Ludovick Bouthat},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.08852},
  eprint = {2609.08852},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.08852},
}
RIS
TY  - UNPB
TI  - The sharp constant in the Mashreghi-Ransford inequality
AU  - Ludovick Bouthat
PY  - 2026
DA  - 2026/09/08
PB  - arXiv
DO  - 10.48550/arxiv.2609.08852
UR  - https://arxiv.org/abs/2609.08852
AB  - Let (a_n)_n≥0 be a sequence of complex numbers, and define b_n=∑_k=0^n binomnk a_k, c_n=∑_k=0^n binomnk(−1)^n−ka_k. Let β>1, put α=√(β^2−1), and suppose that b_n,c_n=O(β^n). Mashreghi and Ransford proved that limsup_n→∞|a_n|/α^n ≤ κ(limsup_n→∞|b_n|/β^n)^ 1/2 (limsup_n→∞|c_n|/β^n)^ 1/2 with a universal constant satisfying 2/√3 ≤ κ≤2. We prove that the optimal constant is indeed κ=2/√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.
ER  -