Related papers: Sparse subsets of the natural numbers and Euler's …

In this note, we provide refined estimates of the following sums involving the Euler totient function: $$\sum_{n\le x} \phi\left(\left[\frac{x}{n}\right]\right) \qquad \text{and} \qquad \sum_{n\le x} \frac{\phi([x/n])}{[x/n]}$$ where $[x]$…

The aim of this note is to provide an upper bound of the number of positive integers $\le x$ which can be written as $\varphi(n)$ for some positive integer $n$, where $\varphi$ stands for the Euler's function. The order of magnitude of this…

The notion of nowhere denseness is one of the central concepts of the recently developed theory of sparse graphs. We study the properties of nowhere dense graph classes by investigating appropriate limit objects defined using the…

In this note we study numerically the combinatorics of curves and geodesics on the torus with one boundary component. A potential computational difficulty is avoided by counting inside specific orbits of the mapping class group up to a…

A simple remark on infinite series is presented. This applies to a particular recursion scenario, which in turn has applications related to a classical theorem on Euler's phi-function and to recent work by Ron Brown on natural density of…

This paper examines the level sets of the continuous but nowhere differentiable functions \begin{equation*} f_r(x)=\sum_{n=0}^\infty r^{-n}\phi(r^n x), \end{equation*} where $\phi(x)$ is the distance from $x$ to the nearest integer, and $r$…

We develop a representative-level framework for the Liebscher-Tsirelson random-set construction of Arveson systems from stationary factorizing measure types. We introduce the notion of a measurable factorizing family of probability measures…

Let $I(n) = \frac{\psi(\phi(n))}{\phi(\psi(n))}$ and $K(n) = \frac{\psi(\phi(n))}{\phi(\phi(n))}$, where $\phi(n)$ is Euler's function and $\psi(n)$ is Dedekind's arithmetic function. We obtain the maximal order of $I(n)$, as well as the…

Deep neural networks have emerged as powerful tools for learning operators defined over infinite-dimensional function spaces. However, existing theories frequently encounter difficulties related to dimensionality and limited…

For a function $f\colon \mathbb{N}\to\mathbb{N}$, let $$ N^+_f(x)=\{n\leq x: n=k+f(k) \mbox{ for some } k\}. $$ Let $\tau(n)=\sum_{d|n}1$ be the divisor function, $\omega(n)=\sum_{p|n}1$ be the prime divisor function, and…

The study of substructures in random objects has a long history, beginning with Erd\H{o}s and R\'enyi's work on subgraphs of random graphs. We study the existence of certain substructures in random subsets of vector spaces over finite…

Let $P^-(n)$ denote the smallest prime factor of a natural integer $n>1$. Furthermore let $\mu$ and $\omega$ denote respectively the M\"obius function and the number of distinct prime factors function. We show that, given any set ${{\scr…

Given a set $A\subseteq\mathbb{N}$, we consider the relationship between stability of the structure $(\mathbb{Z},+,0,A)$ and sparsity of the set $A$. We first show that a strong enough sparsity assumption on $A$ yields stability of…

When investigating the distribution of the Euler totient function, one encounters sets of primes P where if p is in P then r is in P for all r|(p-1). While it is easy to construct finite sets of such primes, the only infinite set known is…

A family of m independent identically distributed random variables indexed by a chemical potential \phi\in[0,\gamma] represents piles of particles. As \phi increases to \gamma, the mean number of particles per site converges to a maximal…

A composite number $n$ is called Lehmer when $\phi(n) | n - 1$, where $\phi$ is the Euler totient function. In 1932, D.~H.~Lehmer conjectured that there are no composite Lehmer numbers and showed that Lehmer numbers must be odd and…

We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…

We tackle the problem of template estimation when data have been randomly transformed under an isometric group action in the presence of noise. In order to estimate the template, one often minimizes the variance when the influence of the…

A \emph{numerical semigroup} is a subset $\Lambda$ of the nonnegative integers that is closed under addition, contains $0$, and omits only finitely many nonnegative integers (called the \emph{gaps} of $\Lambda$). The collection of all…

We study the sets that are computable from both halves of some (Martin-L\"of) random sequence, which we call \emph{$1/2$-bases}. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e.\…