English
Related papers

Related papers: The uniform distribution of sequences generated by…

200 papers

For a wide class of sequences of integer domains $\mathcal{D}_n\subset\mathbb{N}^d$, $n\in\mathbb{N}$, we prove distributional limit theorems for $F(X_1^{(n)},\ldots,X_d^{(n)})$, where $F$ is a multivariate multiplicative function and…

Probability · Mathematics 2023-02-01 Zakhar Kabluchko , Oleksandr Marynych , Kilian Raschel

We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials over a sufficiently large finite field, produces a common…

Data Structures and Algorithms · Computer Science 2009-02-10 Mahdi Cheraghchi , Amin Shokrollahi

Let $f_n$ be a random polynomial of degree $n$, whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let $\Delta(f_n)$ denote the discriminant of $f_n$, that is $\Delta(f_n) =…

Probability · Mathematics 2025-06-17 Marcus Michelen , Oren Yakir

The random matrix uniformly distributed over the set of all m-by-n matrices over a finite field plays an important role in many branches of information theory. In this paper a generalization of this random matrix, called k-good random…

Information Theory · Computer Science 2012-05-03 Shengtian Yang , Thomas Honold

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…

Number Theory · Mathematics 2022-07-05 Kevin Ford , Guoyou Qian

Zeros of many ensembles of polynomials with random coefficients are asymptotically equidistributed near the unit circumference. We give quantitative estimates for such equidistribution in terms of the expected discrepancy and expected…

Probability · Mathematics 2014-07-28 Igor E. Pritsker , Aaron M. Yeager

A set ${\cal A} \subseteq \Set{1,...,N}$ is of type $B_2$ if all sums $a+b$, with $a\ge b$, $a,b\in {\cal A}$, are distinct. It is well known that the largest such set is of size asymptotic to $N^{1/2}$. For a $B_2$ set ${\cal A}$ of this…

Number Theory · Mathematics 2007-05-23 Mihail N. Kolountzakis

Fix $\alpha>0$, then by Fej\'er's theorem $ (\alpha(\log n)^{A}\,\mathrm{mod}\,1)_{n\geq1}$ is uniformly distributed if and only if $A>1$. We sharpen this by showing that all correlation functions, and hence the gap distribution, are…

Number Theory · Mathematics 2025-03-26 Christopher Lutsko , Niclas Technau

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

Machine Learning · Computer Science 2008-06-26 Marcus Hutter

In this note we give various characterizations of random walks with possibly different steps that have relatively large discrepancy from the uniform distribution modulo a prime p, and use these results to study the distribution of the rank…

Combinatorics · Mathematics 2020-12-09 Kyle Luh , Sean Meehan , Hoi H. Nguyen

We establish a coboundary condition for a sequence of ergodic sums (i.e.~Birkhoff partial sums) to be almost surely uniformly distributed mod $1$. Applications are given when the sequence is generated by a Gibbs-Markov map. In particular,…

Dynamical Systems · Mathematics 2025-03-03 Albert M. Fisher , Xuan Zhang

This is a review of several results related to distribution of powers and combination of powers modulo 1. We include a proof that given a sequence of real numbers $\theta_n$, it is possible to get an $\alpha$ (given $\lambda \ne 0$), or a…

Number Theory · Mathematics 2013-12-23 Miguel A. Lerma

We use the moment method of Wood to study the distribution of random finite modules over a countable Dedekind domain with finite quotients, generated by taking cokernels of random $n\times n$ matrices with entries valued in the domain.…

Number Theory · Mathematics 2023-06-13 Eric Yan

In this paper, we study the distribution of the minimal distance (in the Hamming metric) of a random linear code of dimension $k$ in $\mathbb{F}_q^n$. We provide quantitative estimates showing that the distribution function of the minimal…

Information Theory · Computer Science 2020-07-15 Jing Hao , Han Huang , Galyna Livshyts , Konstantin Tikhomirov

Consider the product of $m$ independent $n\times n$ random matrices from the spherical ensemble for $m\ge 1$. The empirical distribution based on the $n$ eigenvalues of the product is called the empirical spectral distribution. Two recent…

Statistics Theory · Mathematics 2017-04-06 Shuhua Chang , Yongcheng Qi

Consider a random matrix $\mathbf{A}\in\mathbb{C}^{m\times n}$ ($m \geq n$) containing independent complex Gaussian entries with zero mean and unit variance, and let $0<\lambda_1\leq \lambda_{2}\leq ...\leq \lambda_n<\infty$ denote the…

Statistics Theory · Mathematics 2012-11-06 Prathapasinghe Dharmawansa , Matthew McKay , Yang Chen

The distribution of the sum of independent identically distributed uniform random variables is well-known. However, it is sometimes necessary to analyze data which have been drawn from different uniform distributions. By inverting the…

Statistics Theory · Mathematics 2010-05-25 David M. Bradley , Ramesh C. Gupta

We provide an explicit infinite family of integers $m$ such that all the polynomials of ${\mathbb F}_{2^n}[x]$ of degree $m$ have maximal differential uniformity for $n$ large enough. We also prove a conjecture of the third author in these…

Number Theory · Mathematics 2018-07-12 Yves Aubry , Fabien Herbaut , Jose Felipe Voloch

For each $\alpha \in (0, 1)$, we construct a bounded monotone deterministic sequence $(c_k)_{k \geq 0}$ of real numbers so that the number of real roots of the random polynomial $f_n(z) = \sum_{k=0}^n c_k \varepsilon_k z^k$ is $n^{\alpha +…

Probability · Mathematics 2024-04-08 Marcus Michelen , Sean O'Rourke

Let $X_1,\dots, X_n$ be independent integers distributed uniformly on $\{1,\dots, M\}$, $M=M(n)\to\infty$ however slow. A partition $S$ of $[n]$ into $\nu$ non-empty subsets $S_1,\dots, S_{\nu}$ is called perfect, if all $\nu$ values…

Combinatorics · Mathematics 2022-10-04 Boris Pittel
‹ Prev 1 4 5 6 7 8 10 Next ›