Related papers: Approximation properties of $\beta$-expansions

A permutation $\sigma=\sigma_1 \sigma_2 \cdots \sigma_n$ has a descent at $i$ if $\sigma_i>\sigma_{i+1}$. A descent $i$ is called a peak if $i>1$ and $i-1$ is not a descent. The size of the set of all permutations of $n$ with a given…

Let $\mathcal{S}=\{1^2,2^2,3^2,...\}$ be the set of squares and $\mathcal{W}=\{w_n\}_{n=1}^{\infty} \subset \mathbb{N}$ be an additive complement of $\mathcal{S}$ so that $\mathcal{S} + \mathcal{W} \supset \{n \in \mathbb{N}: n \geq N_0\}$…

Given a sequence of real numbers $\{\psi(n)\}_{n\in\mathbb{N}}$ with $0\leq \psi(n)<1$, let $W(\psi)$ denote the set of $x\in[0,1]$ for which $|xn-m|<\psi(n)$ for infinitely many coprime pairs $(n,m)\in\mathbb{N}\times\mathbb{Z}$. The…

Fix $\delta\in(0,1]$, $\sigma_0\in[0,1)$ and a real-valued function $\varepsilon(x)$ for which $\limsup_{x\to\infty}\varepsilon(x)\le 0$. For every set of primes ${\mathcal P}$ whose counting function $\pi_{\mathcal P}(x)$ satisfies an…

Two infinite sequences A and B of non-negative integers are called additive complements, if their sum contains all sufficiently large integers. Let $A(x)$ and $B(x)$ be the counting functions of A and B. In this paper, we extend the results…

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

For any $\beta > 1$, let $T_\beta: [0,1)\rightarrow [0,1)$ be the $\beta$-transformation defined by $T_\beta x=\beta x \mod 1$. We study the uniform recurrence properties of the orbit of a point under the $\beta$-transformation to the point…

The celebrated Johnson-Lindenstrauss lemma states that for all $\varepsilon \in (0,1)$ and finite sets $X \subseteq \mathbb{R}^N$ with $n>1$ elements, there exists a matrix $\Phi \in \mathbb{R}^{m \times N}$ with…

Real-world data contains various kinds of errors. Before analyzing data, one usually needs to process the raw data. However, traditional data processing based on exactly match often misses lots of valid information. To get high-quality…

Relatively little is known about the arithmetic properties of Gamma-function derivatives evaluated at arbitrary points $q\in\mathbb{Q}\setminus\mathbb{Z}_{\leq0}$. In recent work, we showed that the sequence…

In this paper we consider the fractional parts of a general sequence, for example the sequence $\alpha \sqrt{n}$ or $\alpha n^2$. We give a general method, which allows one to show that long-range correlations (correlations where the…

Consider $\beta > 1$ and $\lfloor \beta \rfloor$ its integer part. It is widely known that any real number $\alpha \in \Bigl[0, \frac{\lfloor \beta \rfloor}{\beta - 1}\Bigr]$ can be represented in base $\beta$ using a development in series…

We provide a new proof of the near-critical scaling relation $\beta=\xi_1\nu$ for Bernoulli percolation on the square lattice already proved by Kesten in 1987. We rely on a novel approach that does not invoke Russo's formula, but rather…

Some important applicative problems require the evaluation of functions $\Psi$ of large and sparse and/or \emph{localized} matrices $A$. Popular and interesting techniques for computing $\Psi(A)$ and $\Psi(A)\mathbf{v}$, where $\mathbf{v}$…

Let $\{u_n\}_n$ be a non-degenerate linear recurrence sequence of integers with Binet's formula given by $u_n= \sum_{i=1}^{m} P_i(n)\alpha_i^n.$ Assume $\max_i \vert \alpha_i \vert >1$. In 1977, Loxton and Van der Poorten conjectured that…

By exploiting the well-known observation that size-biasing or zero-biasing an infinitely divisible random variable may be achieved by adding an independent increment, combined with tools from Stein's method for compound Poisson and Gaussian…

A set $M\subset\mathbb{R}$ is microscopic if for each $\varepsilon>0$ there is a sequence of intervals $(J_n)_{n\in\omega}$ covering $M$ and such that $|J_n|\leq \varepsilon^{n+1}$ for each $n\in\omega$. We show that there is a microscopic…

The parametric complexity is the key quantity in the minimum description length (MDL) approach to statistical model selection. Rissanen and others have shown that the parametric complexity of a statistical model approaches a simple function…

We introduce a new exponent of simultaneous rational approximation $\widehat{\lambda}_{\min}(\xi,\eta)$ for pairs of real numbers $\xi,\eta$, in complement to the classical exponents $\lambda(\xi,\eta)$ of best approximation, and…

For a word $\pi$ and integer $i$, we define $L^i(\pi)$ to be the length of the longest subsequence of the form $i(i+1)\cdots j$, and we let $L(\pi):=\max_i L^i(\pi)$. In this paper we estimate the expected values of $L^1(\pi)$ and $L(\pi)$…