Related papers: Upper bound for isometric embeddings \ell_2^m\to\e…

We show that, for a separable and complete metric space $M$, the Lipschitz-free space $\mathcal F(M)$ embeds linearly and almost-isometrically into $\ell_1$ if and only if $M$ is a subset of an $\mathbb R$-tree with length measure 0.…

We prove a priori bounds for the trace of the second fundamental form of a $C^4$ isometric embedding into $R^{n+1}$ of a metric $g$ of non-negative sectional curvature on $S^n$, in terms of the scalar curvature, and the diameter of $g$.…

In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular…

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

The fourth listed author and Hans Parshall (\cite{IosevichParshall}) proved that if $E \subset {\mathbb F}_q^d$, $d \ge 2$, and $G$ is a connected graph on $k+1$ vertices such that the largest degree of any vertex is $m$, then if $|E| \ge C…

We prove that, for every integer $n \ge 2$, a finite or infinite countable group $G$ can be embedded into a 2-generated group $H$ in such a way that the solvability of quadratic equations of length at most $n$ is preserved, i.e., every…

Let $Y_{3,2}$ be the $3$-uniform hypergraph with two edges intersecting in two vertices. Our main result is that any $n$-vertex 3-uniform hypergraph with at least $\binom{n}{3} - \binom{n-m+1}{3} + o(n^3)$ edges contains a collection of $m$…

We prove for each integer $\ell\geq 1$ an unconditional upper bound for the size of the $\ell$-torsion subgroup $Cl_K[\ell]$ of the class group of $K$, which holds for all but a zero density set of number fields $K$ of degree $d\in\{4,5\}$…

The following hypothesis was put forward by Goreinov, Tyrtyshnikov and Zamarashkin in \cite{GTZ1997}. For arbitrary real $n \times k$ matrix with orthonormal columns a sufficiently "good" $k \times k$ submatrix exists. "Good" in the sense…

This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…

Let $\mathbb{B}_p^N$ be the $N$-dimensional unit ball corresponding to the $\ell_p$-norm. For each $N\in\mathbb N$ we sample a uniform random subspace $E_N$ of fixed dimension $m\in\mathbb{N}$ and consider the volume of $\mathbb{B}_p^N$…

Let $n=4k+1$ and $k\geq 4$. We show that there exists maximal commutative subalgebras (with respect to inclusion) of dimension less that $3\cdot 2^{n-2}$.

S-embeddings were introduced by Chelkak as a tool to study the conformal invariance of the thermodynamic limit of the Ising model. Moreover, Chelkak, Laslier and Russkikh introduced a lift of s-embeddings to Lorentz space, and showed that…

In this paper, among other results, we improve the best known estimates for the constants of the generalized Bohnenblust-Hille inequality. These enhancements are then used to improve the best known constants of the Hardy--Littlewood…

It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…

We prove a general upper bound on the $k$-th adjacency eigenvalue of a graph. For $k\ge 2$, we show that \[ \lambda_k(G)\le \frac{(k-2)\sqrt{k+1}+2}{2k(k-1)}\,n-1 \] for every graph $G$ on $n$ vertices. We build on a recent approach that…

Given $0<p,q, r<\infty $ and $ q<r\le \infty$ we consider the natural embedding $\ell_{p,q}\hookrightarrow \ell_{p,r}$ between Lorenz sequence spaces. We prove that this non-compact embedding is always strictly singular but not finitely…

For two given nonnegative integers $h$ and $k$, an $L(h,k)$-edge labeling of a graph $G$ is the assignment of labels $\{0,1, \cdots, n\}$ to the edges so that two edges having a common vertex are labeled with difference at least $h$ and two…

The main purpose of the paper is to construct a sequence of graphs of constant degree with indefinitely growing girths admitting embeddings into $\ell_1$ with uniformly bounded distortions. This result answers the problem posed by N.…

This article aims to provide exponential lower bounds on the number of non-isomorphic $k$-gonal biembeddings of the complete multipartite graph into orientable surfaces. For this purpose, we use the concept, introduced by Archdeacon in…