English
Related papers

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

200 papers

Although the Nash theorem solves the isometric embedding problem, matters are inherently more involved if one is further seeking an embedding that is well-behaved from the standpoint of submanifold geometry. More generally, consider a…

Differential Geometry · Mathematics 2014-10-31 Francisco Fontenele , Frederico Xavier

We continue our study of the Widom factors for $L_p(\mu)$ extremal polynomials initiated in [4]. In this work we characterize sets for which the lower bounds obtained in [4] are saturated, establish continuity of the Widom factors with…

Classical Analysis and ODEs · Mathematics 2020-05-20 Gökalp Alpan , Maxim Zinchenko

Fix $p\in[1,\infty)$, $K\in(0,\infty)$ and a probability measure $\mu$. We prove that for every $n\in\mathbb{N}$, $\varepsilon\in(0,1)$ and $x_1,\ldots,x_n\in L_p(\mu)$ with $\big\| \max_{i\in\{1,\ldots,n\}} |x_i| \big\|_{L_p(\mu)} \leq K$,…

Metric Geometry · Mathematics 2022-03-10 Alexandros Eskenazis

Fix n>2. Let s be a principally embedded sl(2)-subalgebra in sl(n). A special case of results of the second author and Gregg Zuckerman implies that there exists a positive integer b(n) such that for any finite dimensional…

Representation Theory · Mathematics 2016-06-24 Hassan Lhou , Jeb F. Willenbring

In this paper, we give a new upper bound on the minimum Euclidean weight of Type II $\ZZ_{2k}$-codes and the concept of extremality for the Euclidean weights when $k=3,4,5,6$. Together with the known result, we demonstrate that there is an…

Combinatorics · Mathematics 2012-05-28 Masaaki Harada , Tsuyoshi Miezaki

In [13] the authors show that if $\mu$ is a strongly compact cardinal, $K$ is an Abstract Elementary Class (AEC) with $LS(K)<\mu$, and $K$ satisfies joint embedding (amalgamation) cofinally below $\mu$, then $K$ satisfies joint embedding…

Logic · Mathematics 2022-01-06 Will Boney , Ioannis Souldatos

We provide a new upper bound for sampling numbers $(g_n)_{n\in \mathbb{N}}$ associated to the compact embedding of a separable reproducing kernel Hilbert space into the space of square integrable functions. There are universal constants…

Numerical Analysis · Mathematics 2021-02-11 Nicolas Nagel , Martin Schäfer , Tino Ullrich

An $\ell_p$ oblivious subspace embedding is a distribution over $r \times n$ matrices $\Pi$ such that for any fixed $n \times d$ matrix $A$, $$\Pr_{\Pi}[\textrm{for all }x, \ \|Ax\|_p \leq \|\Pi Ax\|_p \leq \kappa \|Ax\|_p] \geq 9/10,$$…

Data Structures and Algorithms · Computer Science 2018-04-10 Ruosong Wang , David P. Woodruff

Let n(2,k) denote the largest integer n for which there exists a set A of k nonnegative integers such that the sumset 2A contains {0,1,2,...,n-1}. A classical problem in additive number theory is to find an upper bound for n(2,k). In this…

Number Theory · Mathematics 2007-05-23 Sinan Gunturk , Melvyn B. Nathanson

We give a full list of known $\mathcal{N}=1$ supersymmetric quantum field theories related by the Seiberg electric-magnetic duality conjectures for $SU(N), SP(2N)$ and $G_2$ gauge groups. Many of the presented dualities are new, not…

High Energy Physics - Theory · Physics 2015-05-14 V. P. Spiridonov , G. S. Vartanov

We study approximation of the embedding $\ell_p^m \rightarrow \ell_{\infty}^m$, $1 \leq p \leq 2$, based on randomized adaptive algorithms that use arbitrary linear functionals as information on a problem instance. We show upper bounds for…

Numerical Analysis · Mathematics 2024-08-05 Robert J. Kunsch , Marcin Wnuk

We consider hyper- and superelliptic equations $f(x)=by^m$ with unknowns x,y from the ring of S-integers of a given number field K. Here, f is a polynomial with S-integral coefficients of degree n with non-zero discriminant and b is a…

Number Theory · Mathematics 2023-09-19 Attila Bérczes , Jan-Hendrik Evertse , Kálmán Györy

Binary embedding is the problem of mapping points from a high-dimensional space to a Hamming cube in lower dimension while preserving pairwise distances. An efficient way to accomplish this is to make use of fast embedding techniques…

Data Structures and Algorithms · Computer Science 2016-03-15 Samet Oymak

Let $M$ be a submanifold of ${\Bbb P}^N$ of dimension $n>2$. Suppose that $(M,{\Cal O}_M(1))\cong{\Bbb P}({\Cal E}),{\Cal O}(1))$ for some vector bundle ${\Cal E}$ on a surface $S$. Then $N\ge 2n-1$ by Barth-Lefschetz Theorem. We are…

alg-geom · Mathematics 2008-02-03 Takao Fujita

We show that for $n$ at least $10^{11}$, any 2-coloring of the $n$-dimensional grid $[4]^n$ contains a monochromatic combinatorial line. This is a special case of the Hales-Jewett Theorem, to which the best known general upper bound is due…

Combinatorics · Mathematics 2015-04-13 Mikhail Lavrov

Pulling back complex structures along a branched covering induces a holomorphic isometric embedding of Teichm\"uller spaces. We show that for dimension at least $2$, all isometric embeddings arise from branched coverings. This generalizes a…

Geometric Topology · Mathematics 2023-05-09 Frederik Benirschke , Carlos A. Serván

The induced Ramsey number $R_{\mathrm{ind}}(H; r)$ of a graph $H$ is the minimum number $N$ such that there exists a graph with $N$ vertices for which all $r$-colourings of its edges contain a monochromatic induced copy of $H$. Our main…

Combinatorics · Mathematics 2025-11-14 Lucas Aragão , Marcelo Campos , Gabriel Dahia , Rafael Filipe , João Pedro Marciano

Let $0<p,q \leq \infty$ and denote by $\mathcal S_p^N$ and $\mathcal S_q^N$ the corresponding finite-dimensional Schatten classes. We prove optimal bounds, up to constants only depending on $p$ and $q$, for the entropy numbers of natural…

Functional Analysis · Mathematics 2016-12-28 Aicke Hinrichs , Joscha Prochno , Jan Vybiral

New upper and lower bounds for the $\ell_p (1<p<\infty)$ norms of Cauchy-Toeplitz matrices in the form $T_n=[2/(1+2(i-j))]_{i,j=1}^n$ are derived. Moreover, we give a complete answer to a conjecture proposed by D. Bozkurt.

Classical Analysis and ODEs · Mathematics 2026-03-24 Tserendorj Batbold

We say that a pair $(\mathcal{A},\mathcal{B})$ is a recovering pair if $\mathcal{A}$ and $\mathcal{B}$ are set systems on an $n$ element ground set, such that for every $A,A' \in \mathcal{A}$ and $B,B' \in \mathcal{B}$ we have that ($A…

Combinatorics · Mathematics 2015-10-27 Daniel Soltész
‹ Prev 1 3 4 5 6 7 10 Next ›