中文
相关论文

相关论文: New upper bounds on sphere packings II

200 篇论文

We investigate Riemannian manifolds $(M^n,g)$ whose curvature operator of the second kind $\mathring{R}$ satisfies the condition \begin{equation*} \alpha^{-1} (\lambda_1 +\cdots +\lambda_{\alpha}) > - \theta \bar{\lambda}, \end{equation*}…

微分几何 · 数学 2025-10-29 Xiaolong Li

R. P. Stanley proved the Upper Bound Conjecture in 1975. We imitate his proof for the Ehrhart rings. We give some upper bounds for the volume of integrally closed lattice polytopes. We derive some inequalities for the delta-vector of…

组合数学 · 数学 2016-10-10 Gabor Hegedüs

Van Geemen and van der Geer, Donagi, Beauville and Debarre proposed characterizations of the locus of jacobians which use the linear system of $2\Theta$-divisors. We give new evidence for these conjectures in the case of Prym varieties.

alg-geom · 数学 2008-02-03 E. Izadi

We provide here a proof theoretic account of constraint programming that attempts to capture the essential ingredients of this programming style. We exemplify it by presenting proof rules for linear constraints over interval domains, and…

人工智能 · 计算机科学 2007-05-23 Krzysztof R. Apt

We derive a procedure for computing an upper bound on the number of equiangular lines in various Euclidean vector spaces by generalizing the classical pillar decomposition developed by (Lemmens and Seidel, 1973); namely, we use linear…

组合数学 · 数学 2018-05-28 Emily J. King , Xiaoxian Tang

In this paper we study crystallographic sphere packings and Kleinian sphere packings, introduced first by Kontorovich and Nakamura in 2017 and then studied further by Kapovich and Kontorovich in 2021. In particular, we solve the problem of…

几何拓扑 · 数学 2024-04-15 Nikolay Bogachev , Alexander Kolpakov , Alex Kontorovich

We study Euclidean designs from the viewpoint of the potential energy. For a finite set in Euclidean space, We formulate a linear programming bound for the potential energy by applying harmonic analysis on a sphere. We also introduce the…

组合数学 · 数学 2012-06-29 Tsuyoshi Miezaki , Makoto Tagami

In a recent breakthrough, Viazovska and Cohn, Kumar, Miller, Radchenko, Viazovska solved the sphere packing problem in $\mathbb{R}^8$ and $\mathbb{R}^{24}$, respectively, by exhibiting explicit optimal functions, arising from the theory of…

数论 · 数学 2019-06-27 Nina Zubrilina

We obtain new linear programming (LP) and constructive bounds for the covering radius of binary orthogonal arrays of strength $2k$. Our LP bounds develop in two alternative scenarios. First, if a point $y \in F_2^n$, where the covering…

信息论 · 计算机科学 2026-05-06 Peter Boyvalenkov , Ferruh Ozbudak , Maya Stoyanova

We have identified some necessary conditions for the existence of rigid sphere designs. In particular, we have successfully resolved the conjecture proposed by [Ban87]; Given fixed positive integers t and d, we show that there exist only…

组合数学 · 数学 2024-03-26 Yuhi Kamio

Upper and lower bounds on the error probability of linear codes under maximum-likelihood (ML) decoding are shortly surveyed and applied to ensembles of codes on graphs. For upper bounds, focus is put on Gallager bounding techniques and…

信息论 · 计算机科学 2007-07-13 Igal Sason , Shlomo Shamai

Recently, Venkatesh improved the best known lower bound for lattice sphere packings by a factor $\log\log n$ for infinitely many dimensions $n$. Here we prove an effective version of this result, in the sense that we exhibit, for the same…

数论 · 数学 2017-05-02 Philippe Moustrou

We use techniques from algebraic and extremal combinatorics to derive upper bounds on the number of independent sets in several (hyper)graphs arising from finite geometry. In this way, we obtain asymptotically sharp upper bounds for partial…

组合数学 · 数学 2024-04-09 Sam Mattheus , Geertrui Van de Voorde

We introduce a linear programming framework for obtaining upper bounds for the potential energy of spherical codes of fixed cardinality and minimum distance. Using Hermite interpolation we construct polynomials to derive corresponding…

度量几何 · 数学 2020-02-04 Peter Boyvalenkov , Peter Dragnev , Douglas Hardin , Edward Saff , Maya Stoyanova

We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere…

信息论 · 计算机科学 2026-03-27 Minjia Shi , Xuan Wang , Junmin An , Jon-Lark Kim

Define the superball with radius $r$ and center ${\boldsymbol 0}$ in $\mathbb{R}^n$ to be the set $$ \left\{{\boldsymbol x}\in\mathbb{R}^n:\sum_{j=1}^{m}\left(x_{k_j+1}^2+x_{k_j+2}^2+\cdots+x_{k_{j+1}}^2\right)^{p/2}\leq…

度量几何 · 数学 2022-06-22 Chengfei Xie , Gennian Ge

In 1974, Witsenhausen asked for the maximum possible density $\alpha_n$ of a measurable subset $A$ of the unit sphere $\mathbb{S}^{n-1}\subset \mathbb{R}^n$ such that $A$ contains no pair of orthogonal vectors. For $n=3$, the best known…

组合数学 · 数学 2026-05-28 Domonkos Czifra , Ákos Dúcz , Máté Matolcsi , Dániel Varga , Pál Zsámboki

We prove the scalar curvature rigidity for $L^\infty$ metrics on $\mathbb S^n\backslash\Sigma$, where $\mathbb S^n$ is the $n$-dimensional sphere with $n\geq 3$ and $\Sigma$ is a closed subset of $\mathbb S^n$ of codimension at least…

微分几何 · 数学 2026-05-21 Jinmin Wang , Zhizhang Xie

In this paper, we prove $L^2 \to L^p$ estimates, where $p>2$, for spectral projectors on a wide class of hyperbolic surfaces. More precisely, we consider projections in small spectral windows $[\lambda-\eta,\lambda+\eta]$ on geometrically…

偏微分方程分析 · 数学 2023-06-23 Jean-Philippe Anker , Pierre Germain , Tristan Léger

We show that in any $d$-dimensional real normed space, unit balls can be packed with density at least \[\frac{(1-o(1))d\log d}{2^{d+1}},\] improving a result of Schmidt from 1958 by a logarithmic factor and generalizing the recent result of…

度量几何 · 数学 2025-04-23 Carl Schildkraut