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

DOI10.1017/S0305004121000153zbMath1486.11011arXiv1910.13170OpenAlexW3131421945WikidataQ113857570 ScholiaQ113857570MaRDI QIDQ5019791

Lukas Spiegelhofer

Publication date: 11 January 2022

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

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)

Related Items

The binary digits of n+t

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Boolean functions optimizing most of the cryptographic criteria
• A conjecture about binary strings and its applications on constructing Boolean functions with optimal algebraic immunity
• The Tu-Deng conjecture holds almost surely
• The ring of \(k\)-regular sequences
• The number of weak orderings of a finite set
• Precise distribution properties of the van der Corput sequence and related sequences
• On a Conjecture of Cusick Concerning the Sum of Digits of $n$ and $n+t$
• Probabilistic Diophantine Approximation
• On a Combinatorial Conjecture
• A Remark on Stirling's Formula
• On a Conjecture about Binary Strings Distribution
• Central limit theorem for probability measures defined by sum-of-digits function in base 2
• Discrepancy Results for The Van Der Corput Sequence
• Approaching Cusick's conjecture on the sum-of-digits function
• On the asymptotic behaviour of the correlation measure of sum-of-digits function in base 2
• Indépendance statistique d'ensembles liés à la fonction "somme des chiffres"