Related papers: A uniform set with fewer than expected arithmetic …
We prove results about the L^p-almost-periodicity of convolutions. One of these follows from a simple but rather general lemma about approximating a sum of functions in L^p, and gives a very short proof of a theorem of Green that if A and B…
Previous work by Rubinstein and Gao computed the n-level densities for families of quadratic Dirichlet L-functions for test functions where the sum of the supports of the Fourier transforms is at most 2, and showed agreement with random…
We consider the enumeration of pattern-avoiding involutions, focusing in particular on sets defined by avoiding a single pattern of length 4. As we demonstrate, the numerical data for these problems demonstrates some surprising behavior.…
We evaluate the probabilities of various events under the uniform distribution on the set of 312-avoiding permutations of 1,...,N. We derive exact formulas for the probability that the ith element of a random permutation is a specific value…
Our main result states that when A, B, C are subsets of Z/NZ of respective densities \alpha,\beta,\gamma, the sumset A + B + C contains an arithmetic progression of length at least e^{c(\log N)^c} for densities \alpha > (\log N)^{-2 +…
Let f:=(f^1,\...,f^n) be a sparse random polynomial system. This means that each f^i has fixed support (list of possibly non-zero coefficients) and each coefficient has a Gaussian probability distribution of arbitrary variance. We express…
The notion of probability density for a random function is not as straightforward as in finite-dimensional cases. While a probability density function generally does not exist for functional data, we show that it is possible to develop the…
Consider a group G such that there is no homomorphism f:G to {+1,-1}. In that case, how close can we come to such a homomorphism? We show that if f has zero expectation, then the probability that f(xy) = f(x) f(y), where x, y are chosen…
We derive exact statistical properties of a class of recursive fragmentation processes. We show that introducing a fragmentation probability 0<p<1 leads to a purely algebraic size distribution in one dimension, P(x) ~ x^{-2p}. In d…
Fractional Brownian motion, a stochastic process with long-time correlations between its increments, is a prototypical model for anomalous diffusion. We analyze fractional Brownian motion in the presence of a reflecting wall by means of…
Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\subset{\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever…
An equivalent condition for the product of elements of an independent random sample on a compact algebraic group converging in distribution to some random variable as the sample size increases is obtained. Namely, a limit distribution…
We study $|A + A|$ as a random variable, where $A \subseteq \{0, \dots, N\}$ is a random subset such that each $0 \le n \le N$ is included with probability $0 < p < 1$, and where $A + A$ is the set of sums $a + b$ for $a,b$ in $A$. Lazarev,…
Random non-linear Fourier features have recently shown remarkable performance in a wide-range of regression and classification applications. Motivated by this success, this article focuses on a sparse non-linear Fourier feature (NFF) model.…
We introduce a nonparametric way to estimate the global probability density function for a random persistence diagram. Precisely, a kernel density function centered at a given persistence diagram and a given bandwidth is constructed. Our…
A set $S$ of permutations is forcing if for any sequence $\{\Pi_i\}_{i \in \mathbb{N}}$ of permutations where the density $d(\pi,\Pi_i)$ converges to $\frac{1}{|\pi|!}$ for every permutation $\pi \in S$, it holds that $\{\Pi_i\}_{i \in…
Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…
It is known that a sequence Pi_i of permutations is quasirandom if and only if the pattern density of every 4-point permutation in Pi_i converges to 1/24. We show that there is a set S of 4-point permutations such that the sum of the…
Given a compact set of real numbers, a random $C^{m + \alpha}$-diffeomorphism is constructed such that the image of any measure concentrated on the set and satisfying a certain condition involving a real number $s$, almost surely has…
We study the growth rate of the inclusion length of an almost periodic function. For a given a. p. function such growth rate depends on the algebraic structure of Fourier exponents, i. e. on how good they can be approximated by rational…