Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2305.02672

Proving Properties of $φ$-Representations with the Walnut Theorem-Prover

Jeffrey Shallit
View original source ↗Read source document ↗Export metadata ↓

Abstract

We revisit a classic theorem of Frougny and Sakarovitch concerning automata for $φ$-representations, and show how to obtain it in a different and more computationally direct way. Using it, we can find simple, induction-free proofs of existing results in the literature about these representations, in a uniform and straightforward manner. In particular, we can easily and "automatically'' recover many of the results of recent papers of Dekking and Van Loon. We also obtain a number of new results on $φ$-representations.

Explore related subjects

math.NTcs.DMcs.FL

Keep this discovery

BibTeXRIS

Jeffrey Shallit. 2024-09-06. Proving Properties of $φ$-Representations with the Walnut Theorem-Prover. https://doi.org/10.46298/cm.12627

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.DM subjectcs.FL subjectmath.NT subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2024

Summing the sum of digits

We revisit and generalize inequalities for the summatory function of the sum of digits in a given integer base. We prove that several known results can be deduced from a theorem in a 2023 paper by Mohanty, Greenbury, Sarkany, Narayanan, Dingle, Ahnert, and Louis, whose primary scope is the maximum mutational robustness in genotype-phenotype maps.

math.NT↗
arXiv2026

Eleven, twelve, and thirteen lonely runners

Wills conjectured that, for any non-zero integers $u_1,\ldots,u_k$, there is a real number $t$ such that, for all $i=1,\ldots,k$, \[\lVert tu_i\rVert\geq\frac{1}{k+1},\] where $\lVert x\rVert$ is the distance from $x$ to the closest integer. This statement is known as the Lonely Runner Conjecture. A computational method developed by Rosenfeld and the second author verified the conjecture for $k\leq9$. We further refine this method with new sieving techniques and employ a polynomial method argument to show that any $(u_1,\ldots,u_k)\equiv(1,2,\ldots,k)\pmod{p}$ with $\gcd(u_1,\ldots,u_k)=1$ satisfies the conjecture when $k+1$ and $p > k^2+k$ are both odd primes. Ultimately, we provide a computer-assisted proof of the Lonely Runner Conjecture for $k\in\{10,11,12\}$.

math.CO↗
arXiv2026

Logarithmic Chowla Correlations Across All Shift Scales

Let $λ(n)=(-1)^{Ω(n)}$ be the Liouville function. We prove a fixed power-logarithmic bound for its logarithmically weighted two-point correlations across the full shift range. There is an absolute $c>0$ such that every sufficiently large $x$ admits a single set $\mathcal E_x\subseteq[1,x]$ with $|\mathcal E_x\cap[1,H]|\ll_A H(\log x)^{-A}$ $(1\le H\le x)$ for every fixed $A>0$, while $\max_{\substack{1\le h\le x\ h\notin\mathcal E_x}}\sup_{1\le y\le x}\left|\sum_{n\le y}\frac{λ(n)λ(n+h)}{n}\right|\ll(\log x)^{1-c}$. The same exceptional-set formulation extends, without an upper cutoff, to all positive integer shifts. Earlier full-range theorems average over the shift; here a fixed saving holds pointwise outside one set whose density in every initial segment is smaller than every fixed negative power of $\log x$. The new middle-scale argument combines a general-good-modulus Liouville deletion lemma with a linear bad-modulus score, a progression Fourier estimate, and a Mellin-localized dilation that separates divisor-dependent endpoints. Maximal fixed-moment bounds evacuate the low prefix and control the long-shift range. Assuming GRH for primitive Dirichlet $L$-functions, we also prove, uniformly for $h\in\mathbb N$ and $1\le y\le x$, $\left|\sum_{n\le y}\frac{λ(n)λ(n+h)}{n}\right|\le\log(2\min{h,y})+O((\log x)^{1-c_{\mathrm G}})$ for an absolute $c_{\mathrm G}>0$, with no exceptional shifts.

math.NT↗