English
Related papers

Related papers: Which nestohedra are removahedra?

200 papers

We determine (non-necessarily convex) polyhedra having simple dense geodesics.

Metric Geometry · Mathematics 2018-02-14 Jin-Ichi Itoh , Joël Rouyer , Costin Vîlcu

We construct a sequence of convex polyhedra on n vertices with the property that, as n -> infinity, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does…

Computational Geometry · Computer Science 2008-01-28 Alex Benton , Joseph O'Rourke

A Kokotsakis polyhedron with quadrangular base is a neighborhood of a quadrilateral in a quad surface. Generically, a Kokotsakis polyhedron is rigid. Up to now, several flexible classes were known, but a complete classification was missing.…

Metric Geometry · Mathematics 2014-11-04 Ivan Izmestiev

We present a short proof of S. Parsa's theorem that there exists a compact $n$-polyhedron $P$, $n\ge 2$, non-embeddable in $\mathbb R^{2n}$, such that $P*P$ embeds in $\mathbb R^{4n+2}$. This proof can serve as a showcase for the use of…

Geometric Topology · Mathematics 2022-10-11 Sergey A. Melikhov

We prove that, for any two polyhedral manifolds $\mathcal P,\mathcal Q$, there is a polyhedral manifold $\mathcal I$ such that $\mathcal P,\mathcal I$ share a common unfolding and $\mathcal I,\mathcal Q$ share a common unfolding. In other…

Computational Geometry · Computer Science 2025-11-18 Lily Chung , Erik D. Demaine , Jenny Diomidova , Tonan Kamata , Jayson Lynch , Ryuhei Uehara , Hanyu Alice Zhang

Graph associahedra are generalized permutohedra arising as special cases of nestohedra and hypergraphic polytopes. The graph associahedron of a graph $G$ encodes the combinatorics of search trees on $G$, defined recursively by a root $r$…

Combinatorics · Mathematics 2022-11-30 Jean Cardinal , Lionel Pournin , Mario Valencia-Pabon

Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…

Combinatorics · Mathematics 2019-07-05 Lisa Berry , Stefan Forcey , Maria Ronco , Patrick Showers

An unzipping of a polyhedron P is a cut-path through its vertices that unfolds P to a non-overlapping shape in the plane. It is an open problem to decide if every convex P has an unzipping. Here we show that there are nearly flat convex…

Computational Geometry · Computer Science 2018-02-07 Joseph O'Rourke

Given any finite set of nonnegative integers, there exists a closed convex set whose facial dimension signature coincides with this set of integers, that is, the dimensions of its nonempty faces comprise exactly this set of integers. In…

Optimization and Control · Mathematics 2024-08-26 Vera Roshchina , Levent Tunçel

The purpose of this paper is to investigate order of contact on real hypersurfaces in ${\mathbb C}^n$ by using Newton polyhedra which are important notion in the study of singularity theory. To be more precise, an equivalence condition for…

Complex Variables · Mathematics 2022-05-11 Joe Kamimoto

We utilize the coherent-constructible correspondence to construct full strongly exceptional collections of nef line bundles in the derived category of a toric variety through the combinatorics of constructible sheaves built from polytopes.…

Algebraic Geometry · Mathematics 2023-11-08 Mario Sanchez

For a generalized permutohedron $Q$ the enumerator $F(Q)$ of positive lattice points in interiors of maximal cones of the normal fan $\Sigma_Q$ is a quasisymmetric function. We describe this function for the class of nestohedra as a Hopf…

Combinatorics · Mathematics 2017-05-18 Vladimir Grujić

A polyiamond is a polygon composed of unit equilateral triangles, and a generalized deltahedron is a convex polyhedron whose every face is a convex polyiamond. We study a variant where one face may be an exception. For a convex polygon P,…

We propose a simple formula for the coordinates of the vertices of the Stasheff polytope (associahedron) and we compare it to the permutohedron.

Algebraic Topology · Mathematics 2007-05-23 Jean-Louis Loday

We define a new class of orthogonal polyhedra, called orthogrids, that can be unfolded without overlap with constant refinement of the gridded surface.

Computational Geometry · Computer Science 2013-10-18 Mirela Damian , Erik Demaine , Robin Flatland

It is known that polytopes with at most two nonsimple vertices are reconstructible from their graphs, and that $d$-polytopes with at most $d-2$ nonsimple vertices are reconstructible from their 2-skeletons. Here we close the gap between 2…

Combinatorics · Mathematics 2018-11-28 Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

In 1956, Tutte showed that every planar 4-connected graph is hamiltonian. In this article, we will generalize this result and prove that polyhedra with at most three 3-cuts are hamiltonian. In 2002 Jackson and Yu have shown this result for…

Combinatorics · Mathematics 2018-06-05 Gunnar Brinkmann , Carol T. Zamfirescu

Cyclohedra are a well-known infinite familiy of finite-dimensional polytopes that can be constructed from centrally symmetric triangulations of even-sided polygons. In this article we introduce an infinite-dimensional analogue and prove…

Group Theory · Mathematics 2014-11-14 Ariadna Fossas Tenas , Jon McCammond

For any $r\geq 1$ and $\mathbf{n} \in \mathbb{Z}_{\geq0}^r \setminus \{\mathbf0\}$ we construct a poset $W_{\mathbf{n}}$ called a 2-associahedron. The 2-associahedra arose in symplectic geometry, where they are expected to control maps…

Symplectic Geometry · Mathematics 2019-03-20 Nathaniel Bottman

Presheaves and nominal sets provide alternative abstract models of sets of syntactic objects with free and bound variables, such as lambda-terms. One distinguishing feature of the presheaf-based perspective is its elegant syntax-free…

Logic in Computer Science · Computer Science 2026-02-13 Fabian Lenke , Stefan Milius , Henning Urbat
‹ Prev 1 8 9 10 Next ›