中文
相关论文

相关论文: Sphere packing bounds in the Grassmann and Stiefel…

200 篇论文

We study the high-dimensional limit of (projective) Stiefel and Grassmann manifolds as metric measure spaces in Gromov's topology. The limits are either the infinite-dimensional Gaussian space or its quotient by an mm-isomorphic group…

度量几何 · 数学 2015-07-17 Takashi Shioya , Asuka Takatsu

We derive new, sharp lower bounds for certain curvature functionals on the space of Riemannian metrics of a smooth compact 4-manifold with a non-trivial Seiberg-Witten invariant. These allow one, for example, to exactly compute the infimum…

微分几何 · 数学 2009-10-31 Claude LeBrun

We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of…

组合数学 · 数学 2011-04-29 Alexander Barg , Oleg R. Musin

This text contains some notes on the Griesmer bound. In particular, we give a geometric proof of the Griesmer bound for the generalized weights and show that a Solomon--Stiffler type construction attains it if the minimum distance is…

组合数学 · 数学 2026-01-05 Sascha Kurz , Ivan Landjev , Assia Rousseva

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

组合数学 · 数学 2020-07-14 Peter Boyvalenkov , Maya Stoyanova

Volume estimates of metric balls in manifolds find diverse applications in information and coding theory. In this paper, some new results for the volume of a metric ball in unitary group are derived via various tools from random matrix…

信息论 · 计算机科学 2015-06-25 Lu Wei , Renaud-Alexandre Pitaval , Jukka Corander , Olav Tirkkonen

We establish a general formula for the maximum size of finite length block codes with minimum pairwise distance no less than $d$. The achievability argument involves an iterative construction of a set of radius-$d$ balls, each centered at a…

信息论 · 计算机科学 2018-05-03 Ling-Hua Chang , Po-Ning Chen , Vincent Y. F. Tan , Carol Wang , Yunghsiang S. Han

We give a metric characterization of the scalar curvature of a smooth Riemannian manifold, analyzing the maximal distance between $(n+1)$ points in infinitesimally small neighborhoods of a point. Since this characterization is purely in…

微分几何 · 数学 2022-12-19 Giona Veronelli

Let $V$ be a separable Hilbert space, possibly infinite dimensional. Let $\St(p,V)$ be the Stiefel manifold of orthonormal frames of $p$ vectors in $V$, and let $\Gr(p,V)$ be the Grassmann manifold of $p$ dimensional subspaces of $V$. We…

微分几何 · 数学 2018-09-28 Philipp Harms , Andrea C. G. Mennucci

After a discussion of the Griesmer and Heller bound for the distance of a convolutional code we present several codes with various parameters, over various fields, and meeting the given distance bounds. Moreover, the Griesmer bound is used…

环与代数 · 数学 2007-07-16 Heide Gluesing-Luerssen , Wiland Schmale

We prove that the integral of scalar curvature over a Riemannian manifold is uniformly bounded below in terms of its dimension, upper bounds on sectional curvature and volume, and a lower bound on injectivity radius. This is an analogue of…

微分几何 · 数学 2025-07-17 Tadashi Fujioka

On a Riemannian manifold with a positive lower bound on the Ricci tensor, the distance of isoperimetric sets from geodesic balls is quantitatively controlled in terms of the gap between the isoperimetric profile of the manifold and that of…

微分几何 · 数学 2020-04-22 F. Cavalletti , F. Maggi , A. Mondino

We show that the volume of any Riemannian metric on a three sphere is bounded below by the length of the shortest closed curve that links its antipodal image. In particular, the volume is bounded below by the minimum of the length of the…

微分几何 · 数学 2007-05-23 Christopher B. Croke

We study the minimum distance of codes defined on bipartite graphs. Weight spectrum and the minimum distance of a random ensemble of such codes are computed. It is shown that if the vertex codes have minimum distance $\ge 3$, the overall…

信息论 · 计算机科学 2007-07-13 Alexander Barg , Gilles Zemor

We continue the study of optimal chordal packings, with emphasis on packing subspaces of dimension greater than one. Following a principle outlined in a previous work, where the authors use maximal affine block designs and maximal sets of…

泛函分析 · 数学 2018-06-12 Peter G. Casazza , John I. Haas , Joshua Stueck , Tin T. Tran

Studies of random close packing of spheres have advanced our knowledge about the structure of systems such as liquids, glasses, emulsions, granular media, and amorphous solids. When these systems are confined their structural properties…

软凝聚态物质 · 物理学 2009-12-17 Kenneth W. Desmond , Eric R. Weeks

This paper derives an improved sphere-packing (ISP) bound targeting codes of short to moderate block lengths. We first review the 1967 sphere-packing (SP67) bound for discrete memoryless channels, and a recent improvement by Valembois and…

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

Sectional curvature bounds are of central importance in the study of Riemannian manifolds, both in smooth differential geometry and in the generalized synthetic setting of Alexandrov spaces. Riemannian metrics along with metric spaces of…

微分几何 · 数学 2026-01-30 Darius Erös , Michael Kunzinger , Argam Ohanyan , Alessio Vardabasso

The volume of a k-dimensional foliation $\mathcal{F}$ in a Riemannian manifold $M^{n}$ is defined as the mass of image of the Gauss map, which is a map from M to the Grassmann bundle of k-planes in the tangent bundle. Generalizing a…

微分几何 · 数学 2007-05-23 Fabiano Brito , David L. Johnson

We give upper and lower bounds for the ratio of the volume of metric ball to the area of the metric sphere in Finsler-Hadamard manifolds with pinched S-curvature. We apply these estimates to find the limit at the infinity for this ratio.…

微分几何 · 数学 2011-10-11 Alexandr A. Borisenko , Eugeny A. Olin