SearcharxivSearch

arXiv subjects

Petr Kucheriaviy

Publications and source records attributed to Petr Kucheriaviy.

4 recordsLinked to original sources

Positivity of partial sums of a random multiplicative function and corresponding problems for the Legendre symbol

Let $f(n)$ be a random completely multiplicative function such that $f(p) = \pm 1$ with probabilities $1/2$ independently at each prime. We study the conditional probability, given that $f(p) = 1$ for all $p < y$, that all partial sums of $f(n)$ up to $x$ are nonnegative. We prove that for $y \ge C \frac{(\log x)^2 \log_2 x}{\log_3 x}$ this probability equals $1 - o(1)$. We also study the probability $P_x'$ that $\sum_{n \le x} \frac{f(n)}{n}$ is negative. We prove that $P_x' \ll \exp \left( - \exp \left( \frac{\log x \log_4 x}{(1 + o(1)) \log_3 x} \right) \right)$, which improves a bound given by Kerr and Klurman. Under a conjecture closely related to Halász's theorem, we prove that $P_x' \ll \exp(-x^α)$ for some $α> 0$. Let $χ_p(n) = \left( \frac{n}{p} \right)$ be the Legendre symbol modulo $p$. For a prime $p$ chosen uniformly at random from $(x, 2x]$, we express the probability that all partial sums of $\frac{χ_p(n)}{n}$ are nonnegative in terms of the probability that partial sums of $\frac{f(n)}{n}$ are nonnegative.

math.NT

An analogue of Rogers' theorem on sieving in commutative rings

We prove that an analogue of Rogers' theorem on sieving holds for an order if and only if the order is a Dedekind domain. We also prove that it holds for a finite commutative ring if and only if the ring is a direct product of local rings with linearly ordered ideals.

math.AC

Erdős inequality for primitive sets

A set of natural numbers $A$ is called primitive if no element of $A$ divides any other. Let $Ω(n)$ be the number of prime divisors of $n$ counted with multiplicity. Let $f_z(A) = \sum_{a \in A}\frac{z^{Ω(a)}}{a (\log a)^z}$, where $z \in \mathbb{R}_{> 0}$. Erdős proved in 1935 that $f_1(A) = \sum_{a \in A}\frac{1}{a \log a}$ is uniformly bounded over all choices of primitive sets $A$. We prove the same fact for $f_z(A)$, when $z \in (0, 2)$. Also we discuss the $\lim_{z \to 0} f_z(A)$. Some other results about primitive sets are generalized. In particular we study the asymptotic of $f_z(\mathbb{P}_k)$, where $\mathbb{P}_k = \{ n : Ω(n) = k \}$. In case of $z = 1$ we find the next term in asymptotic expansion of $f_1(\mathbb{P}_k)$ compared to the recent result of Gorodetsky, Lichtman, Wong.

math.NT

On numbers not representable as $n + w(n)$

Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not representable as $n + w(n)$.

math.NT