Related papers: A simple proof of the Grunbaum conjecture

An important result in discrepancy due to Banaszczyk states that for any set of $n$ vectors in $\mathbb{R}^m$ of $\ell_2$ norm at most $1$ and any convex body $K$ in $\mathbb{R}^m$ of Gaussian measure at least half, there exists a $\pm 1$…

Let $\mathcal{S}$ denote the class of analytic and univalent ({\it i.e.}, one-to-one) functions $ f(z)= z+\sum_{n=2}^{\infty}a_n z^n$ in the unit disk $\mathbb{D}=\{z\in \mathbb{C}:|z|<1\}$. For $f\in \mathcal{S}$, In 1999, Ma proposed the…

H. Fujimoto showed that for a complete minimal surface in $\mathbb{R}^m$, if the Gauss map is non-degenerate, then it omits at most $\frac{m(m + 1)}{2}$ hyperplanes in the complex projective space $\mathbb{P}^{m - 1}$ in general position,…

Given a centered convex body $K\subseteq\mathbb{R}^n$, we study the optimal value of the constant $\tilde{\Lambda}(K)$ such that there exists an orthonormal basis $\{w_i\}_{i=1}^n$ for which the following reverse dual Loomis-Whitney…

We provide a comprehensive discussion of the Everpresent $\Lambda$ cosmological model arising from fundamental principles in causal set theory and unimodular gravity. In this framework the value of the cosmological constant ($\Lambda$)…

A $d$-dimensional polycube is a facet-connected set of cells (cubes) on the $d$-dimensional cubical lattice $\mathbb{Z}^d$. Let $A_d(n)$ denote the number of $d$-dimensional polycubes (distinct up to translations) with $n$ cubes, and…

In 1998 Kleinbock conjectured that any set of weighted badly approximable $d\times n$ real matrices is a winning subset in the sense of Schmidt's game. In this paper we prove this conjecture in full for vectors in $\mathbf{R}^d$ in…

Consider the normalized adjacency matrices of random $d$-regular graphs on $N$ vertices with fixed degree $d\geq 3$, and denote the eigenvalues as $\lambda_1=d/\sqrt{d-1}\geq \lambda_2\geq\lambda_3\cdots\geq \lambda_N$. We prove that the…

In 1954 Marstrand proved that if K is a subset of R^2 with Hausdorff dimension greater than 1, then its one-dimensional projection has positive Lebesgue measure for almost-all directions. In this article, we give a combinatorial proof of…

Let $v(k, \lambda)$ be the maximum number of vertices of a connected $k$-regular graph with second largest eigenvalue at most $\lambda$. The Alon-Boppana Theorem implies that $v(k, \lambda)$ is finite when $k > \frac{\lambda^2 + 4}{4}$. In…

A well-known conjecture of Erd\H{o}s and S\'os states that every graph with average degree exceeding $m-1$ contains every tree with $m$ edges as a subgraph. We propose a variant of this conjecture, which states that every graph of maximum…

An open problem that is widely regarded as one of the most important in quantum query complexity is to resolve the quantum query complexity of the k-distinctness function on inputs of size N. While the case of k=2 (also called Element…

Gromov conjectured that the total mean curvature of the boundary of a compact Riemannian manifold can be estimated from above by a constant depending only on the boundary metric and on a lower bound for the scalar curvature of the fill-in.…

Frankl and F\"uredi conjectured in 1989 that the maximum Lagrangian of all $r$-uniform hypergraphs of fixed size $m$ is realised by the initial segment of the colexicographic order. In particular, in the principal case $m=\binom{t}{r}$…

Let $(M^{n}, g)$ be a closed connected Einstein space, $n=dim M ,$ and $\kappa_{0} $ be the lower bound of the sectional curvature. In this paper, we prove Udo Simon's conjecture: on closed Einstein spaces, $n\geq 3,$ there is no eigenvalue…

Given $\epsilon \in (0,1)$, a probability measure $\mu$ on $\Omega\subset\mathbb{R}^p$ and a semi-algebraic set $K\subset X\times\Omega$, we consider the feasible set $X^*_\epsilon=\{x\in X:{\rm Prob}[(x,\omega)\in K]\geq 1-\epsilon\}$…

Let $k,d,\lambda\geqslant1$ be integers with $d\geqslant\lambda $. Let $m(k,d,\lambda)$ be the maximum positive integer $n$ such that every set of $n$ points (not necessarily in general position) in $\mathbb{R}^{d}$ has the property that…

Brouwer's Conjecture states that, for any graph $G$, the sum of the $k$ largest (combinatorial) Laplacian eigenvalues of $G$ is at most $|E(G)| + \binom{k+1}{2}$, $1 \leq k \leq n$. We present several interrelated results establishing…

Park and Pham's recent proof of the Kahn-Kalai conjecture was a major breakthrough in the field of graph and hypergraph thresholds. Their result gives an upper bound on the threshold at which a probabilistic construction has a $1-\epsilon$…

For a given $\lambda >0$, a convex body in $\mathbb R^n$ is $\lambda$-convex if it is the intersection of (finitely or infinitely many) balls of radius $1/\lambda$. In this note, we show that among all $\lambda$-convex bodies in $\mathbb…