English
Related papers

Related papers: Cosine Sign Correlation

200 papers

We prove a generalisation of Vinogradov's theorem by finding for $m\geqslant 3$ and fixed positive integers $c_1, \dots ,c_m, r_1, \dots , r_m$ the asymptotics of the number of sequences $(n_1, \dots ,n_m) \in \mathbf{N}^{m}$ such that…

Number Theory · Mathematics 2022-03-21 Paweł Lewulis

For a sequence of identically distributed negatively associated random variables $\{X_n; n\geq 1\}$ with partial sums $S_n=\sum_{i=1}^nX_i, n\geq 1$, refinements are presented of the classical Baum-Katz and Lai complete convergence…

Probability · Mathematics 2008-02-20 Han-Ying Liang , Deli Li , Andrew Rosalsky

This note proves the following inequality: if $n=3k$ for some positive integer $k$, then for any $n$ positive definite matrices $A_1,A_2,\cdots,A_n$, \begin{equation} \frac{1}{n^3}\Big\|\sum_{j_1,j_2,j_3=1}^{n}A_{j_1}A_{j_2}A_{j_3}\Big\|…

Spectral Theory · Mathematics 2018-11-22 Teng Zhang

It is shown that every measurable partition ${A_1,..., A_k}$ of $\mathbb{R}^3$ satisfies $$\sum_{i=1}^k||\int_{A_i} xe^{-\frac12||x||_2^2}dx||_2^2\le 9\pi^2.\qquad(*)$$ Let ${P_1,P_2,P_3}$ be the partition of $\mathbb{R}^2$ into $120^\circ$…

Computational Complexity · Computer Science 2014-04-08 Steven Heilman , Aukosh Jagannath , Assaf Naor

Consider a simple graph $G=(V,E)$ of maximum degree $\Delta$ and its proper total colouring $c$ with the elements of the set $\{1,2,\ldots,k\}$. The colouring $c$ is said to be \emph{neighbour sum distinguishing} if for every pair of…

Combinatorics · Mathematics 2015-08-06 Jakub Przybyło

Let $M_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are iid Bernoulli random variables (which take value -1 and 1 with probability 1/2). Improving the earlier result by Costello, Tao and Vu, we show that…

Combinatorics · Mathematics 2019-12-19 Hoi H. Nguyen

We consider the problem of describing all non-negative integer solutions to a linear congruence in many variables. This question may be reduced to solving the congruence $x_1 + 2x_2 + 3x_3 + ... + (n-1)x_{n-1} \equiv 0 \pmod n$ where values…

Number Theory · Mathematics 2012-05-16 John C. Harris , David L. wehlau

Simpson's paradox is an obstacle to establishing a probabilistic association between two events $a_1$ and $a_2$, given the third (lurking) random variable $B$. We focus on scenarios when the random variables $A$ (which combines $a_1$,…

Methodology · Statistics 2024-07-23 A. Hovhannisyan , A. E. Allahverdyan

We look at continuum solutions in optimisation problems associated to linear inverse problems $y = Ax$ with non-negativity constraint $x \geq 0$. We focus on the case where the noise model leads to maximum likelihood estimation through…

Optimization and Control · Mathematics 2023-04-20 Camille Pouchol , Olivier Verdier

Fix a graph $H$ and some $p\in (0,1)$, and let $X_H$ be the number of copies of $H$ in a random graph $G(n,p)$. Random variables of this form have been intensively studied since the foundational work of Erd\H{o}s and R\'{e}nyi. There has…

Combinatorics · Mathematics 2020-11-19 Jacob Fox , Matthew Kwan , Lisa Sauermann

The classical Erd\H{o}s-Littlewood-Offord theorem says that for nonzero vectors $a_1,\dots,a_n\in \mathbb{R}^d$, any $x\in \mathbb{R}^d$, and uniformly random $(\xi_1,\dots,\xi_n)\in\{-1,1\}^n$, we have…

Combinatorics · Mathematics 2022-06-16 Jacob Fox , Matthew Kwan , Hunter Spink

Professor Georges Rhin considers a nonzero algebraic integer $\a$ with conjugates $\a_1=\a, \ldots, \a_d$ and asks what can be said about $\d \sum_{ | \a_i | >1} | \a_i |$, that we denote ${\rm{R}}(\a)$. If $\a$ is supposed to be a totally…

Number Theory · Mathematics 2024-01-24 V. Flammang

For a fixed unit vector a=(a_1,a_2,...,a_n) in S^{n-1}, i.e. sum_{i=1}^n a_i^2=1, we consider the 2^n sign vectors epsilon=(epsilon_1,epsilon_2,...,epsilon_n) in {-1,1}^n and the corresponding scalar products a.epsilon=sum_{i=1}^n a_i…

Probability · Mathematics 2012-10-04 Harrie Hendriks , Martien C. A. van Zuijlen

Let $G_n$ be an $n \times n$ matrix with real i.i.d. $N(0,1/n)$ entries, let $A$ be a real $n \times n$ matrix with $\Vert A \Vert \le 1$, and let $\gamma \in (0,1)$. We show that with probability $0.99$, $A + \gamma G_n$ has all of its…

Probability · Mathematics 2020-05-19 Jess Banks , Jorge Garza Vargas , Archit Kulkarni , Nikhil Srivastava

Let $A$ be drawn uniformly at random from the set of all $n\times n$ symmetric matrices with entries in $\{-1,1\}$. We show that \[ \mathbb{P}( \det(A) = 0 ) \leq e^{-cn},\] where $c>0$ is an absolute constant, thereby resolving a…

Probability · Mathematics 2021-06-09 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

Let $\xi_1, \xi_2, \dots$ be i.i.d. non-negative random variables whose tail varies regularly with index $-1$, let $S_n$ be the sum and $M_n$ the largest of the first $n$ values. We clarify for which sequences $x_n\to\infty$ we have…

Probability · Mathematics 2021-05-11 Matthias Birkner , Linglong Yuan

Let $Q_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are i.i.d. Bernoulli random variables (which take values 0 and 1 with probability 1/2). We prove that $Q_n$ is non-singular with probability…

Probability · Mathematics 2007-05-23 Kevin Costello , Terence Tao , Van Vu

Three conjectures #1999--8, #1999--9 and #1999--10 which were posed by V. Arnold [2] and devoted to the statistics of the numerical semigroups are refuted for the case of semigroups generated by three positive integers d_1,d_2,d_3 with…

Number Theory · Mathematics 2007-05-23 Leonid G. Fel

In a celebrated work by Hoeffding [J. Amer. Statist. Assoc. 58 (1963) 13-30], several inequalities for tail probabilities of sums M_n=X_1+... +X_n of bounded independent random variables X_j were proved. These inequalities had a…

Probability · Mathematics 2007-05-23 Vidmantas Bentkus

This paper considers a variation of the full-information secretary problem where the random variables to be observed are independent but not necessary identically distributed. The main result is a sharp lower bound for the optimal win…

Probability · Mathematics 2018-12-12 Pieter C. Allaart , Jose A. Islas