English
Related papers

Related papers: Random multiplicative functions and typical size o…

200 papers

For the space of functions that can be approximated by linear chirps, we prove a reconstruction theorem by random sampling at arbitrary rates.

Probability · Mathematics 2010-08-31 Eric Carlen , R. Vilela Mendes

We cosider the number of r-tuples of squarefree numbers in a short interval. We prove that it cannot be much bigger than the expected value and we also estabish an asymptotic formula if the interval is not very short.

Number Theory · Mathematics 2007-05-23 Doychin Tolev

We provide a sufficient characterization for subsets $\mathcal{A}$ of the polynomial ring $\mathbb{F}_q[t]$ for which partial sums of Steinhaus random multiplicative functions approach a complex standard normal distribution. This extends…

Number Theory · Mathematics 2025-12-09 Declan Hoban , Jibran Iqbal Shah , Nadya-Catherine Ismail , William Verreault , Asif Zaman

Writing for a general mathematical audience, we provide elementary upper and lower bounds on the growth (as a function of N) of the sum \sum_{n=1}^N (-1)^{\floor{n x}} for various fixed x. For example, if x is a quadratic irrational, then…

Number Theory · Mathematics 2007-05-23 Kevin O'Bryant , Bruce Reznick , Monika Serbinowska

We show that the contact process on a random $d$-regular graph initiated by a single infected vertex obeys the "cutoff phenomenon" in its supercritical phase. In particular, we prove that when the infection rate is larger than the critical…

Probability · Mathematics 2015-02-27 Steven Lalley , Wei Su

We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical…

Number Theory · Mathematics 2018-03-26 Ilya D. Shkredov , Igor E. Shparlinski

In this paper, we discuss some numerical realizations of Shannon's sampling theorem. First we show the poor convergence of classical Shannon sampling sums by presenting sharp upper and lower bounds of the norm of the Shannon sampling…

Numerical Analysis · Mathematics 2025-04-17 Melanie Kircheis , Daniel Potts , Manfred Tasche

Sequential estimation of the success probability $p$ in inverse binomial sampling is considered in this paper. For any estimator $\hat p$, its quality is measured by the risk associated with normalized loss functions of linear-linear or…

Statistics Theory · Mathematics 2018-12-18 Luis Mendo

Constructing a Pseudo Random Function (PRF) is a fundamental problem in cryptology. Such a construction, implemented by truncating the last $m$ bits of permutations of $\{0, 1\}^{n}$ was suggested by Hall et al. (1998). They conjectured…

Combinatorics · Mathematics 2021-03-23 Shoni Gilboa , Shay Gueron

We consider moments of higher powers of quadratic Dirichlet character sums. In a restricted region, we give their asymptotic behavior by using de la Bret\`{e}che's multivariable Tauberian theorem. We also give the lower bound of the…

Number Theory · Mathematics 2025-02-28 Yuichiro Toma

Let $ k,l \geq 2$ be natural numbers, and let $d_k,d_l$ denote the $k$-fold and $l$-fold divisor functions, respectively. We analyse the asymptotic behavior of the sum $\sum_{x<n\leq x+H_1}d_k(n)d_l(n+h)$. More precisely, let…

Number Theory · Mathematics 2025-03-06 Javier Pliego , Yu-Chen Sun , Mengdi Wang

We use the replica method of statistical mechanics to examine a typical performance of correctly reconstructing $N$-dimensional sparse vector $bx=(x_i)$ from its linear transformation $by=bF bx$ of $P$ dimensions on the basis of…

Information Theory · Computer Science 2010-06-03 Yoshiyuki Kabashima , Tadashi Wadayama , Toshiyuki Tanaka

We construct sequences $\{a_n\}_{n\in\mathbb{N}}\in\{-1,1\}^{\mathbb{N}}$ with small values of signed harmonic sums \[ \sum_{n\in\mathcal{A}\cap[1,N]}\frac{a_n}{n}, \] for any reasonably dense subsets $\mathcal{A}\subset\mathbb{N}.$ We…

Number Theory · Mathematics 2026-05-07 Oleksiy Klurman , Marc Munsch , Yu-Chen Sun

We introduce the notion of a random matrix-valued multiplicative function, generalizing Rademacher random multiplicative functions to matrices. We provide an asymptotic for the second moment based on a linear recurrence property for…

Number Theory · Mathematics 2018-12-12 Maxim Gerspach

Recently, several bounds have been obtained on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. Here,…

Number Theory · Mathematics 2012-10-25 Jean Bourgain , Moubariz Z. Garaev , Sergei V. Konyagin , Igor E. Shparlinski

In this paper, we study the rate distortion function of the i.i.d sequence of multiplications of a Bernoulli $p$ random variable and a gaussian random variable $\sim N(0,1)$. We use a new technique in the derivation of the lower bound in…

Information Theory · Computer Science 2016-11-15 Cheng Chang

We show that the exponent in the inverse power law of word frequencies for the monkey-at-the-typewriter model of Zipf's law will tend towards -1 under broad conditions as the alphabet size increases to infinity and the letter probabilities…

Probability · Mathematics 2015-12-08 Richard Perline

Random multiplicative processes $w_t =\lambda_1 \lambda_2 ... \lambda_t$ (with < \lambda_j > 0 ) lead, in the presence of a boundary constraint, to a distribution $P(w_t)$ in the form of a power law $w_t^{-(1+\mu)}$. We provide a simple and…

Condensed Matter · Physics 2007-05-23 Rama Cont , Didier Sornette

Suppose a $k$-uniform hypergraph $H$ that satisfies a certain regularity instance (that is, there is a partition of $H$ given by the hypergraph regularity lemma into a bounded number of quasirandom subhypergraphs of prescribed densities).…

Combinatorics · Mathematics 2022-08-15 Felix Joos , Jaehoon Kim , Daniela Kühn , Deryk Osthus

Let $k \in \mathbb{N}$ and suppose we are given $k$ integers $1 \leq a_1, \dots, a_k \leq n$. If $\sqrt{a_1} + \dots + \sqrt{a_k}$ is not an integer, how close can it be to one? When $k=1$, the distance to the nearest integer is $\gtrsim…

Number Theory · Mathematics 2024-03-08 Stefan Steinerberger
‹ Prev 1 8 9 10 Next ›