English
Related papers

Related papers: When almost all sets are difference dominated in $…

200 papers

Bifurcations of the $A_{n}$ type in Arnold's classification, in non-autonomous $p$-periodic difference equations generated by parameter depending families with $p$ maps, are studied. It is proved that the conditions of degeneracy,…

Dynamical Systems · Mathematics 2015-03-06 Henrique Manuel Oliveira

Let $\{Z_n\}_{n\geq 0 }$ be a $d$-dimensional supercritical branching random walk started from the origin. Write $Z_n(S)$ for the number of particles located in a set $S\subset\mathbb{R}^d$ at time $n$. Denote by…

Probability · Mathematics 2023-07-19 Shuxiong Zhang

Assume that there is a set of monic polynomials $P_n(z)$ satisfying the second-order difference equation $$ A(s) P_n(z(s+1)) + B(s) P_n(z(s)) + C(s) P_n(z(s-1)) = \lambda_n P_n(z(s)), n=0,1,2,..., N$$ where $z(s), A(s), B(s), C(s)$ are some…

Classical Analysis and ODEs · Mathematics 2007-12-04 Luc Vinet , Alexei Zhedanov

We consider finite Bernoulli convolutions with a parameter $1/2 < r < 1$ supported on a discrete point set, generically of size $2^N$. These sequences are uniformly distributed with respect to the infinite Bernoulli convolution measure…

Number Theory · Mathematics 2011-07-20 Itai Benjamini , Boris Solomyak

Let $\delta > 1/2$. We prove that if $A$ is a subset of the primes such that the relative density of $A$ in every reduced residue class is at least $\delta$, then almost all even integers can be written as the sum of two primes in $A$. The…

Number Theory · Mathematics 2024-09-20 Ali Alsetri , Xuancheng Shao

We extend a classical test of subsphericity, based on the first two moments of the eigenvalues of the sample covariance matrix, to the high-dimensional regime where the signal eigenvalues of the covariance matrix diverge to infinity and…

Statistics Theory · Mathematics 2021-06-30 Joni Virta

Given a sequence $(X_n)$ of symmetrical random variables taking values in a Hilbert space, an interesting open problem is to determine the conditions under which the series $\sum_{n=1}^\infty X_n$ is almost surely convergent. For…

Probability · Mathematics 2020-06-16 Safari Mukeru

Let $X_1,..., X_N\in\R^n$ be independent centered random vectors with log-concave distribution and with the identity as covariance matrix. We show that with overwhelming probability at least $1 - 3 \exp(-c\sqrt{n}\r)$ one has $ \sup_{x\in…

Probability · Mathematics 2012-11-01 Radosław Adamczak , Alexander E. Litvak , Alain Pajor , Nicole Tomczak-Jaegermann

It is a classical fact that every $n$-element set of positive reals has at least $\binom{n+1}{2}+1$ distinct subset sums, with equality exactly for homogeneous arithmetic progressions (when $n\geq 4$). We establish stability versions of…

Combinatorics · Mathematics 2026-05-08 Ruben Carpenter , Colin Defant , Noah Kravitz

We prove that, for almost all $r \leq N^{1/2}/\log^{O(1)}N$, for any given $b_1 \mod r$ with $(b_1, r) = 1$, and for almost all $b_2 \mod r$ with $(b_2, r) = 1$, we have that almost all natural numbers $2n \leq N$ with $2n \equiv b_1 + b_2…

Number Theory · Mathematics 2021-06-03 Juho Salmensuu

It has been reported in the literature that the survival probability $P(t)$ near an exceptional point where two eigenstates coalesce should generally exhibit an evolution $P(t) \sim t^2 e^{-\Gamma t}$, in which $\Gamma$ is the decay rate of…

Quantum Physics · Physics 2017-07-11 Savannah Garmon , Gonzalo Ordonez

We study information aggregation in networks when agents interact to learn a binary state of the world. Initially each agent privately observes an independent signal which is "correct" with probability $\frac{1}{2}+\delta$ for some $\delta…

Computer Science and Game Theory · Computer Science 2025-08-12 Divyarthi Mohan , Pawel Pralat

We show that if $A=\{a_1 < a_2 < \ldots < a_k\}$ is a set of real numbers such that the differences of the consecutive elements are distinct, then for and finite $B \subset \mathbb{R}$, $$|A+B|\gg |A|^{1/2}|B|.$$ The bound is tight up to…

Combinatorics · Mathematics 2019-12-11 Imre Ruzsa , George Shakan , Jozsef Solymosi , Endre Szemerédi

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

Optimization and Control · Mathematics 2019-07-02 Thomas Kerdreux , Igor Colin , Alexandre d'Aspremont

Let $A, B$ be subsets of $(\mathbb{Z}/p^r\mathbb{Z})^2$. In this note, we provide conditions on the densities of $A$ and $B$ such that $|gA-B|\gg p^{2r}$ for a positive proportion of $g\in SO_2(\mathbb{Z}/p^r\mathbb{Z})$. The conditions are…

Number Theory · Mathematics 2025-02-11 Boqing Xue , Thang Pham , Le Q. Hung , Le Q. Ham , Nguyen D. Phuong

We generalise the known fact that for binomial $X_{n,k} \sim \mathrm{Bin}(n, k/n)$ one has $\inf_{k>1,n} \mathrm{P}(X_{n,k} \geq k) \geq \lim_{k \to 1+}\mathrm{P}(X_{2,k} \geq k) = 1/4$ to cover probabilities of exceeding a constant shift…

Probability · Mathematics 2023-08-11 Tilo Wiklund

We prove that if $\Om \subseteq \R^2$ is bounded and $\R^2 \setminus \Om$ satisfies suitable structural assumptions (for example it has a countable number of connected components), then $W^{1,2}(\Om)$ is dense in $W^{1,p}(\Om)$ for every…

Analysis of PDEs · Mathematics 2007-05-23 Alessandro Giacomini , Paola Trebeschi

It is an open problem whether $ \binom{2n}{n} $ is divisible by 4 or 9 for all $n>256$. In connection with this, we prove that for a fixed uneven $m$ the asymptotic density of $k$'s such that $ m \nmid \binom{2^{k+1}}{2^{k}} $ is 0. To do…

Sorting is a fundamental problem in computer science. In the classical setting, it is well-known that $(1\pm o(1)) n\log_2 n$ comparisons are both necessary and sufficient to sort a list of $n$ elements. In this paper, we study the Noisy…

Data Structures and Algorithms · Computer Science 2023-03-16 Yuzhou Gu , Yinzhan Xu

This paper proves a Berry--Esseen theorem for sample quantiles of strongly-mixing random variables under a polynomial mixing rate. The rate of normal approximation is shown to be $O(n^{-1/2})$ as $n\to\infty$, where $n$ denotes the sample…

Probability · Mathematics 2009-03-02 S. N. Lahiri , S. Sun
‹ Prev 1 4 5 6 7 8 10 Next ›