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

Let $\Theta = (\theta_1,\theta_2,\theta_3)\in \mathbb{R}^3$. Suppose that $1,\theta_1,\theta_2,\theta_3$ are linearly independent over $\mathbb{Z}$. For Diophantine exponents $$ \alpha(\Theta) = \sup \{\gamma >0:\,\,\, \limsup_{t\to…

The loop equation formalism is used to compute the $1/N$ expansion of the resolvent for the Gaussian $\beta$ ensemble up to and including the term at $O(N^{-6})$. This allows the moments of the eigenvalue density to be computed up to and…

Let $\Psi :[1,\infty )\rightarrow \mathbb{R}_{+}$ be a non-decreasing function, $a_{n}(x)$ the $n$'{th} partial quotient of $x$ and $q_{n}(x)$ the denominator of the $n$'{th} convergent. The set of $\Psi $-Dirichlet non-improvable numbers…

Solutions to the random Fibonacci recurrence x_{n+1}=x_{n} + or - Bx_{n-1} decrease (increase) exponentially, x_{n} = exp(lambda n), for sufficiently small (large) B. In the limits B --> 0 and B --> infinity, we expand the Lyapunov exponent…

Several expansions of the solutions to the confluent Heun equation in terms of incomplete Beta functions are constructed. A new type of expansion involving certain combinations of the incomplete Beta functions as expansion functions is…

We define a suffixient set for a text $T [1..n]$ to be a set $S$ of positions between 1 and $n$ such that, for any edge descending from a node $u$ to a node $v$ in the suffix tree of $T$, there is an element $s \in S$ such that $u$'s path…

In this paper we study a quantitative notion of exactness within Diophantine approximation. Given $\Psi:(0,\infty)\to (0,\infty)$ and $\omega:(0,\infty)\to (0,1)$ satisfying $\lim_{q\to\infty}\omega(q)=0$, we study the set of points, which…

A {\em subsequence} of a word $w$ is a word $u$ that can be obtained by deleting some letters from $w$ while maintaining the relative order of the remaining letters, e.g., $\mathtt{lala}$ is a subsequence of $\mathtt{alfalfa}$. A word, over…

From the works of Rauzy and Thurston, we know how to construct (multiple) tilings of some Euclidean space using the conjugates of a Pisot unit $\beta$ and the greedy $\beta$-transformation. In this paper, we consider different…

We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if the number of occurrences of blocks of symbols…

The idea behind Poisson approximation to the binomial distribution was used in [J. de la Cal, F. Luquin, J. Approx. Theory, 68(3), 1992, 322-329] and subsequent papers in order to establish the convergence of suitable sequences of positive…

Given an increasing integer sequence $(a_n)$, a real number $\alpha$, and a sequence $\psi(n)$, we study the set $W$ of real numbers $\gamma$ for which $a_n\alpha - \gamma$ is a distance less than $\psi(n)$ away from an integer. This is…

Let $\beta$ be a non-unit real algebraic integer greater than one and $\{a_{n}\}_{n \geq 0}$ be a sequence satisfying a linear recurrence relation $a_{n+3}=aa_{n+2}+ba_{n+1}+ca_{n}$. Under certain conditions, we prove that the number of…

For $\zeta$ a transcendental real number, we consider the classical Diophantine exponents $w_{n}(\zeta)$ and $\widehat{w}_{n}(\zeta)$. They measure how small $| P(\zeta)|$ can be for an integer polynomial $P$ of degree at most $n$ and naive…

Two sets $A,B$ of positive integers are called \emph{exact additive complements}, if $A+B$ contains all sufficiently large integers and $A(x)B(x)/x\rightarrow1$. Let $A=\{a_1<a_2<\cdots\}$ be a set of positive integers. Denote $A(x)$ by the…

We show that for a fixed integer $n \neq \pm2$, the congruence $x^2 + nx \pm 1 \equiv 0 \pmod{\alpha}$ has the solution $\beta$ with $0 < \beta < \alpha$ if and only if $\alpha/\beta$ has a continued fraction expansion with sequence of…

For $\alpha, \beta, \delta \in [0,1], \alpha +\beta = 1 $ we consider sets $$ {\rm BAD}^* (\alpha, \beta ;\delta) = \left\{\xi = (\xi_1,\xi_2) \in [0,1]^2: ,\inf_{p\in \mathbb{N}} \max \{(p\log(p+1))^\alpha ||p\xi_1||, (p\log (p+1))^\beta…

We consider random Fibonacci sequences given by $x_{n+1}=\pm \beta x_{n}+x_{n-1}$. Viswanath (\cite{viswanath}), following Furstenberg (\cite{furst}) showed that when $\beta = 1$, $\lim_{n\to \infty}|x_{n}|^{1/n}=1.13...$, but his proof…

The classical Poisson theorem says that if $\xi_1,\xi_2,...$ are i.i.d. 0--1 Bernoulli random variables taking on 1 with probability $p_n\equiv \la/n$ then the sum $S_n=\sum_{i=1}^n\xi_i$ is asymptotically in $n$ Poisson distributed with…

A suffixient set is a novel combinatorial object that captures the essential information of repetitive strings in a way that, provided with a random access mechanism, supports various forms of pattern matching. In this paper, we study the…