English
Related papers

Related papers: Inscribable stacked polytopes

200 papers

The complete sets of irreducible triangulations are known for the orientable surfaces with genus of 0, 1, or 2 and for the nonorientable surfaces with genus of 1, 2, 3, or 4. By examining these sets we determine some of the properties of…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke

The triangulations of point configurations which decompose as a free sum are classified in terms of the triangulations of the summands. The methods employ two new kinds of partially ordered sets to be associated with any triangulation of a…

Combinatorics · Mathematics 2018-10-30 Benjamin Assarf , Michael Joswig , Julian Pfeifle

Three types of geometric structure---grid triangulations, rectangular subdivisions, and orthogonal polyhedra---can each be described combinatorially by a regular labeling: an assignment of colors and orientations to the edges of an…

Computational Geometry · Computer Science 2010-07-02 David Eppstein

In this paper, we study the connected blocks polytope, which, apart from its own merits, can be seen as the generalization of certain connectivity based or Eulerian subgraph polytopes. We provide a complete facet description of this…

Combinatorics · Mathematics 2025-06-05 Justus Bruckamp , Markus Chimani , Martina Juhnke

We describe in the space of binary forms of degree d the strata of forms having constant rank. We also give a simple algorithm to determine the rank of a given form.

Algebraic Geometry · Mathematics 2011-07-12 Gonzalo Comas , Malena Seiguer

We construct continuous Frobenius categories of type $D$. The stable categories of these Frobenius categories are cluster categories which contain the standard cluster categories of type $D_n$. When $n=\infty$, maximal compatible sets of…

Representation Theory · Mathematics 2013-10-01 Kiyoshi Igusa , Gordana Todorov

Blind and Mani, and later Kalai, showed that the face lattice of a simple polytope is determined by its graph, namely its $1$-skeleton. Call a vertex of a $d$-polytope \emph{nonsimple} if the number of edges incident to it is more than $d$.…

Combinatorics · Mathematics 2018-03-16 Joseph Doolittle , Eran Nevo , Guillermo Pineda-Villavicencio , Julien Ugon , David Yost

We consider causal 3-dimensional triangulations with the topology of $S^2\times [0,1]$ or $D^2\times [0,1]$ where $S^2$ and $D^2$ are the two-dimensional sphere and disc, respectively. These triangulations consist of slices and we show that…

Mathematical Physics · Physics 2021-01-29 Bergfinnur Durhuus , Thordur Jonsson

We introduce the notion of a combinatorial $n$-od cover, for $n \geq 3$, which is a tool that may be used to show that certain continua embedded in the plane are not simple $n$-od-like. Using this tool, we generalize a classic example of…

General Topology · Mathematics 2025-06-16 Logan C. Hoehn , Hugo Adrian Maldonado-Garcia

The incomplete tribonacci polynomials, denoted by T_n^{(s)}(x), generalize the usual tribonacci polynomials T_n(x) and were introduced in [10], where several algebraic identities were shown. In this paper, we provide a combinatorial…

Combinatorics · Mathematics 2014-06-12 Mark Shattuck

Close-binary central stars of planetary nebulae offer a unique tool with which to study the critical and yet poorly understood common-envelope phase of binary stellar evolution. Furthermore, as the nebula itself is thought to comprise the…

Solar and Stellar Astrophysics · Physics 2024-12-13 David Jones

We present a self-contained short proof of the seminal result of Dillencourt (SoCG 1987 and DCG 1990) that Delaunay triangulations, of planar point sets in general position, are 1-tough. An important implication of this result is that…

Computational Geometry · Computer Science 2019-10-11 Ahmad Biniaz

We classify finite-dimensional Nichols algebras of Yetter-Drinfeld modules with indecomposable support over finite solvable groups in characteristic 0, using a variety of methods including reduction to positive characteristic. As a…

Quantum Algebra · Mathematics 2024-11-05 N. Andruskiewitsch , I. Heckenberger , L. Vendramin

All varieties, extremal contractions, singularities are divided on exceptional and non-exceptional ones. Roughly speaking, there are the infinite families of non-exceptional varieties, extremal contractions or singularities and only the…

Algebraic Geometry · Mathematics 2015-06-26 S. A. Kudryavtsev

We prove two results on stacked triangulated manifolds in this paper: (a) every stacked triangulation of a connected manifold with or without boundary is obtained from a simplex or the boundary of a simplex by certain combinatorial…

Geometric Topology · Mathematics 2016-06-16 Basudeb Datta , Satoshi Murai

We realize several combinatorial Hopf algebras based on set compositions, plane trees and segmented compositions in terms of noncommutative polynomials in infinitely many variables. For each of them, we describe a trialgebra structure, an…

Combinatorics · Mathematics 2007-05-23 J. -C. Novelli , J. -Y. Thibon

We consider ``hyperideal'' circle patterns, i.e. patterns of disks appearing in the definition of the Delaunay decomposition associated to a set of disjoint disks, possibly with cone singularities at the center of those disks. Hyperideal…

Differential Geometry · Mathematics 2009-01-20 Jean-Marc Schlenker

We classify the thick subcategories of an algebraic triangulated standard category with finitely many indecomposable objects.

Category Theory · Mathematics 2010-10-04 Claudia Köhler

Using the theory infinity-categories we construct derived (dg-)categories of regular, holonomic D-modules and algebraically constructible sheaves on a complex smooth algebraic stack. We construct a natural infinity-categorical equivalence…

Algebraic Geometry · Mathematics 2013-08-28 Alexander Paulin

The symmetry classification method is applied to the string-like scalar fields in two-dimensional space-time. When the configurational space is three-dimensional and reducible we present the complete list of the systems admiting higher…

solv-int · Physics 2007-05-23 D. K. Demskoy , A. G. Meshkov