English
Related papers

Related papers: On the volume of projections of the cross-polytope

200 papers

Let $P$ be a convex polyhedron and $Q$ be a convex polygon with $n$ vertices in total in three-dimensional space. We present a deterministic algorithm that finds a translation vector $v \in \mathbb{R}^3$ maximizing the overlap area $|P \cap…

Computational Geometry · Computer Science 2025-01-28 Hyuk Jun Kweon , Honglin Zhu

We show that the rate of convergence on the approximation of volumes of a convex symmetric polytope P in R^n by its dual L_{p$-centroid bodies is independent of the geometry of P. In particular we show that if P has volume 1,…

Functional Analysis · Mathematics 2011-07-20 Grigoris Paouris , Elisabeth M. Werner

A $3$-dimensional polytope $P$ is $k$-equiprojective when the projection of $P$ along any line that is not parallel to a facet of $P$ is a polygon with $k$ vertices. In 1968, Geoffrey Shephard asked for a description of all equiprojective…

Metric Geometry · Mathematics 2025-10-06 Théophile Buffière , Lionel Pournin

We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given $n$ diameters of a circle and a positive integer $k<n$, this paper addresses the problem of…

Metric Geometry · Mathematics 2015-02-03 L. Barba , L. E. Caraballo , J. M. Díaz-Báñez , R. Fabila-Monroy , E. Pérez-Castillo

Finding the $r\times r$ submatrix of maximum volume of a matrix $A\in\mathbb R^{n\times n}$ is an NP hard problem that arises in a variety of applications. We propose a new greedy algorithm of cost $\mathcal O(n)$, for the case $A$…

Numerical Analysis · Mathematics 2021-04-05 Stefano Massei

The geometry of the dual amplituhedron is generally described in reference to a particular triangulation. A given triangulation manifests only certain aspects of the underlying space while obscuring others, therefore understanding this…

High Energy Physics - Theory · Physics 2017-08-22 Michael Enciso

Let $P$ and $Q$ be two simple polygons in the plane of total complexity $n$, each of which can be decomposed into at most $k$ convex parts. We present an $(1-\varepsilon)$-approximation algorithm, for finding the translation of $Q$, which…

Computational Geometry · Computer Science 2014-06-24 Sariel Har-Peled , Subhro Roy

We study the properties of a set of vectors called tight frames that obtained as the orthogonal projection of some orthonormal basis of $\R^n$ onto $\R^k.$ We show that a set of vectors is a tight frame if and only if the set of all cross…

Metric Geometry · Mathematics 2023-06-22 Grigory Ivanov

Approximating convex bodies is a fundamental question in geometry, which has a wide variety of applications. Given a convex body $K$ in $\textbf{R}^d$ for fixed $d$, the objective is to minimize the number of facets of an approximating…

Computational Geometry · Computer Science 2026-01-26 Sunil Arya , David M. Mount

Let $n \geq 2$ be an integer such that an equiangular set of vectors $w_1, \ldots, w_d$ of the maximal possible cardinality (in relation to the the general Gerzon upper bound) exists in $\mathbb{K}^n$, where $\mathbb{K}=\mathbb{R}$ or…

Functional Analysis · Mathematics 2025-06-02 Tomasz Kobos

Let $B$ be a set of $n$ axis-parallel boxes in $\mathbb{R}^d$ such that each box has a corner at the origin and the other corner in the positive quadrant of $\mathbb{R}^d$, and let $k$ be a positive integer. We study the problem of…

Computational Geometry · Computer Science 2018-03-05 Karl Bringmann , Sergio Cabello , Michael T. M. Emmerich

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

Computational Geometry · Computer Science 2022-12-09 Rahul Arya , Sunil Arya , Guilherme D. da Fonseca , David M. Mount

Denote by ${\mathcal K}^d$ the family of convex bodies in $E^d$ and by $w(C)$ the minimal width of $C \in {\mathcal K}^d$. We ask for the greatest number $\Lambda_n ({\mathcal K}^d)$ such that every $C \in {\mathcal K}^d$ contains a…

Metric Geometry · Mathematics 2017-03-30 Marek Lassak

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…

Metric Geometry · Mathematics 2025-10-28 Steven Hoehner , Carsten Schütt , Elisabeth Werner

A weighted game or a threshold function in general admits different weighted representations even if the sum of non-negative weights is fixed to one. Here we study bounds for the diameter of the corresponding weight polytope. It turns out…

Computer Science and Game Theory · Computer Science 2019-07-05 Sascha Kurz

Let $H$ be a hypersurface in $\mathbb R^n$ and let $\pi$ be an orthogonal projection in $\mathbb R^n$ restricted to $H$. We say that $H$ satisfies the $Archimedean$ $projection$ $property$ corresponding to $\pi$ if there exists a constant…

Differential Geometry · Mathematics 2015-04-14 Vincent Coll , Jeff Dodd , Michael Harrison

Interesting data often concentrate on low dimensional smooth manifolds inside a high dimensional ambient space. Random projections are a simple, powerful tool for dimensionality reduction of such data. Previous works have studied bounds on…

Machine Learning · Statistics 2016-09-13 Subhaneil Lahiri , Peiran Gao , Surya Ganguli

Let $X$ be a normal projective variety of dimension $d$ over an algebraically closed field and $f$ an automorphism of $X$. Suppose that the pullback $f^*|_{\mathsf{N}^1(X)_\mathbf{R}}$ of $f$ on the real N\'eron--Severi space…

Algebraic Geometry · Mathematics 2026-05-14 Fei Hu , Chen Jiang

Let $X_1,\ldots,X_N$, $N>n$, be independent random points in $\mathbb{R}^n$, distributed according to the so-called beta or beta-prime distribution, respectively. We establish threshold phenomena for the volume, intrinsic volumes, or more…

Metric Geometry · Mathematics 2018-06-15 Gilles Bonnet , Giorgos Chasapis , Julian Grote , Daniel Temesvari , Nicola Turchi

In many cosmological models, including the $\Lambda$CDM concordance model, there exist a theoretical upper bounds on the size of collapsing structures. The most common formulations in the literature refer to a turnaround radius in spherical…

General Relativity and Quantum Cosmology · Physics 2022-05-11 Jan J. Ostrowski , Ismael Delgado Gaspar