English
Related papers

Related papers: Volume of Metric Balls in High-Dimensional Complex…

200 papers

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…

Information Theory · Computer Science 2015-06-25 Lu Wei , Renaud-Alexandre Pitaval , Jukka Corander , Olav Tirkkonen

This paper considers the quantization problem on the Grassmann manifold \mathcal{G}_{n,p}, the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space. The chief result is a closed-form formula for the…

Information Theory · Computer Science 2007-07-13 Wei Dai , Youjian Liu , Brian Rider

The Grassmann manifold G_{n,p}(L) is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space L^{n}, where L is either R or C. This paper considers an unequal dimensional quantization in which a source…

Information Theory · Computer Science 2016-11-15 Wei Dai , Brian Rider , Youjian Liu

This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volume of a metric ball in the Grassmann manifold when the radius is…

Information Theory · Computer Science 2007-07-13 Wei Dai , Youjian Liu , Brian Rider

If (M^n, g) is a complete Riemannian manifold with filling radius at least R, then we prove that it contains a ball of radius R and volume at least c(n)R^n. If (M^n, hyp) is a closed hyperbolic manifold and if g is another metric on M with…

Differential Geometry · Mathematics 2007-05-23 Larry Guth

We consider the volume of a Boolean expression of some congruent balls about a given system of centers in the $d$-dimensional Euclidean space. When the radius $r$ of the balls is large, this volume can be approximated by a polynomial of…

Metric Geometry · Mathematics 2017-12-22 Balázs Csikós

We study the size (or volume) of balls in the metric space of permutations, $S_n$, under the infinity metric. We focus on the regime of balls with radius $r = \rho \cdot (n\!-\!1)$, $\rho \in [0,1]$, i.e., a radius that is a constant…

Information Theory · Computer Science 2017-04-21 Moshe Schwartz , Pascal O. Vontobel

The density of a code is the fraction of the coding space covered by packing balls centered around the codewords. This paper investigates the density of codes in the complex Stiefel and Grassmann manifolds equipped with the chordal…

Information Theory · Computer Science 2017-12-29 Renaud-Alexandre Pitaval , Lu Wei , Olav Tirkkonen , Camilla Hollanti

In this paper we get an explicit lower bound for the radius of a Bergman ball contained in the Dirichlet fundamental polyhedron of a torsion-free discrete group $G\subset PU(n,1)$ acting on complex hyperbolic space. Consequently the volume…

Differential Geometry · Mathematics 2013-04-09 Baohua Xie , Jieyan Wang , Yueping Jiang

The Vapnik-Chervonenkis dimension provides a notion of complexity for systems of sets. If the VC dimension is small, then knowing this can drastically simplify fundamental computational tasks such as classification, range counting, and…

Computational Geometry · Computer Science 2019-11-18 Anne Driemel , André Nusser , Jeff M. Phillips , Ioannis Psarros

A new intrinsic volume metric is introduced for the class of convex bodies in $\mathbb{R}^n$. As an application, an inequality is proved for the asymptotic best approximation of the Euclidean unit ball by arbitrarily positioned polytopes…

Metric Geometry · Mathematics 2023-03-15 Florian Besau , Steven Hoehner

The finite Grassmannian $\mathcal{G}_{q}(k,n)$ is defined as the set of all $k$-dimensional subspaces of the ambient space $\mathbb{F}_{q}^{n}$. Subsets of the finite Grassmannian are called constant dimension codes and have recently found…

Information Theory · Computer Science 2014-06-20 Joachim Rosenthal , Natalia Silberstein , Anna-Lena Trautmann

A ball polyhedron is the intersection of a finite number of closed balls in $\mathbb{R}^3$ with the same radius. In this note, we study ball polyhedra in which the set of centers defining the balls have the maximum possible number of…

Metric Geometry · Mathematics 2024-08-15 Ryan Hynd

The Grassmann angle improves upon similar angles between subspaces that measure volume contraction in orthogonal projections. It works in real or complex spaces, with important differences, and is asymmetric, what makes it more efficient…

Metric Geometry · Mathematics 2021-01-13 André L. G. Mandolesi

The cognitive framework of conceptual spaces [3] provides geometric means for representing knowledge. A conceptual space is a high-dimensional space whose dimensions are partitioned into so-called domains. Within each domain, the Euclidean…

Artificial Intelligence · Computer Science 2017-09-25 Lucas Bechberger

The smallest $r$ so that a metric $r$-ball covers a metric space $M$ is called the radius of $M$. The volume of a metric $r$-ball in the space form of constant curvature $k$ is an upper bound for the volume of any Riemannian manifold with…

Differential Geometry · Mathematics 2015-05-22 Curtis Pro , Michael Sill , Frederick Wilhelm

Volume is a natural measure of complexity of a Riemannian manifold. In this survey, we discuss the results and conjectures concerning n-dimensional hyperbolic manifolds and orbifolds of small volume.

Metric Geometry · Mathematics 2014-06-16 Mikhail Belolipetsky

If $(M^n, g)$ is a closed Riemannian manifold where every unit ball has volume at most $\epsilon_n$ (a sufficiently small constant), then the $(n-1)$-dimensional Uryson width of $(M^n, g)$ is at most 1.

Differential Geometry · Mathematics 2015-04-30 Larry Guth

The purpose of this paper is to study the notion of the quasihyperbolic volume and to find growth estimates for the quasihyperbolic volume of balls in a domain $G \subset {\mathbb R}^n\,$ in terms of the radii.

Metric Geometry · Mathematics 2017-07-27 Xiaohui Zhang , Riku Klén , Ville Suomala , Matti Vuorinen

We prove bounds for the almost sure value of the Hausdorff dimension of the limsup set of a sequence of balls in $\mathbf{R}^d$ whose centres are independent, identically distributed random variables. The formulas obtained involve the rate…

Classical Analysis and ODEs · Mathematics 2018-08-01 Fredrik Ekström , Tomas Persson
‹ Prev 1 2 3 10 Next ›