Related papers: On the behavior of binary block-counting functions…
Let $F$ be an entire function of exponential type represented by the Taylor series \[ F(z) = \sum_{n\ge 0} \omega_n \frac{z^n}{n!} \] with unimodular coefficients $|\omega_n|=1$. We show that either the counting function $n_F(r)$ of zeroes…
Benford's Law predicts that the first significant digit on the leftmost side of numbers in real-life data is proportioned between all possible 1 to 9 digits approximately as in LOG(1 + 1/digit), so that low digits occur much more frequently…
We consider the problem of constructing binary codes for correcting deletions that are localized within certain parts of the codeword that are unknown a priori. The model that we study is when $\delta \leq w$ deletions are localized in a…
We study probability measures defined by the variation of the sum of digits in the Zeckendorf representation. For $r\ge 0$ and $d\in\mathbb{Z}$, we consider $\mu^{(r)}(d)$ the density of integers $n\in\mathbb{N}$ for which the sum of digits…
A real number is called simply normal to base $b$ if its base-$b$ expansion has each digit appearing with average frequency tending to $1/b$. In this article, we discover a relation between the frequency that the digit $1$ appears in the…
We revisit a double-scaled limit of the superconformal index of ${\cal N}=2$ superconformal field theories (SCFTs) which generalizes the Schur index. The resulting partition function, $\hat {\cal Z}(q,\alpha)$, has a standard $q$-expansion…
Let $S \subseteq \mathbb{N}$ have the property that for each $k \in S$ the set $(S - k) \cap \mathbb{N} \setminus S$ has asymptotic density $0$. We prove that there exists a basic sequence $Q$ where the set of numbers $Q$-normal of all…
In recent literature concerning integer partitions one can find many results related to both the Bessenrodt-Ono type inequalities and log-concavity property. In this note we offer some general approach to this type of problems. More…
This paper highlights an unexpected connection between expansions of real numbers to noninteger bases (so-called {\em $\beta$-expansions}) and the infinite derivatives of a class of self-affine functions. Precisely, we extend Okamoto's…
We investigate the relation between the block sensitivity $\text{bs}(f)$ and fractional block sensitivity $\text{fbs}(f)$ complexity measures of Boolean functions. While it is known that $\text{fbs}(f) = O(\text{bs}(f)^2)$, the best known…
An $(r, s)$-formation is a concatenation of $s$ permutations of $r$ letters. If $u$ is a sequence with $r$ distinct letters, then let $\mathit{Ex}(u, n)$ be the maximum length of any $r$-sparse sequence with $n$ distinct letters which has…
Let $s_q(n)$ denote the sum of the digits in the $q$-ary expansion of an integer $n$. In 2005, Melfi examined the structure of $n$ such that $s_2(n) = s_2(n^2)$. We extend this study to the more general case of generic $q$ and polynomials…
The occurrence of the nonzero leftmost digit, i.e., 1, 2, ..., 9, of numbers from many real world sources is not uniformly distributed as one might naively expect, but instead, the nature favors smaller ones according to a logarithmic…
Stellar systems composed of single, double, triple or high-order systems are rightfully regarded as the fundamental building blocks of the Milky Way. Binary stars play an important role in formation and evolution of the Galaxy. Through…
In this article, we obtain explicit bounds on the uniform distance between the cumulative distribution function of a standardized sum $S_n$ of $n$ independent centered random variables with moments of order four and its first-order…
Let $N_1(m)=\max\{n \colon \phi(n) \leq m\}$ and $N_1 = \{N_1(m) \colon m \in \phi(\mathbb{N})\}$ where $\phi(n)$ denotes the Euler's totient function. Masser and Shiu \cite{masser} call the elements of $N_1$ as `sparsely totient numbers'…
We describe a curious dynamical system that results in sequences of real numbers in $[0,1]$ with seemingly remarkable properties. Let the function $f:\mathbb{T} \rightarrow \mathbb{R}$ satisfy $\hat{f}(k) \geq c|k|^{-2}$ and define a…
Traditionally, ensembles of Slepian-Wolf (SW) codes are defined such that every bin of each $n$-vector of each source is randomly drawn under the uniform distribution across the sets $\{0,1,\ldots,2^{nR_X}-1\}$ and…
We obtain a nontrivial upper bound for almost all elements of the sequences of real numbers which are multiplicative and at the prime indices are distributed according to the Sato--Tate density. Examples of such sequences come from…
The Bessel-Neumann expansion (of integer order) of a function $g:\mathbb{C}\rightarrow\mathbb{C}$ corresponds to representing $g$ as a linear combination of basis functions $\phi_0,\phi_1,\ldots$, i.e., $g(z)=\sum_{\ell = 0}^\infty w_\ell…