English
Related papers

Related papers: Painted Tropical Complexes

200 papers

The secondary polytope of a point configuration A is a polytope whose face poset is isomorphic to the poset of all regular subdivisions of A. While the vertices of the secondary polytope - corresponding to the triangulations of A - are very…

Combinatorics · Mathematics 2014-12-23 Sven Herrmann

We exhibit several posets arising from commutative algebra, order theory, tropical convexity as potential face posets of tropical polyhedra, and we clarify their inclusion relations. We focus on monomial tropical polyhedra, and deduce how…

Combinatorics · Mathematics 2022-08-11 Georg Loho , Ben Smith

We study nested complexes of building sets on the Las Vergnas face lattices of oriented matroids. Such a nested complex is the face lattice of an oriented matroid, obtained by iterated stellar subdivisions of the positive tope. If the…

Combinatorics · Mathematics 2025-09-22 Chiara Mantovani , Arnau Padrol , Vincent Pilaud

Tropical polytopes are images of polytopes in an affine space over the Puiseux series field under the degree map. This viewpoint gives rise to a family of cellular resolutions of monomial ideals which generalize the hull complex of Bayer…

Combinatorics · Mathematics 2012-02-13 Mike Develin , Josephine Yu

For each poset $P$, we construct a polytope $A(P)$ called the $P$-associahedron. Similarly to the case of graph associahedra, the faces of $A(P)$ correspond to certain nested collections of subsets of $P$. The Stasheff associahedron is a…

Combinatorics · Mathematics 2023-11-09 Pavel Galashin

We introduce the notion of a coloring of a poset, which consists of a labeling of the edges in its Hasse diagram by elements in a given group $G$. We use $G$-colorings to describe the covering maps of posets and present a new method based…

Algebraic Topology · Mathematics 2014-12-17 Jonathan Ariel Barmak , Elias Gabriel Minian

It is known that any tropical polytope is the image under the valuation map of ordinary polytopes over the Puiseux series field. The latter polytopes are called lifts of the tropical polytope. We prove that any pure tropical polytope is the…

Combinatorics · Mathematics 2015-12-24 Xavier Allamigeon , Ricardo D. Katz

We develop a tighter implementation of basic PL topology, which keeps track of some combinatorial structure beyond PL homeomorphism type. With this technique we clarify some aspects of PL transversality and give combinatorial proofs of a…

Geometric Topology · Mathematics 2018-08-31 Sergey A. Melikhov

The bottom complex of a finite polyhedal pointed rational cone is the lattice polytopal complex of the compact faces of the convex hull of nonzero lattice points in the cone. The algebra, associated to the bottom complex of a cone, defines…

Commutative Algebra · Mathematics 2022-06-09 Joseph Gubeladze

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

Given a graph G, we construct a simple, convex polytope whose face poset is based on the connected subgraphs of G. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that…

Quantum Algebra · Mathematics 2007-05-23 Michael Carr , Satyan L. Devadoss

Given any connected poset $P$, we give a simple realization of Galashin's poset associahedron $\mathscr{A}(P)$ as a convex polytope in $\mathbb{R}^P.$ The realization is inspired by the description of $\mathscr{A}(P)$ as a compactification…

Combinatorics · Mathematics 2023-03-17 Andrew Sack

Given an $n$-gon, the poset of all collections of pairwise non-crossing diagonals is isomorphic to the face poset of some convex polytope called \textit{associahedron}. We replace in this setting the $n$-gon (viewed as a disc with $n$…

Geometric Topology · Mathematics 2018-11-14 Joseph Gordon , Gaiane Panina

A classic problem connecting algebraic and geometric combinatorics is the realization problem: given a poset, determine whether there exists a polytope whose face lattice is the poset. In 1990s, Kapranov defined a poset as a hybrid between…

Combinatorics · Mathematics 2023-02-17 Federico Castillo , Fu Liu

The algebraic foundation of tropical polynomial algebra provides the framework for the geometric construction of the supplement and the reversal of tropical varieties, thereby inducing a duality of reduced tropical varieties; for classes of…

Algebraic Geometry · Mathematics 2008-11-04 Zur Izhakian , Louis Rowen

We develop a combinatorial framework to study certain polyhedral maps which are higher-dimensional analogues of tropical covers between metric graphs. Under a mild combinatorial assumption, we show that a map satisfies the so-called…

Combinatorics · Mathematics 2023-05-08 Alejandro Vargas

Given an abstract polytope $\cal P$, its flag graph is the edge-coloured graph whose vertices are the flags of $\cal P$ and the $i$-edges correspond to $i$-adjacent flags. Flag graphs of polytopes are maniplexes. On the other hand, given a…

Combinatorics · Mathematics 2016-04-06 Jorge Garza-Vargas , Isabel Hubard

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

Motivated by the graph associahedron KG, a polytope whose face poset is based on connected subgraphs of G, we consider the notion of associativity and tubes on posets. This leads to a new family of simple convex polytopes obtained by…

Combinatorics · Mathematics 2015-06-16 Satyan L. Devadoss , Stefan Forcey , Stephen Reisdorf , Patrick Showers

A pebble tree is an ordered tree where each node receives some colored pebbles, in such a way that each unary node receives at least one pebble, and each subtree has either one more or as many leaves as pebbles of each color. We show that…

Combinatorics · Mathematics 2025-12-12 Vincent Pilaud
‹ Prev 1 2 3 10 Next ›