相关论文: Ternary Digits of Powers of Two

For $p \in (0,1)$, sample a binary sequence from the infinite product measure of Bernoulli$(p)$ distributions. It is known that for $p=1/2$, almost every binary sequence is Poisson generic in the sense of Peres and Weiss, a property that…

In this paper, we show that the concatenation of the Fibonacci sequence is \textit{normal} in base $10$, meaning every string of a given length, $k$, occurs as frequently as every other string of length $k$ (there are as many $1$'s as $2$'s…

We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…

For integers $k \geq 2$, the $k$-generalized Lucas sequence $\{L_n^{(k)}\}_{n \geq 2-k}$ is defined by the recurrence relation \[ L_n^{(k)} = L_{n-1}^{(k)} + \cdots + L_{n-k}^{(k)} \quad \text{for } n \geq 2, \] with initial terms given by…

Benford's law states that many data sets have a bias towards lower leading digits (about $30\%$ are 1s). There are numerous applications, from designing efficient computers to detecting tax, voter and image fraud. It's important to know…

In this paper we study the set of digit frequencies that are realised by elements of the set of $\beta$-expansions. The main result of this paper demonstrates that as $\beta$ approaches $1,$ the set of digit frequencies that occur amongst…

For every integer \(n\ge 3\), every \(1\le \ell\le n-2\), and every sufficiently large integer \(m\), we construct harmonic functions \(u_{m,\ell}\) on the unit ball \(B_1(0)\subset\mathbb{R}^n\) such that the frequency is bounded…

The aim of this paper is to show a peculiar behavior of a (hypothetical) Collatz sequence going to infinity. We study the associated Syracusa sequence (the odd elements of the former) and show that the limit set of a conveniently normalized…

We obtain assumption-free, non-asymptotic, uniform bounds on the product of the height and the width of uniformly random trees with a given degree sequence, conditioned Bienaym\'e trees and simply generated trees. We show that for a tree of…

We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…

Universal compression of patterns of sequences generated by independently identically distributed (i.i.d.) sources with unknown, possibly large, alphabets is investigated. A pattern is a sequence of indices that contains all consecutive…

Benford's Law is an empirical law which predicts the frequency of significant digits in databases corresponding to various phenomena, natural or artificial. Although counter intuitive at the first sight, it predicts a higher occurrence of…

An equation is obtained for the Stieltjes transform of the normalized distribution of singular values of non-symmetric band random matrices in the limit when the band width and rank of the matrix simultaneously tend to infinity. Conditions…

In this paper, we will see that the proportion of d as leading digit, d $\in$ 1, 9, in data (obtained thanks to the hereunder developed model) is more likely to follow a law whose probability distribution is determined by a specific upper…

In this paper we prove a central limit theorem for some probability measures defined as asymtotic densities of integer sets defined via sum-of-digit-function. To any integer a we can associate a measure on Z called $\mu$a such that, for any…

The rate of convergence of the distribution of the length of the longest increasing subsequence, toward the maximal eigenvalue of certain matrix ensembles, is investigated. For finite-alphabet uniform and nonuniform i.i.d. sources, a rate…

The occurrence of first significant digits of numbers in large data is often governed by a logarithmically decreasing distribution called Benford's law (BL), reported first by S. Newcomb (SN) and many decades later independently by F.…

Given a recurrent sequence ${\bf U}:=\{U_n\}_{n\ge 0}$ we consider the problem of counting ${\mathcal M}_U(x)$, the number of integers $n\le x$ such that $U_n=u^2+nv^2$ for some integers $u,v$. We will show that ${\mathcal M}_U(x)\ll x(\log…

The sequence $3, 5, 9, 11, 15, 19, 21, 25, 29, 35,\dots$ consists of odd legs in right triangles with integer side lengths and prime hypotenuse. We show that the upper density of this sequence is zero, with logarithmic decay. The same…

A set of m terminals, observing correlated signals, communicate interactively to generate common randomness for a given subset of them. Knowing only the communication, how many direct queries of the value of the common randomness will…