Related papers: Computing Absolutely Normal Numbers in Nearly Line…

We describe a dynamic programming algorithm for exact counting and exact uniform sampling of matrices with specified row and column sums. The algorithm runs in polynomial time when the column sums are bounded. Binary or non-negative integer…

In this paper we prove that if $\{\varphi_i(x)=\lambda x+t_i\}$ is an equicontractive iterated function system and $b$ is a positive integer satisfying $\frac{\log b}{\log |\lambda|}\notin\mathbb{Q},$ then almost every $x$ is normal in base…

We propose a family of "exactly solvable" probability distributions to approximate partition functions of two-dimensional statistical mechanics models. While these distributions lie strictly outside the mean-field framework, their free…

Computers calculate transcendental functions by approximating them through the composition of a few limited-precision instructions. For example, an exponential can be calculated with a Taylor series. These approximation methods were…

Recently, designs of pseudorandom number generators (PRNGs) using integer-valued variants of logistic maps and their applications to some cryptographic schemes have been studied, due mostly to their ease of implementation and performance.…

We show that every sufficiently large integer is a sum of a prime and two almost prime squares, and also a sum of a smooth number and two almost prime squares. The number of such representations is of the expected order of magnitude. We…

The problem of binary hypothesis testing between two probability measures is considered. New sharp bounds are derived for the best achievable error probability of such tests based on independent and identically distributed observations.…

We provide an upper bound on the uniform exponent of approximation to a triple (xi, xi^2, xi^3) by rational numbers with the same denominator, valid for any transcendental real number xi. This upper bound refines a previous result of…

Zaremba's conjecture concerns a formation of continued fraction expansions for rational numbers with partial quotient bounded by an absolute constant. We present asymptotic estimates for the size of $\epsilon$-thickening of certain fractal…

We study the asymptotic number of certain monotonically labeled increasing trees arising from a generalized evolution process. The main difference between the presented model and the classical model of binary increasing trees is that the…

Understanding the distribution of digits in the expansions of perfect powers in different bases is difficult. Rather than consider the asymptotic digit distributions, we consider the base-10 digits of a restricted sequence of powers of two.…

An overlap-free (or $\beta$-free) word $w$ over a fixed alphabet $\Sigma$ is extremal if every word obtained from $w$ by inserting a single letter from $\Sigma$ at any position contains an overlap (or a factor of exponent at least $\beta$,…

Assume that $X$ is a connected $(q+1)$-regular undirected graph of finite order $n$. Let $A$ denote the adjacency matrix of $X$. Let $\lambda_1=q+1>\lambda_2\geq \lambda_3\geq \ldots \geq \lambda_n$ denote the eigenvalues of $A$. The…

A subset A of {0,1,...,n} is said to be a 2-additive basis for {1,2,...,n} if each j in {1,2,...,n} can be written as j=x+y, x,y in A, x<=y. If we pick each integer in {0,1,...,n} independently with probability p=p_n tending to 0, thus…

We show that every $N \geq 2$ can be written as the sum of positive integers $a$ and $b$ where $\Omega(ab) \leq 40$. The result is obtained through the direct application of an explicit lower bound Selberg sieve along with some computation…

We use entropy rates and Schur concavity to prove that, for every integer k >= 2, every nonzero rational number q, and every real number alpha, the base-k expansions of alpha, q+alpha, and q*alpha all have the same finite-state dimension…

We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…

We study the exact counting problem for all lattice rectangles contained in the square $[0,n)\times[0,n)$, including non-axis-parallel ones. Starting from the standard parametrization by a primitive direction $(u,v)$ and two side lengths,…

This paper proposes new factorizations for computing the Neumann series. The factorizations are based on fast algorithms for small prime sizes series and the splitting of large sizes into several smaller ones. We propose a different basis…

Mordechay Levin has constructed a number $\alpha$ which is normal in base 2, and such that the sequence $\left\{2^n \alpha\right\}_{n=0,1,2,\ldots}$ has very small discrepancy $D_N$. Indeed we have $N\cdot D_N = \mathcal{O} \left(\left(\log…