English
Related papers

Related papers: On the volume of a certain polytope

200 papers

We give a new combinatorial proof for the number of convex polyominoes whose minimum enclosing rectangle has given dimensions. We also count the subclass of these polyominoes that contain the lower left corner of the enclosing rectangle…

Combinatorics · Mathematics 2019-03-05 Kevin Buchin , Man-Kwun Chiu , Stefan Felsner , Günter Rote , André Schulz

Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…

Combinatorics · Mathematics 2019-09-16 Toshinori Sakai , Jorge Urrutia

In this work, we find an explicit expression for the volume of the trace nonnegative polytope via a generalization of the Irwin-Hall distribution. This volume is an upper bound for the volume of all projected, normalized realizable spectra.…

Metric Geometry · Mathematics 2016-03-23 Pietro Paparella , Gregory K. Taylor

We establish the second part of Milnor's conjecture on the volume of simplexes in hyperbolic and spherical spaces. A characterization of the closure of the space of the angle Gram matrices of simplexes is also obtained.

Geometric Topology · Mathematics 2007-08-28 Ren Guo , Feng Luo

The Birkhoff polytope is defined to be the convex hull of permutation matrices, $P_{\sigma}\ \forall \sigma\in S_n$. We define a second-order permutation matrix $P^{[2]}_{\sigma}$ in $\mathbb{R}^{n^2\times n^2}$ corresponding to a…

Optimization and Control · Mathematics 2014-09-08 Pawan Kumar Aurora , Shashank K Mehta

Let K be a compact convex body in Rd, let Kn be the convex hull of n points chosen uniformly and independently in K, and let fi(Kn) denote the number of i-dimensional faces of Kn. We show that for planar convex sets, E(f0(Kn)) is increasing…

Computational Geometry · Computer Science 2012-11-30 Olivier Devillers , Marc Glisse , Xavier Goaoc , Guillaume Moroz , Matthias Reitzner

It is proven that the volume of an infinitesimally flexible polyhedron in $R^3$ is a multiple root of its volume polynomial.

Metric Geometry · Mathematics 2017-07-04 I. Kh. Sabitov

The convex hull $\psi_{n,n}$ of certain $(n!)^2$ tensors was considered recently in connection with graph isomorphism. We consider the convex hull $\psi_n$ of the $n!$ diagonals among these tensors. We show: 1. The polytope $\psi_n$ is a…

Computational Complexity · Computer Science 2009-08-22 Shmuel Onn

We initiate the study of subpolytopes of the permutahedron that arise as the convex hulls of stack-sorting on permutations. We primarily focus on $Ln1$ permutations, i.e., permutations of length $n$ whose penultimate and last entries are…

Combinatorics · Mathematics 2025-02-11 Eon Lee , Carson Mitchell , Andrés R. Vindas-Meléndez

Let $K$ be a convex body in $\mathbb{R}^n$ with Santal\'o point at 0\. We show that if $K$ has a point on the boundary with positive generalized Gau{\ss} curvature, then the volume product $|K| |K^\circ|$ is not minimal. This means that a…

Functional Analysis · Mathematics 2010-09-21 Shlomo Reisner , Carsten Schütt , Elisabeth M. Werner

We study the volume entropy of a class of presentations (including the classical ones) for all surface groups, called \emph{minimal geometric presentations}. We rediscover a formula first obtained by Cannon and Wagreich with the computation…

Dynamical Systems · Mathematics 2014-07-08 Lluís Alsedà , David Juher , Jérôme Los , Francesc Mañosas

We consider a spherical antiprism. It is a convex polyhedron with $2n$ vertices in the spherical space $\mathbb{S}^3$. This polyhedron has a group of symmetries $S_{2n}$ generated by a mirror-rotational symmetry of order $2n$, i.e. rotation…

Metric Geometry · Mathematics 2021-10-26 Nikolay Abrosimov , Bao Vuong

Minkowski's second theorem on successive minima gives an upper bound on the volume of a convex body in terms of its successive minima. We study the problem to generalize Minkowski's bound by replacing the volume by the lattice point…

Metric Geometry · Mathematics 2010-11-09 Christian Bey , Martin Henk , Matthias Henze , Eva Linke

Let $d \geq 0$ be an integer and let $P \subset \mathbb R^d$ be a $d$-dimensional lattice polytope. We call a polytope $M \subset \mathbb R^d$ such that $M \subset P$ and $M \sim P$ a {\itshape miniature} of $P,$ and it is said to be…

Combinatorics · Mathematics 2026-05-21 Takashi Hirotsu

The new result of this paper connected with the following problem: Consider a supporting hyperplane of a regular simplex and its re ected image at this hyperplane. When will be the volume of the convex hull of these two simplices maximal?…

Metric Geometry · Mathematics 2018-11-30 Ákos G. Horváth

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

This is a tribute to my dear life-long friend, mentor and colleague Ted Swart. It includes anecdotal stories and memories of our times together, and also includes a new academic contribution in his honour, Teds polytope. Tweeks made to the…

Combinatorics · Mathematics 2023-05-10 Stephen Gismondi

It is proved that the simplex is a strict local minimum for the volume product, P(K)=min(vol(K) vol(K^z)), K^z is the polar body of K with respect to z, the minimum is taken over z in the interior of K, in the Banach-Mazur space of…

Metric Geometry · Mathematics 2014-01-14 Jaegil Kim , Shlomo Reisner

We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…

Mathematical Physics · Physics 2017-03-08 M. J. Hay , J. Schiff , N. J. Fisch

With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…

Optimization and Control · Mathematics 2024-07-02 Alberto Del Pia , Aida Khajavirad