Related papers: Some Connections Between Discrepancy, Finite Gap P…
We study the $L_p$-discrepancy of random point sets in high dimensions, with emphasis on small values of $p$. Although the classical $L_p$-discrepancy suffers from the curse of dimensionality for all $p \in (1,\infty)$, the gap between…
Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…
We define Poisson genericity for infinite sequences in any finite or countable alphabet with an invariant exponentially-mixing probability measure. A sequence is Poisson generic if the number of occurrences of blocks of symbols…
We enumerate arrangements of $n$ couples, i.e. pairs of people, placed in a single-file queue, and consider four statistics from the vantage point of a distinguished given couple. In how many arrangements are exactly $p$ of the $n-1$ other…
In this note, we extend the notion of minimal gaps to the higher dimensional sequences. We bound the minimal gap for $(\{\boldsymbol{a}_n\boldsymbol{\alpha}\}),$ $(\{a_n\boldsymbol{\alpha}\})$ and…
This article is devoted to the study of Jack connection coefficients, a generalization of the connection coefficients of the classical commutative subalgebras of the group algebra of the symmetric group closely related to the theory of Jack…
Assume that $m,s\in\mathbb N$, $m>1$, while $f$ is a polynomial with integer coefficients, $\text{deg}~f>1$, $f^{(i)}$ is the $i$th iteration of the polynomial $f$, $\kappa_n$ has a discrete uniform distribution on the set $\{0,1,\ldots,m^n…
Let $(a_n)_{n \geq 1}$ be a sequence of distinct positive integers. The metric theory of minimal gaps for the sequence $\{\alpha a_n \text{ mod }1, 1\leq n \leq N\}$ as $N \to \infty$ was initiated by Rudnick, who established that the…
We study the asymptotic consistency properties of $\alpha$-R\'enyi approximate posteriors, a class of variational Bayesian methods that approximate an intractable Bayesian posterior with a member of a tractable family of distributions, the…
Given a sequence of complex square matrices, $a_n$, consider the sequence of their partial products, defined by $p_n=p_{n-1}a_{n}$. What can be said about the asymptotics as $n\to\infty$ of the sequence $f(p_n)$, where $f$ is a continuous…
In this paper, we suggest a lower and an upper bound for the Generalized Fibonacci-p-Sequence, for different values of p. The Fibonacci-p-Sequence is a generalization of the Classical Fibonacci Sequence. We first show that the ratio of two…
We study the minimal gap statistic for fractional parts of sequences of the form $\mathcal A^\alpha = \{\alpha a(n)\}$ where $\mathcal A = \{a(n)\}$ is a sequence of distinct of integers. Assuming that the additive energy of the sequence is…
This paper studies when a sequence of probability measures on a metric space admit subsequential weak limits. A sufficient condition called sequential tightness is formulated, which relaxes some assumptions for asymptotic tightness used in…
Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. The authors of [2] showed that the expected number of distinct consecutive patterns of all lengths $k\in\{1,2,\ldots,n\}$ in $\pi_n$ was $\frac{n^2}{2}(1-o(1))$ as $n\to\infty$,…
A seminal open question of Pisier and Mendel--Naor asks whether every degree-regular graph which satisfies the classical discrete Poincar\'e inequality for scalar functions, also satisfies an analogous inequality for functions taking values…
In dealing with asymptotic approximation of possibly divergent nets of probability distributions, we are led to study uniform structures on the set of distributions. This paper identifies a class of such uniform structures that may be…
The ability to predict an NLP model's accuracy on unseen, potentially out-of-distribution data is a prerequisite for trustworthiness. We present a novel model that establishes upper and lower bounds on the accuracy, without requiring gold…
We consider existence and uniqueness properties of a solution to homogeneous cone complementarity problem (HCCP). Employing the $T$-algebraic characterization of homogeneous cones, we generalize the $P, P_0, R_0$ properties for a nonlinear…
Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio…
We are concerned with the problem of designing large families of subsets over a common labeled ground set that have small pairwise intersections and the property that the maximum discrepancy of the label values within each of the sets is…