相关论文: The poset associahedron $f$-vector is a comparabil…

The purpose of this paper is to study stable representations of partially ordered sets (posets) and compare it to the well known theory for quivers. In particular, we prove that every indecomposable representation of a poset of finite type…

We show that the mesh mutations are the minimal relations among the $\boldsymbol{g}$-vectors with respect to any initial seed in any finite type cluster algebra. We then use this algebraic result to derive geometric properties of the…

For any marked poset we define a continuous family of polytopes, parametrized by a hypercube, generalizing the notions of marked order and marked chain polytopes. By providing transfer maps, we show that the vertices of the hypercube…

A Gelfand-Cetlin polytope is a convex polytope obtained as an image of certain completely integrable system on a partial flag variety. In this paper, we give an equivalent description of the face structure of a GC-polytope in terms of so…

Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…

We consider unimodality and related properties of f-vectors of polytopes in various dimensions. By a result of Kalai (1988), f-vectors of 5-polytopes are unimodal. In higher dimensions much less can be said; we give an overview on current…

A finite poset X carries a natural structure of a topological space. Fix a field k, and denote by D(X) the bounded derived category of sheaves of finite dimensional k-vector spaces over X. Two posets X and Y are said to be derived…

This paper introduces a new method to solve the problem of the approximation of the diagonal for face-coherent families of polytopes. We recover the classical cases of the simplices and the cubes and we solve it for the associahedra, also…

In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…

We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or,…

We describe many different realizations with integer coordinates for the associahedron (i.e. the Stasheff polytope) and for the cyclohedron (i.e. the Bott-Taubes polytope) and compare them to the permutahedron of type A_n and B_n…

We show that for two quivers without oriented cycles related by a BGP reflection, the posets of their cluster tilting objects are related by a simple combinatorial construction, which we call a flip-flop. We deduce that the posets of…

We show that the presentation of affine $\mathbb{T}$-varieties of complexity one in terms of polyhedral divisors holds over an arbitrary field. We also describe a class of multigraded algebras over Dedekind domains. We study how the algebra…

We construct a 2-parameter family of 4-dimensional polytopes with extreme combinatorial structure: In this family, the ``fatness'' of the f-vector gets arbitrarily close to 9, the ``complexity'' (given by the flag vector) gets arbitrarily…

Let $A$ be an Artin algebra and $F$ a non-zero subfunctor of $\Ext_A^{1}(-,-)$. In this paper, we characterize the relative $\phi$-dimension of $A$ by the bi-functor $\Ext_F^1(-,-)$. Furthermore, we show that the finiteness of relative…

We show that there are $f$-vectors of balanced simplicial complexes giving a source of simplicial complexes exhibiting a Boolean decomposition similar to a geometric Lefschetz decomposition. The objects we are working with are $h$-vectors…

In this article we study adjoint hypersurfaces of geometric objects obtained by intersecting simple polytopes with few facets in $\mathbb{P}^5$ with the Grassmannian $\mathrm{Gr}(2,4)$. These generalize the positive Grassmannian, which is…

The goal of this paper is to show that valuation theory and Hopf theory are compatible on the class of generalized permutahedra. We prove that the Hopf structure $\mathbf{GP}^+$ on these polyhedra descends, modulo the inclusion-exclusion…

An elimination tree of a connected graph $G$ is a rooted tree on the vertices of $G$ obtained by choosing a root $v$ and recursing on the connected components of $G-v$ to obtain the subtrees of $v$. The graph associahedron of $G$ is a…

We construct some example of a closed nondegenerate nonflexible polyhedron $P$ in Euclidean 3-space that is the limit of a sequence of nondegenerate flexible polyhedra each of which is combinatorially equivalent to $P$. This implies that…