English
Related papers

Related papers: Every generating polytope is strongly monotypic

200 papers

A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…

Combinatorics · Mathematics 2008-07-02 Sven Herrmann , Michael Joswig

An integral polytope is a polytope whose vertices have integer coordinates. A unimodular triangulation of an integral polytope in $\mathbb{R}^d$ is a triangulation in which all simplices are integral with volume $1/d!$. A classic result of…

Combinatorics · Mathematics 2021-12-10 Gaku Liu

A log generic hypersurface in $\mathbb{P}^n$ with respect to a birational modification of $\mathbb{P}^n$ is by definition the image of a generic element of a high power of an ample linear series on the modification. A log very-generic…

Algebraic Geometry · Mathematics 2021-10-26 Nero Budur , Robin van der Veer

For a stationary Poisson hyperplane tessellation $X$ in ${\mathbb R}^d$, whose directional distribution satisfies some mild conditions (which hold in the isotropic case, for example), it was recently shown that with probability one every…

Probability · Mathematics 2018-04-17 Rolf Schneider

We prove a conjecture of Bahri, Bendersky, Cohen and Gitler: if K is a shifted simplicial complex on n vertices, X_1,..., X_n are spaces and CX_i is the cone on X_i, then the polyhedral product determined by K and the pairs (CX_i,X_i) is…

Algebraic Topology · Mathematics 2011-10-21 Jelena Grbic , Stephen Theriault

Wythoff's construction associates a uniform polytope to a Coxeter diagram whose vertices are decorated with crosses, which indicate the subgroup stabilizing a generic point. Champagne, Kjiri, Patera, and Sharp remarked that by associating…

Metric Geometry · Mathematics 2021-12-21 Spencer Whitehead

In this paper we prove a series of matching theorems for two sets of Coxeter generators of a finitely generated Coxeter group that identify common features of the two sets of generators. As an application, we describe an algorithm for…

Group Theory · Mathematics 2014-10-01 Michael Mihalik , John Ratcliffe , Steven Tschantz

Maniplexes are coloured graphs that generalise maps on surfaces and abstract polytopes. Each maniplex uniquely defines a partially ordered set that encodes information about its structure. When this poset is an abstract polytope, we say…

Combinatorics · Mathematics 2023-05-11 Dimitri Leemans , Micael Toledo

We give new proofs of three theorems of Stanley on generating functions for the integer points in rational cones. The first, Stanley's reciprocity theorem, relates the rational generating functions for the integer points in a cone K and for…

Combinatorics · Mathematics 2007-05-25 Matthias Beck , Frank Sottile

We introduce topological notions of polytopes and simplexes, the latter being expected to play in p-adically closed fields the role played by real simplexes in the classical results of triangulation of semi-algebraic sets over real closed…

Logic · Mathematics 2016-11-15 Luck Darnière

A split of a polytope is a (necessarily regular) subdivision with exactly two maximal cells. A polytope is totally splittable if each triangulation (without additional vertices) is a common refinement of splits. This paper establishes a…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann , Michael Joswig

Let X be a finite CW-complex of dimension q. If its fundamental group $\pi_{1}(X)$ is polycyclic of Hirsch number h>q we show that at least one of the homotopy groups $\pi_{i}(X)$ is not finitely generated. If h=q or h=q-1 the same…

Geometric Topology · Mathematics 2007-05-23 Mihai Damian

We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…

Combinatorics · Mathematics 2015-05-26 Egon Schulte , Gordon Ian Williams

A new approach to the construction of general persistent polyhierarchical classifications is proposed. It is based on implicit description of category polyhierarchy by a generating polyhierarchy of classification criteria. Similarly to…

Artificial Intelligence · Computer Science 2007-05-23 Pavel Babikov , Oleg Gontcharov , Maria Babikova

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

Cook and Reckhow 1979 pointed out that NP is not closed under complementation iff there is no propositional proof system that admits polynomial size proofs of all tautologies. Theory of proof complexity generators aims at constructing sets…

Computational Complexity · Computer Science 2024-06-12 Jan Krajicek

We prove that any generating tuple of the fundamental group of a sufficiently large 2-dimensional orbifold is represented by an almost orbifold covering. As a corollary we obtain a generalization of Louder's Theorem which asserts that any…

Group Theory · Mathematics 2020-04-21 Ederson R. F. Dutra

We give effective bounds on the generation of pushforwards of log-pluricanonical bundles twisted by ample line bundles. This gives a partial answer to a conjecture proposed by Popa and Schnell. We prove two types of statements: first, more…

Algebraic Geometry · Mathematics 2018-10-30 Yajnaseni Dutta

We show that finitely generated cohomology is invariant under separable equivalences for all algebras. As a result, we obtain a proof of the finite generation of cohomology for finite symmetric tensor categories in characteristic zero, as…

Representation Theory · Mathematics 2021-09-23 Petter Andreas Bergh

We prove that any finite, abstract n-polytope is covered by a finite, abstract regular n-polytope.

Combinatorics · Mathematics 2012-09-07 B. Monson , Egon Schulte