English
Related papers

Related papers: S-hypersimplices, pulling triangulations, and mono…

200 papers

Facets of the convex hull of $n$ independent random vectors chosen uniformly at random from the unit sphere in $\mathbb{R}^d$ are studied. A particular focus is given on the height of the facets as well as the expected number of facets as…

Probability · Mathematics 2019-08-13 Gilles Bonnet , Eliza O'Reilly

We study the natural extended-variable formulation for the disjunction of $n+1$ polytopes in $\mathbb{R}^d$. We demonstrate that the convex hull $D$ in the natural extended-variable space $\mathbb{R}^{d+n}$ is given by full optimal big-M…

Optimization and Control · Mathematics 2024-11-01 Yushan Qu , Jon Lee

This paper contains a classication of the regular minimal abstract polytopes that act as covers for the convex polyhedral prisms and antiprisms. It includes a detailed discussion of their topological structure, and completes the enumeration…

Combinatorics · Mathematics 2012-06-28 Michael I. Hartley , Daniel Pellicer , Gordon Williams

We consider the multilinear polytope defined as the convex hull of the set of binary points satisfying a collection of multilinear equations. The complexity of the facial structure of the multilinear polytope is closely related to the…

Combinatorics · Mathematics 2023-08-30 Alberto Del Pia , Aida Khajavirad

The regular polyhedra have the highest order of 3D symmetries and are exceptionally at- tractive templates for (self)-assembly using minimal types of building blocks, from nano-cages and virus capsids to large scale constructions like glass…

Computational Geometry · Computer Science 2015-07-31 Muhibur Rasheed , Chandrajit Bajaj

We compute some numerical invariants of the lines on hyperplane sections of a smooth cubic threefold over complex numbers. We also prove that for any smooth hypersurface $X\subset \mathbb P^{n+1}$ of degree $d$ over an algebraically closed…

Algebraic Geometry · Mathematics 2020-07-08 Yiran Cheng

A simplicial polytope is a polytope with all its facets being combinatorially equivalent to simplices. We deal with the edge connectivity of the graphs of simplicial polytopes. We first establish that, for any $d\ge 3$, for any $d\ge 3$,…

Combinatorics · Mathematics 2023-03-07 Guillermo Pineda-Villavicencio , Julien Ugon

Given a tree $T$, its path polytope is the convex hull of the edge indicator vectors for the paths between any two distinct leaves in $T$. These polytopes arise naturally in polyhedral geometry and applications, such as phylogenetics,…

Combinatorics · Mathematics 2025-03-03 Amer Goel , Aida Maraj , Alvaro Ribot

We wish to draw attention to an interesting and promising interaction of two theories. On the one hand, it is the theory of \textbf{pseudo-triangulations} which was useful for implicit solution of thecarpenter's rule problem and proved…

Metric Geometry · Mathematics 2007-05-23 Gaiane Panina

In this paper we present an explicit combinatorial description of a special class of facets of the secondary polytopes of hypersimplices. These facets correspond to polytopal subdivisions called multi-splits. We show a relation between the…

Combinatorics · Mathematics 2019-10-10 Benjamin Schröter

There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…

Probability · Mathematics 2019-05-02 Andrew Newman

Let T be the unit circle in the complex plane C. This paper proves the existence of analytic structure in a compact subset K of T X C^n, where K has so-called "lineally convex" or "hypoconvex" fibers over T. It also addresses a related…

Complex Variables · Mathematics 2007-05-23 Marshall A. Whittlesey

In this article we study the following question: What can be the measure of the minimal solid angle of a simplex in $\mathbb{R}^d$? We show that in dimensions three it is not greater than the solid angle of the regular simplex. And in…

Metric Geometry · Mathematics 2016-04-07 Arseniy Akopyan , Roman Karasev

Marginal polytopes are important geometric objects that arise in statistics as the polytopes underlying hierarchical log-linear models. These polytopes can be used to answer geometric questions about these models, such as determining the…

Combinatorics · Mathematics 2023-12-06 Jane Ivy Coons , Joseph Cummings , Benjamin Hollering , Aida Maraj

This paper studies the straight skeleton of polyhedra in three dimensions. We first address voxel-based polyhedra (polycubes), formed as the union of a collection of cubical (axis-aligned) voxels. We analyze the ways in which the skeleton…

Computational Geometry · Computer Science 2008-05-02 Gill Barequet , David Eppstein , Michael T. Goodrich , Amir Vaxman

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…

Combinatorics · Mathematics 2010-12-13 Roland Bacher , Frédéric Mouton

We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…

Probability · Mathematics 2021-01-01 Zakhar Kabluchko , Hauke Seidel

Cycloids, hipocycloids and epicycloids have an often forgotten common property: they are homothetic to their evolutes. But what if use convex symmetric polygons as unit balls, can we define evolutes and cycloids which are genuinely…

Differential Geometry · Mathematics 2017-02-08 Marcos Craizer , Ralph Teixeira , Vitor Balestro

We investigate the convex hulls of the eight dihedral symmetry classes of $n \times n$ alternating sign matrices, i.e., ASMs invariant under a subgroup of the symmetry group of the square. Extending the prefix-sum description of the ASM…

Combinatorics · Mathematics 2026-02-23 Péter Madarasi

For any finite set $\A$ of $n$ points in $\R^2$, we define a $(3n-3)$-dimensional simple polyhedron whose face poset is isomorphic to the poset of ``non-crossing marked graphs'' with vertex set $\A$, where a marked graph is defined as a…

Combinatorics · Mathematics 2007-05-23 David Orden , Francisco Santos