相关论文: The average amount of information lost in multipli…

We determine the order of magnitude of H(x,y,z), the number of integers n\le x having a divisor in (y,z], for all x,y and z. We also study H_r(x,y,z), the number of integers n\le x having exactly r divisors in (y,z]. When r=1 we establish…

Let $a>1$ be an integer. Denote by $l_a(p)$ the multiplicative order of $a$ modulo primes $p$. We prove that if $\frac{x}{\log x\log\log x}=o(y)$, then $$\frac 1 y \sum_{a\leq y}\sum_{p\leq x}\frac{1}{l_a(p)}=\log x + C\log\log…

We give a relatively short proof of one of the central cases of the main theorem from the paper "The distribution of integers with a divisor in a given interval", math.NT/0401223. Namely, we determine the order of magnitude of the number of…

Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…

We study an information analogue of infinitely divisible probability distributions, where the i.i.d. sum is replaced by the joint distribution of an i.i.d. sequence. A random variable $X$ is called informationally infinitely divisible if,…

Let $F(x)$ be an irreducible polynomial with integer coefficients and degree at least 2. For $x\ge z\ge y\ge 2$, denote by $H_F(x, y, z)$ the number of integers $n\le x$ such that $F(n)$ has at least one divisor $d$ with $y<d\le z$. We…

Two problems are studied in this paper. (1) How much external or internal information cost is required to compute a Boolean-valued function with an error at most $1/2-\epsilon$ for a small $\epsilon$? It is shown that information cost of…

Let $a>1$ be an integer. Denote by $l_a(n)$ the multiplicative order of $a$ modulo integer $n\geq 1$. We prove that there is a positive constant $\delta$ such that if $x^{1-\delta}\log^3 x = o(y)$, then $$ \frac1y \sum_{a<y} \frac1x…

Let $F$ and $G$ be linear recurrences over a number field $\mathbb{K}$, and let $\mathfrak{R}$ be a finitely generated subring of $\mathbb{K}$. Furthermore, let $\mathcal{N}$ be the set of positive integers $n$ such that $G(n) \neq 0$ and…

Consider a random sample $X_1 , X_2 , ..., X_n$ drawn independently and identically distributed from some known sampling distribution $P_X$. Let $X_{(1)} \le X_{(2)} \le ... \le X_{(n)}$ represent the order statistics of the sample. The…

Let $G$ be the special linear group $\mathrm{SL}(2,q)$. We show that if $(a_1,\ldots,a_t)$ and $(b_1,\ldots,b_t)$ are sampled uniformly from large subsets $A$ and $B$ of $G^t$ then their interleaved product $a_1 b_1 a_2 b_2 \cdots a_t b_t$…

We prove the following results: let x,y be (n,n) complex matrices such that x,y,xy have no eigenvalue in ]-infinity,0] and log(xy)=log(x)+log(y). If n=2, or if n>2 and x,y are simultaneously triangularizable, then x,y commute. In both cases…

It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f:A->B, additional structural information about the input x in A (that is any kind of promise that x belongs to a certain subset A'…

Let $X$ and $Y$ be dependent random variables. This paper considers the problem of designing a scalar quantizer for $Y$ to maximize the mutual information between the quantizer's output and $X$, and develops fundamental properties and…

Building upon the work of Chebyshev, Shannon and Kontoyiannis, it may be demonstrated that Chebyshev's asymptotic result: \begin{equation} \ln N \sim \sum_{p \leq N} \frac{1}{p} \cdot \ln p \end{equation} has a natural information-theoretic…

We consider the problem where P is an unknown permutation on {0,1,...,2^n - 1}, y is an element of {0,1,...,2^n - 1}, and the goal is to determine the minimum r > 0 such that P^r(y) = y (where P^r is P composed with itself r times).…

Let \( X \geq y \geq 2 \), and let \( u = \frac{\log X}{\log y} \). We say a number is \textit{$y$-smooth} if all of its prime factors are less than or equal to \( y \). In this paper, we study the distribution of $y$-smooth numbers in…

We show that the inequality $H(A \mid B,X) + H(A \mid B,Y) \le H(A\mid B)$ for jointly distributed random variables $A,B,X,Y$, which does not hold in general case, holds under some natural condition on the support of the probability…

The discrepancy between two independent samples \(X_1,\dots,X_n\) and \(Y_1,\dots,Y_n\) drawn from the same distribution on $\mathbb{R}^d$ typically has order \(O(\sqrt{n})\) even in one dimension. We give a simple online algorithm that…

We show that rational data of bounded input length are uniformly distributed with respect to condition numbers of numerical analysis. We deal both with condition numbers of Linear Algebra and with condition numbers for systems of…