中文
相关论文

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

200 篇论文

We adapt linear programming methods from sphere packings to closed hyperbolic surfaces and obtain new upper bounds on their systole, their kissing number, the first positive eigenvalue of their Laplacian, the multiplicity of their first…

几何拓扑 · 数学 2026-02-10 Maxime Fortier Bourque , Bram Petri

We obtain a lower bound of n^Omega(1) on the k-party randomized communication complexity of the Disjointness function in the `Number on the Forehead' model of multiparty communication when k is a constant. For k=o(loglog n), the bounds…

计算复杂性 · 计算机科学 2008-02-21 Arkadev Chattopadhyay , Anil Ada

We improve upper bounds on sphere packing densities and sizes of spherical codes in high dimensions. In particular, we prove that the maximal sphere packing densities $\delta_n$ in $\mathbb{R}^n$ satisfy \[\delta_n\leq \frac{1+o(1)}{e}\cdot…

度量几何 · 数学 2024-07-16 Masoud Zargar

Kupavskii proved a codegree version of the Erd\H{o}s--Ko--Rado theorem by showing that for an intersecting family $\mathcal{F} \subseteq \binom{[n]}{k}$ with $n \geq 2k +3d/(1-d/k)$, the minimum $d$-degree of $\mathcal{F}$ is at most…

组合数学 · 数学 2026-05-19 Luyining Gan , Jie Han , Seonghyuk Im

Every graph $G$ can be represented by a collection of equi-radii spheres in a $d$-dimensional metric $\Delta$ such that there is an edge $uv$ in $G$ if and only if the spheres corresponding to $u$ and $v$ intersect. The smallest integer $d$…

计算几何 · 计算机科学 2018-11-16 Roee David , Karthik C. S. , Bundit Laekhanukit

Motivated by a question of W. Kuperberg, we study the 18-dimensional manifold of configurations of 6 non-intersecting infinite cylinders of radius $r,$ all touching the unit ball in $\mathbb{R}^{3}.$ We find a configuration with \[…

度量几何 · 数学 2019-05-13 Oleg Ogievetsky , Senya Shlosman

In this paper, we give a conditional lower bound of $n^{\Omega(k)}$ on running time for the classic k-median and k-means clustering objectives (where n is the size of the input), even in low-dimensional Euclidean space of dimension four,…

数据结构与算法 · 计算机科学 2017-11-06 Vincent Cohen-Addad , Arnaud de Mesmay , Eva Rotenberg , Alan Roytman

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions (vertices with exactly k of the hyperplanes passing below…

计算几何 · 计算机科学 2020-03-17 M. Sharir , C. Ziv

To investigate the fundamental limit to far-field incoherent imaging, the prequels to this work [M. Tsang, Phys. Rev. A 99, 012305 (2019); 104, 052411 (2021)] have studied a quantum lower bound on the error of estimating an object moment…

量子物理 · 物理学 2024-04-01 Xiao-Jie Tan , Mankei Tsang

The thirteen spheres problem is asking if 13 equal size nonoverlapping spheres in three dimensions can touch another sphere of the same size. This problem was the subject of the famous discussion between Isaac Newton and David Gregory in…

度量几何 · 数学 2015-03-13 Oleg Musin , Alexey Tarasov

Let ||.|| be a norm in R^d whose unit ball is B. Assume that V\subset B is a finite set of cardinality n, with \sum_{v \in V} v=0. We show that for every integer k with 0 \le k \le n, there exists a subset U of V consisting of k elements…

度量几何 · 数学 2020-12-04 Gergely Ambrus , Imre Barany , Victor Grinberg

Motivated by intuitions from projective algebraic geometry, we provide a novel construction of subsets of the $d$-dimensional grid $[n]^d$ of size $n - o(n)$ with no $d + 2$ points on a sphere or a hyperplane. For $d = 2$, this improves the…

组合数学 · 数学 2025-06-24 Zichao Dong , Zijian Xu

Using SFT techniques, Eliashberg, Kim and Polterovich (2006) proved that if $\pi R_2^2 \leq K \leq \pi R_1^2$ for some integer $K$ then there is no contact squeezing in $\mathbb{R}^{2n} \times S^1$ of the prequantization of the ball of…

辛几何 · 数学 2025-04-16 Maia Fraser , Sheila Sandon , Bingyu Zhang

For $e \in S^{2}$, the unit sphere in $\mathbb{R}^3$, let $\pi_{e}$ be the orthogonal projection to $e^{\perp} \subset \mathbb{R}^{3}$, and let $W \subset \mathbb{R}^{3}$ be any $2$-plane, which is not a subspace. We prove that if $K…

经典分析与常微分方程 · 数学 2018-08-10 Tuomas Orponen , Laura Venieri

In the $d$-Scattered Set problem we are asked to select at least $k$ vertices of a given graph, so that the distance between any pair is at least $d$. We study the problem's (in-)approximability and offer improvements and extensions of…

计算复杂性 · 计算机科学 2019-10-15 Ioannis Katsikarelis , Michael Lampis , Vangelis Th. Paschos

We consider the problem \begin{equation}\label{Eq:Abstract} (1)\;\;\;\begin{cases} S_k(D^2u)= \lambda (1-u)^q &\mbox{in }\;\; B,\\ u <0 & \mbox{in }\;\; B,\\ u=0 &\mbox{on }\partial B, \end{cases} \end{equation} where $B$ denotes the unit…

偏微分方程分析 · 数学 2015-10-28 Justino Sánchez , Vicente Vergara

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

经典分析与常微分方程 · 数学 2007-05-23 Alex Iosevich , Misha Rudnev

We derive upper bounds on the fluctuations of a class of random surfaces of the $\nabla \phi$-type with convex interaction potentials. The Brascamp-Lieb concentration inequality provides an upper bound on these fluctuations for uniformly…

概率论 · 数学 2024-01-23 Paul Dario

In this article we construct a sequence $\{M_i\}$ of non compact finite volume hyperbolic $3$-manifolds whose kissing number grows at least as $\mathrm{vol}(M_i)^{\frac{31}{27}-\epsilon}$ for any $\epsilon>0$. This extends a previous result…

几何拓扑 · 数学 2021-11-01 Cayo Dória , Plinio G. P. Murillo

Let $X$ be an irreducible smooth geometrically integral projective surface over a field. In this paper we give an effective bound in terms of the Neron--Severi rank $\rho(X)$ of $X$ for the number of irreducible curves $C$ on $X$ with…

几何拓扑 · 数学 2019-07-29 Ted Chinburg , Matthew Stover
‹ 上一页 1 8 9 10 下一页 ›