Related papers: Ternary expansions of powers of 2

Shmuel Friedland and Giorgio Ottaviani's beautiful constant term expression for the number of singular vector tuples of generic tensors is used to derive a rational generating function for these numbers, that in turn, is used to obtain an…

Consider an arbitrary extension of a free $\mathbb Z^d$-action on the Cantor set. It is shown that it has dynamical asymptotic dimension at most $3^d - 1$.

In 1996 Y. Kifer obtained a variational formula for the Hausdorff dimension of the set of points for which the frequencies of the digits in the Cantor series expansion is given. In this note we present a slightly different approach to this…

It is believed that, under very general conditions, bi-infinite geodesics (or bigeodesics) do not exist for planar first and last passage percolation (LPP) models. However, if one endows the model with a natural dynamics, thereby gradually…

Consider exponential Carmichael function $\lambda^{(e)}$ such that $\lambda^{(e)}$ is multiplicative and $\lambda^{(e)}(p^a) = \lambda(a)$, where $\lambda$ is usual Carmichael function. We discuss the value of $\sum \lambda^{(e)}(n)$, where…

The Collatz, or 3x+1, Conjecture claims that for every positive integer n, there exists some k such that T^k(n)=1, where T is the Collatz map. We present three cellular automata (CA) that transform the global problem of mimicking the…

We show that, for any $0<\gamma<1/2$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set with Hausdorff dimension about $\sqrt{\gamma}$, any small $0<\varepsilon<1$ and any large $N\in\mathbb{N}$, the number of integers $n\in[1,N]$ such…

We consider several old problems involving the number of prime divisors function $\omega(n)$, as well as the related functions $\Omega(n)$ and $\tau(n)$. Firstly, we show that there are infinitely many positive integers $n$ such that…

Here we examine the number of ways to partition an integer $n$ into $k$th powers when $n$ is large. Simplified proofs of some asymptotic results of Wright are given using the saddle-point method, including exact formulas for the expansion…

In the paper we study transformations of the interval $[0;1)$ and functions that preserve the asymptotic mean $r$ of the digits in the $s$--adic representation of a number $x$,…

I show here that there are three different kinds of iterations for the reduced Collatz algorithm; depending on whether the root of the number is odd or even. There is only one kind of iteration if the root is odd and two kinds if the root…

We develop a systematic approach to continuous substitutions on compact Hausdorff alphabets. Focussing on implications of irreducibility and primitivity, we highlight important features of the topological dynamics of their (generalised)…

We study the quantitative unique continuation property of some higher order elliptic operators. In the case of $P=(-\Delta)^m$, where $m$ is a positive integer, we derive lower bounds of decay at infinity for any nontrivial solutions under…

It is known that there are classes of 2-CNFs requiring exponential size non-deterministic read-once branching programs to compute them. However, to the best of our knowledge, there are no superpolynomial lower bounds for branching programs…

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

Duadic codes are a class of cyclic codes that generalizes quadratic residue codes from prime to composite lengths. For every prime power q, we characterize the integers n such that over the finite field with q^2 elements there is a duadic…

For relatively prime positive integers u_0 and r, we consider the arithmetic progression {u_k := u_0+k*r} (0 <= k <= n). Define L_n := lcm{u_0,u_1,...,u_n} and let a >= 2 be any integer. In this paper, we show that, for integers alpha,r >=…

Despite many applications, dimensionality reduction in the $\ell_1$-norm is much less understood than in the Euclidean norm. We give two new oblivious dimensionality reduction techniques for the $\ell_1$-norm which improve exponentially…

We give an elementary proof that the sum of the digits of $2^n$ in base 10 is greater than $\log_4 n$. In particular, the limit of the sum of digits of $2^n$ is infinite.

We classify transcendental entire functions that are compositions of a polynomial and the exponential for which all singular values escape on disjoint rays. We focus on the case where the escape is degenerate in the sense that points from…