Explicit asymptotics for signed binomial sums and applications to the Carnevale-Voll conjecture

From MaRDI portal
Publication:5113820

zbMATH Open1448.11049arXiv2006.09704MaRDI QIDQ5113820FDOQ5113820


Authors: Laurent Habsieger Edit this on Wikidata


Publication date: 17 June 2020

Abstract: Carnevale and Voll conjectured that j (--1) j lambda 1 j lambda 2 j = 0 when lambda 1 and lambda 2 are two distinct integers. We check the conjecture when either lambda 2 or lambda 1 -- lambda 2 is small. We investigate the asymptotic behaviour of their sum when the ratio r := lambda 1 /lambda 2 is fixed and lambda 2 goes to infinity. We find an explicit range r ge 5.8362 on which the conjecture is true. We show that the conjecture is almost surely true for any fixed r. For r close to 1, we give several explicit intervals on which the conjecture is also true.


Full work available at URL: https://arxiv.org/abs/2006.09704

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Uses Software





This page was built for publication: Explicit asymptotics for signed binomial sums and applications to the Carnevale-Voll conjecture

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113820)