A lower bound for Cusick’s conjecture on the digits of n + t

DOI10.1017/S0305004121000153MaRDI QIDQ5019791zbMATH OpenOpenAlexWikidataFDO

Authors Lukas Spiegelhofer

Publication date 11 January 2022

Published in Mathematical Proceedings of the Cambridge Philosophical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

binary sum-of-digits function

Mathematics Subject Classification ID

Radix representation; digital problems (11A63)

Abstract: Let $s$ be the sum-of-digits function in base $2$, which returns the number of $mathtt1$s in the base-2 expansion of a nonnegative integer. For a nonnegative integer $t$, define the asymptotic density [ c_t=lim_{N ightarrow infty} frac 1N�igllvert{0leq n<N:s(n+t)geq s(n)}�igr vert.] T.~W.~Cusick conjectured that $c_t>1/2$. We have the elementary bound $0<c_t<1$; however, no bound of the form $0<alphaleq{c}_t$ or $$, valid for all $t$, is known. In this paper, we prove that $c_t>1/2-varepsilon$ as soon as $t$ contains sufficiently many blocks of $mathtt1$s in its binary expansion. In the proof, we provide estimates for the moments of an associated probability distribution; this extends the study initiated by Emme and Prikhod'ko (2017) and pursued by Emme and Hubert (2018).

Recommendations

• On a conjecture of Cusick concerning the sum of digits of n and n+t
• Approaching Cusick's conjecture on the sum-of-digits function
• A lower bound for a remainder term associated with the sum of digits function
• A lower bound of Ruzsa's number related to the Erdős-Turán conjecture
• scientific article; zbMATH DE number 1343383
• A result on the digits of aⁿ
• On Gelfond's conjecture about the sum of digits of prime numbers
• scientific article; zbMATH DE number 5022978
• scientific article; zbMATH DE number 1746423
• Stolarsky’s conjecture and the sum of digits of polynomial values

Cites work

• A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
• A Remark on Stirling's Formula
• A reverse order property of correlation measures of the sum-of-digits function
• Analytic combinatorics
• Approaching Cusick's conjecture on the sum-of-digits function
• Boolean functions optimizing most of the cryptographic criteria
• Central limit theorem for probability measures defined by sum-of-digits function in base 2
• Discrepancy results for the van der Corput sequence
• scientific article; zbMATH DE number 3645208 (Why is no real title available?)
• scientific article; zbMATH DE number 4067037 (Why is no real title available?)
• Indépendance statistique d'ensembles liés à la fonction "somme des chiffres"
• On a combinatorial conjecture
• On a combinatorial conjecture of Tu and Deng
• On a Conjecture about Binary Strings Distribution
• On a conjecture of Cusick concerning the sum of digits of n and n+t
• On the asymptotic behavior of density of sets defined by sum-of-digits function in base 2
• Precise distribution properties of the van der Corput sequence and related sequences
• Probabilistic diophantine approximation. Randomness in lattice point counting
• The number of weak orderings of a finite set
• The ring of k-regular sequences
• The Tu-Deng conjecture holds almost surely

Cited in

(10)

• The sum-of-digits function on arithmetic progressions
• On a conjecture of Cusick concerning the sum of digits of n and n+t
• Approaching Cusick's conjecture on the sum-of-digits function
• scientific article; zbMATH DE number 5022978 (Why is no real title available?)
• The binary digits of n+t
• On the variation of the sum of digits in the Zeckendorf representation: an algorithm to compute the distribution and mixing properties
• Collisions of digit sums in bases 2 and 3
• The Tu-Deng conjecture holds almost surely
• Decomposing the sum-of-digits correlation measure
• Block occurrences in the binary expansion

This page was built for publication: A lower bound for Cusick’s conjecture on the digits of n + t

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