中文
相关论文

相关论文: New lower bounds on kissing numbers and spherical …

200 篇论文

A nonsingular surface of degree $d \geq 2$ in $\mathbb{P}^3$ over $\mathbb{F}_q$ has at most $((d-1)q+1)d$ $\mathbb{F}_q$-lines, and this bound is optimal for $d = 2, \sqrt{q}+1, q+1$.

代数几何 · 数学 2016-08-10 Masaaki Homma , Seon Jeong Kim

We prove a new lower bound for the off-diagonal Ramsey numbers, \[ R(3,k) \geq \bigg( \frac{1}{3}+ o(1) \bigg) \frac{k^2}{\log k }\, , \] thereby narrowing the gap between the upper and lower bounds to a factor of $3+o(1)$. This improves…

组合数学 · 数学 2025-05-20 Marcelo Campos , Matthew Jenssen , Marcus Michelen , Julian Sahasrabudhe

Let $h(d)$ be the class number of indefinite binary quadratic forms of discriminant $d$, and let $\varepsilon_d$ be the corresponding fundamental unit. In this paper, we obtain an asymptotic formula for the $k$-th moment of $h(d)$ over…

数论 · 数学 2017-02-23 Youness Lamzouri

A family of spherical caps of the 2-dimensional unit sphere $\mathbb{S}^2$ is called a totally separable packing in short, a TS-packing if any two spherical caps can be separated by a great circle which is disjoint from the interior of each…

度量几何 · 数学 2025-05-07 Károly Bezdek , Zsolt Lángi

In 1992, Kalai and Kleitman proved that the diameter of a $d$-dimensional polyhedron with $n$ facets is at most $n^{2+\log_2 d}$. In 2014, Todd improved the Kalai-Kleitman bound to $(n-d)^{\log_2 d}$. We improve the Todd bound to…

最优化与控制 · 数学 2017-09-29 Noriyoshi Sukegawa

In this paper, we prove a new point-sphere incidence bound in vector spaces over finite fields. More precisely, let $P$ be a set of points and $S$ be a set of spheres in $\mathbb{F}_q^d$. Suppose that $|P|, |S|\le N$, we prove that the…

组合数学 · 数学 2021-09-20 Doowon Koh , Thang Pham

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

Given a lattice $\Lambda \subset \mathbb{R}^n$, we consider its Minkowski reduced basis and the solid angle $\Omega$ spanned by the basis vectors. Such a basis satisfies strong near-orthogonality conditions, which allow us to bound from…

度量几何 · 数学 2017-03-02 Danny Nguyen

For a symmetric convex body $K\subset\mathbb{R}^n$, the Dvoretzky dimension $k(K)$ is the largest dimension for which a random central section of $K$ is almost spherical. A Dvoretzky-type theorem proved by V.~D.~Milman in 1971 provides a…

泛函分析 · 数学 2016-12-13 Han Huang , Feng Wei

The minimal spherical cap dispersion ${\rm disp}_{\mathcal{C}}(n,d)$ is the largest number $\varepsilon\in (0,1]$ such that, for every $n$ points on the $d$-dimensional Euclidean unit sphere $\mathbb{S}^d$, there exists a spherical cap with…

度量几何 · 数学 2025-12-10 Alexander E. Litvak , Mathias Sonnleitner , Tomasz Szczepanski

Let $X$ be a complex algebraic K3 surface of degree $2d$ and with Picard number $\rho$. Assume that $X$ admits two commuting involutions: one holomorphic and one anti-holomorphic. In that case, $\rho \geq 1$ when $d=1$ and $\rho \geq 2$…

代数几何 · 数学 2025-11-25 Dino Festi , Wim Nijgh , Daniel Platt

We prove a new upper bound for the minimum $d$-degree threshold for perfect matchings in $k$-uniform hypergraphs when $d<k/2$. As a consequence, this determines exact values of the threshold when $0.42k \le d < k/2$ or when $(k,d)=(12,5)$…

组合数学 · 数学 2016-05-12 Jie Han

The Kepler conjecture asserts that the density of a packing of congruent balls in three dimensions is never greater than $\pi/\sqrt{18}$. A computer assisted verification confirmed this conjecture in 1998. This article gives a historical…

度量几何 · 数学 2007-05-23 Thomas C. Hales

Let $k$ and $n$ be positive integers, $n>k$. Define $r(n,k)$ to be the minimum positive value of $$ |\sqrt{a_1} + ... + \sqrt{a_k} - \sqrt{b_1} - >... -\sqrt{b_k} | $$ where $ a_1, a_2, ..., a_k, b_1, b_2, ..., b_k $ are positive integers…

计算几何 · 计算机科学 2007-05-23 Qi Cheng

We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

度量几何 · 数学 2025-10-28 Steven Hoehner , Carsten Schütt , Elisabeth Werner

A family of axis-aligned boxes in $\er^d$ is \emph{$k$-neighborly} if the intersection of every two of them has dimension at least $d-k$ and at most $d-1$. Let $n(k,d)$ denote the maximum size of such a family. It is known that $n(k,d)$ can…

Consider a set P of N random points on the unit sphere of dimension $d-1$, and the symmetrized set S = P union (-P). The halving polyhedron of S is defined as the convex hull of the set of centroids of N distinct points in S. We prove that…

计算几何 · 计算机科学 2014-04-25 Quentin Mérigot

The Rolling Ball Theorem asserts that given a convex body K in Euclidean space and having a smooth surface bd(K) with all principal curvatures not exceeding c>0 at all boundary points, K necessarily has the property that to each boundary…

微分几何 · 数学 2009-03-30 Sz. Gy. Re've'sz

In a recent preprint on arXiv Roland Bacher showed that the number $p_d$ of non-similar perfect $d$-dimensional quadratic forms satisfies $e^{\Omega(d)} < p_d < e^{O(d^3\log(d))}$. We improve the upper bound to $e^{O(d^2\log(d))}$ by a…

数论 · 数学 2020-11-17 Wessel P. J. van Woerden

A lattice $(d,k)$-polytope is the convex hull of a set of points in $\mathbb{R}^d$ whose coordinates are integers ranging between $0$ and $k$. We consider the smallest possible distance $\varepsilon(d,k)$ between two disjoint lattice…

组合数学 · 数学 2025-10-14 Antoine Deza , Zhongyuan Liu , Lionel Pournin