Related papers: A Note on the Gaussian Minimum Conjecture

Let $\sigma_n(\cdot)$ denote the least singular value of a $n \times n$ matrix. It is well-known that $\mathbb{P}[\sigma_n(A) \le \varepsilon] \le \varepsilon n$ if $A$ is drawn from the real Ginibre ensemble of $n \times n$ matrices and…

Consider the Gaussian sequence model under the additional assumption that a fixed fraction of the means is known. We study the problem of variance estimation from a frequentist Bayesian perspective. The maximum likelihood estimator (MLE)…

Let $G$ be a multiplicatively written finite group. We denote by $\mathsf E(G)$ the smallest integer $t$ such that every sequence of $t$ elements in $G$ contains a product-one subsequence of length $|G|$. In 1961, Erd\H{o}s, Ginzburg and…

Let f(n) denote the smallest positive integer such that every set of $f(n)$ points in general position in the Euclidean plane contains a convex n-gon. In a seminal paper published in 1935, Erd\H{o}s and Szekeres proved that f(n) exists and…

What is the smallest number of random transpositions (meaning that we swap given pairs of elements with given probabilities) that we can make on an $n$-point set to ensure that each element is uniformly distributed -- in the sense that the…

Let $d(G)$ be the smallest cardinality of a generating set of a finite group $G.$ We give a complete classification of the finite groups with the property that, whenever $ \langle x_1, \dots, x_{d(G)} \rangle = \langle y_1, \dots, y_{d(G)}…

In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…

In our previous work, we introduced the Generalised Nonvanishing Conjecture, which generalises several central conjectures in algebraic geometry. In this paper, we derive some surprising nonvanishing results for pluricanonical bundles which…

Let $n$ be a positive integer, let $\boldsymbol{X}=(X_1,\dots,X_n)$ be a random vector in $\mathbb{R}^n$ with bounded entries, and let $(\theta_1,\dots,\theta_n)$ be a vector in $\mathbb{R}^n$. We show that the subgaussian behavior of the…

Let $S_n^{(2)}$ denote the iterated partial sums. That is, $S_n^{(2)}=S_1+S_2+ ... +S_n$, where $S_i=X_1+X_2+ ... s+X_i$. Assuming $X_1, X_2,....,X_n$ are integrable, zero-mean, i.i.d. random variables, we show that the persistence…

A longstanding conjecture of Seymour states that in every oriented graph there is a vertex whose second outneighbourhood is at least as large as its outneighbourhood. In this short note we show that, for any fixed $p\in[0,1/2)$, a.a.s.…

Let $\mu_1 \ge \dotsc \ge \mu_n > 0$ and $\mu_1 + \dotsm + \mu_n = 1$. Let $X_1, \dotsc, X_n$ be independent non-negative random variables with $EX_1 = \dotsc = EX_n = 1$, and let $Z = \sum_{i=1}^n \mu_i X_i$. Let $M = \max_{1 \le i \le n}…

We show that for a sequence of random graphs Brouwer's conjecture holds true with probability tending to one as the number of vertices tends to infinity. Surprisingly, it was found that a similar statement holds true for weighted graphs…

A well-known discovery of Feige's is the following: Let $X_1, \ldots, X_n$ be nonnegative independent random variables, with $\mathbb{E}[X_i] \leq 1 \;\forall i$, and let $X = \sum_{i=1}^n X_i$. Then for any $n$, \[\Pr[X < \mathbb{E}[X] +…

In this paper, we study the smallest gaps for the Gaussian symplectic ensemble (GSE). We prove that the rescaled smallest gaps and their locations converge to a Poisson point process with an explicit rate. The approach provides an…

It is common to model random errors in a classical measurement by the normal (Gaussian) distribution, because of the central limit theorem. In the quantum theory, the analogous hypothesis is that the matrix elements of the error in an…

In this note, we derive concentration inequalities for random vectors with subGaussian norm (a generalization of both subGaussian random vectors and norm bounded random vectors), which are tight up to logarithmic factors.

We report the finding of the new upper bound on the lowest positive integer $x$ for which the Mertens conjecture \begin{equation*} \left| \sum_{1 \leq n \leq x} \mu(n) \right| < \sqrt{x} \end{equation*} fails to hold: $x < \exp(1.017 \times…

We prove the main conjecture of the paper ``On the expected value of the minimum assignment'' by Marshall W. Buck, Clara S. Chan, and David P. Robbins (Random Structures & Algorithms 21 (2002), no. 1, 33--58). This is a vast generalization…

It is well known that, under standard regularity conditions, the maximum likelihood estimator (MLE) satisfies a central limit theorem and converges in distribution to a Gaussian random variable as the sample size grows. This paper…