中文
相关论文

相关论文: On the number of defects in optimal quantizers on …

200 篇论文

We use a local argument to prove if an $r$-dimensional torus acts isometrically and effectively on a connected $n$-dimensional manifold which has positive $k^\mathrm{th}$-intermediate Ricci curvature at some point, then $r \leq \lfloor…

微分几何 · 数学 2022-03-23 Lawrence Mouillé

Explicit non-asymptotic upper bounds on the sizes of multiple-deletion correcting codes are presented. In particular, the largest single-deletion correcting code for $q$-ary alphabet and string length $n$ is shown to be of size at most…

信息论 · 计算机科学 2012-11-15 Ankur A. Kulkarni , Negar Kiyavash

We study the existence of $L^2$ holomorphic sections of invariant line bundles over Galois coverings of Zariski open sets in Moishezon manilolds. We show that the von Neuman dimension of the space of $L^2$ holomorphic sections is bounded…

代数几何 · 数学 2007-05-23 Radu Todor , Ionuţ Chiose , George Marinescu

In this paper, we use a new method to decrease the parameterized complexity bound for finding the minimum vertex cover of connected max-degree-3 undirected graphs. The key operation of this method is reduction of the size of a particular…

数据结构与算法 · 计算机科学 2015-03-17 Weiya Yue , John Franco , Weiwei Cao

In 2003, Cohn and Umans described a framework for proving upper bounds on the exponent $\omega$ of matrix multiplication by reducing matrix multiplication to group algebra multiplication, and in 2005 Cohn, Kleinberg, Szegedy, and Umans…

This paper develops a systematic and geometric theory of optimal quantization on the unit sphere $\mathbb S^2$, focusing on finite uniform probability distributions supported on the spherical surface - rather than on lower-dimensional…

最优化与控制 · 数学 2026-01-08 Mrinal Kanti Roychowdhury

This paper is concerned with the rank constrained optimization problem whose feasible set is the intersection of the rank constraint set $\mathcal{R}=\!\big\{X\in\mathbb{X}\ |\ {\rm rank}(X)\le \kappa\big\}$ and a closed convex set…

最优化与控制 · 数学 2016-03-24 Shujun Bi , Shaohua Pan

For an input graph $G$, an additive spanner is a sparse subgraph $H$ whose shortest paths match those of $G$ up to small additive error. We prove two new lower bounds in the area of additive spanners: 1) We construct $n$-node graphs $G$ for…

数据结构与算法 · 计算机科学 2022-10-07 Greg Bodwin , Gary Hoppenworth

We give an upper bound for the number of compact essential orientable non-isotopic surfaces, with Euler characteristic at least some constant $\chi$, properly embedded in a finite-volume hyperbolic 3-manifold $M$, closed or cusped. This…

几何拓扑 · 数学 2026-03-05 Marc Lackenby , Anastasiia Tsvietkova

We prove that if $X$ is a finite area non-compact hyperbolic surface, then for any $\epsilon>0$, with probability tending to one as $n\to\infty$, a uniformly random degree $n$ Riemannian cover of $X$ has no eigenvalues of the Laplacian in…

谱理论 · 数学 2023-02-16 Will Hide , Michael Magee

Witsenhausen's problem asks for the maximum fraction $\alpha_n$ of the $n$-dimensional unit sphere that can be covered by a measurable set containing no pairs of orthogonal points. The best upper bounds for $\alpha_n$ are given by…

We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…

代数几何 · 数学 2020-06-09 Alain Couvreur , Philippe Lebacque , Marc Perret

The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…

组合数学 · 数学 2023-10-24 Herbert Edelsbrunner , János Pach

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

组合数学 · 数学 2020-07-21 Quentin Dubroff , Jacob Fox , Max Wenqiang Xu

We address an interesting question raised by Dos Santos Ferreira, Kenig and Salo about regions ${\mathcal R}_g\subset {\mathbb C}$ for which there can be uniform $L^{\frac{2n}{n+2}}\to L^{\frac{2n}{n-2}}$ resolvent estimates for…

偏微分方程分析 · 数学 2013-11-12 Jean Bourgain , Peng Shao , Christopher D. Sogge , Xiaohua Yao

We briefly review known results on upper bounds for the minimal domination number $\gamma_n$ of a hypercube of dimension $n$, then present a new method for constructing dominating sets. Write $n =2^{\hat{n}}-1 +{\check{n}}$ with $0\leq…

组合数学 · 数学 2024-09-24 Zachary DeVivo , Robert K. Hladky

We associate a sequence of variational eigenvalues to any Radon measure on a compact Riemannian manifold. For particular choices of measures, we recover the Laplace, Steklov and other classical eigenvalue problems. In the first part of the…

谱理论 · 数学 2020-12-08 Alexandre Girouard , Mikhail Karpukhin , Jean Lagacé

We study the problem of efficiently certifying upper bounds on the independence number of $\ell$-uniform hypergraphs. This is a notoriously hard problem, with efficient algorithms failing to approximate the independence number within…

数据结构与算法 · 计算机科学 2026-03-10 Pravesh Kothari , Anand Louis , Rameesh Paul , Prasad Raghavendra

We define a Toledo number for actions of surface groups and complex hyperbolic lattices on infinite dimensional Hermitian symmetric spaces, which allows us to define maximal representations. When the target is not of tube type we show that…

群论 · 数学 2022-12-21 Bruno Duchesne , Jean Lécureux , Maria Beatrice Pozzetti

We explore a natural generalization of systolic geometry to Finsler metrics and optical hypersurfaces with special emphasis on its relation to the Mahler conjecture and the geometry of numbers. In particular, we show that if an optical…

微分几何 · 数学 2020-10-16 Juan-Carlos Alvarez Paiva , Florent Balacheff , Kroum Tzanev