Related papers: A Lower Bound for Grothendieck's Constant

We study the weak $K_s$-saturation number of the Erd\H{o}s--R\'{e}nyi random graph $\mathbbmsl{G}(n, p)$, denoted by $\mathrm{wsat}(\mathbbmsl{G}(n, p), K_s)$, where $K_s$ is the complete graph on $s$ vertices. Kor\'{a}ndi and Sudakov in…

We present three different upper bounds for Kronecker coefficients $g(\lambda,\mu,\nu)$ in terms of Kostka numbers, contingency tables and Littlewood--Richardson coefficients. We then give various examples, asymptotic applications, and…

We update our previous determination of both the decay constant and the mass of the $D_s$ meson using the Highly Improved Staggered Quark formalism. We include additional results at two finer values of the lattice spacing along with…

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

In 1995, Brouwer proved that the toughness of a connected $k$-regular graph $G$ is at least $k/\lambda-2$, where $\lambda$ is the maximum absolute value of the non-trivial eigenvalues of $G$. Brouwer conjectured that one can improve this…

Let K be a non-archimedean field, and let f in K(z) be a rational function of degree d>1. If f has potentially good reduction, we give an upper bound, depending only on d, for the minimal degree of an extension L/K such that f is conjugate…

We present several upper and lower bounds on the Kronecker coefficients of the symmetric group. We prove $k$-stability of the Kronecker coefficients generalizing the (usual) stability, and giving a new upper bound. We prove a lower bound…

We study sufficient conditions for the generic rigidity of a graph $G$ expressed in terms of (i) its minimum degree $\delta(G)$, or (ii) the parameter $\eta(G)=\min_{uv\notin E}(\deg(u)+\deg(v))$. For each case, we seek the smallest…

The conjecture due to Bertrand and Rodriguez Villegas asserts that the 1-norm of the nonzero element in an exterior power of the units of a number field has a certain lower bound. For the exterior square case of totally real quartic…

Haagerup's proof of the non commutative little Grothendieck inequality raises some questions on the commutative little inequality, and it offers a new result on scalar matrices with non negative entries. The theory of completely bounded…

Let $\Delta_s=R(K_3,K_s)-R(K_3,K_{s-1})$, where $R(G,H)$ is the Ramsey number of graphs $G$ and $H$ defined as the smallest $n$ such that any edge coloring of $K_n$ with two colors contains $G$ in the first color or $H$ in the second color.…

A graph is called $K$-almost regular if its maximum degree is at most $K$ times the minimum degree. Erd\H{o}s and Simonovits showed that for a constant $0< \varepsilon< 1$ and a sufficiently large integer $n$, any $n$-vertex graph with more…

The Grassmann convexity conjecture gives a conjectural formula for the maximal total number of real zeros of the consecutive Wronskians of an arbitrary fundamental solution to a disconjugate linear ordinary differential equation with real…

We give an improved lower bound for the average of the Erd\H{o}s-Hooley function $\Delta(n)$, namely $\sum_{n\le x} \Delta(n) \gg_\varepsilon x(\log\log x)^{1+\eta-\varepsilon}$ for all $x\geqslant100$ and any fixed $\varepsilon$, where…

Stochastic Gradient Descent (SGD) plays a central role in modern machine learning. While there is extensive work on providing error upper bound for SGD, not much is known about SGD error lower bound. In this paper, we study the convergence…

For the scalar field $\mathbb{K}=\mathbb{R}$ or $\mathbb{C}$, the multilinear Bohnenblust--Hille inequality asserts that there exists a sequence of positive scalars $(C_{\mathbb{K},m})_{m=1}^{\infty}$ such that…

We study the local well-posedness in the Sobolev space H^s for the modified Korteweg-de Vries (mKdV) equation on the real line. Kenig-Ponce-Vega \cite{KPV2} and Christ-Colliander-Tao established that the data-to-solution map fails to be…

We investigate a very recent concept for visualizing various aspects of a graph in the plane using a collection of drawings introduced by Hlin\v{e}n\'y and Masa\v{r}\'ik [GD 2023]. Formally, given a graph $G$, we aim to find an uncrossed…

In "All p-adic reductive groups are tame" Bernstein proved that for a reductive group G over a local non-archimedean field F and a compact open subgroup K of G there exists a uniform bound N(G,K) such that for every irreducible, smooth, and…

The {\em square} of a graph $G$, denoted $G^2$, has the same vertex set as $G$ and has an edge between two vertices if the distance between them in $G$ is at most $2$. In general, $\Delta(G) + 1 \leq \chi(G^2) \leq \Delta(G)^2 +1$ for every…