Explicit asymptotics for signed binomial sums and applications to the Carnevale-Voll conjecture
From MaRDI portal
Publication:5113820
Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial identities, bijective combinatorics (05A19) Special sequences and polynomials (11B83) Dirichlet series, exponential series and other series in one complex variable (30B50) Functional analytic techniques in dynamical systems; zeta functions, (Ruelle-Frobenius) transfer operators, etc. (37C30) Binomial coefficients; factorials; (q)-identities (11B65)
Abstract: Carnevale and Voll conjectured that j (--1) j 1 j 2 j = 0 when 1 and 2 are two distinct integers. We check the conjecture when either 2 or 1 -- 2 is small. We investigate the asymptotic behaviour of their sum when the ratio r := 1 / 2 is fixed and 2 goes to infinity. We find an explicit range r 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.
Recommendations
Cites work
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)