Related papers: Subword complexes and 2-truncated cubes
A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
Let $k$ be a field and $A$ a finite-dimensional $k$-algebra of global dimension $\leq 2$. We construct a triangulated category $\Cc_A$ associated to $A$ which, if $A$ is hereditary, is triangle equivalent to the cluster category of $A$.…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
We consider, for complete bipartite graphs, the convex hulls of characteristic vectors of all matchings, extended by a binary entry indicating whether the matching contains two specific edges. These polytopes are associated to the quadratic…
Let $G$ be a simply connected simple algebraic group over $\mathbb{C}$, $B$ and $B_-$ be its two opposite Borel subgroups. For two elements $u$, $v$ of the Weyl group $W$, it is known that the coordinate ring ${\mathbb C}[G^{u,v}]$ of the…
We investigate the combinatorics and geometry of permutation polytopes associated to cyclic permutation groups, i.e., the convex hulls of cyclic groups of permutation matrices. We give formulas for their dimension and vertex degree. In the…
We study the diameter of the graph $G(w)$ of reduced words of an element $w$ in a Coxeter group $W$ whose edges correspond to applications of the Coxeter relations. We resolve conjectures of Reiner--Roichman and Dahlberg--Kim by proving a…
We provide geometric methods and algorithms to verify, construct and enumerate pairs of words (of specified length over a fixed $m$-letter alphabet) that form identities in the semigroup $\ut{n}$ of $n\times n$ upper triangular tropical…
Abstract polytopes generalize the classical notion of convex polytopes to more general combinatorial structures. The most studied ones are regular and chiral polytopes, as it is well-known, they can be constructed as coset geometries from…
Wirtinger presentations of deficiency 1 appear in the context of knots, long virtual knots, and ribbon 2-knots. They are encoded by (word) labeled oriented trees and, for that reason, are also called LOT presentations. These presentations…
We show that for certain class of oligomorphic groups there is a version of multiplication of double cosets in the Ismagilov--Olshanski sense. Categories of (reduced) double cosets are realized as certain categories of partial bijections.…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…
Abstract polytopes are combinatorial structures with distinctive geometric, algebraic, or topological characteristics, that generalize (the face lattice of) traditional polyhedra, polytopes or tessellations. Most research has focused on…
We propose a method to compute complex volume of 2-bridge link complements. Our construction sheds light on a relationship between cluster variables with coefficients and canonical decompositions of link complements.
Complex reflection groups of rank two are precisely the finite groups in the family of groups that we call J-reflection groups. These groups are particular cases of J-groups as defined by Achar & Aubert in 2008. The family of J-reflection…
We establish basic properties of cluster algebras associated with oriented bordered surfaces with marked points. In particular, we show that the underlying cluster complex of such a cluster algebra does not depend on the choice of…
Given a finite dimensional algebra $C$ (over an algebraically closed field) of global dimension at most two, we define its relation-extension algebra to be the trivial extension $C\ltimes \Ext_C^2(DC,C)$ of $C$ by the $C$-$C$-bimodule…
We obtain a multiplication formula for cluster characters on (stably) 2-Calabi-Yau (Frobenius or) triangulated categories. This formula generalizes those known for arbitrary pairs of objects and for Auslander-Reiten triangles. As an…
This paper introduces an inductively defined tree notation for all the faces of polytopes arising from a simplex by truncations. This notation allows us to view inclusion of faces as the process of contracting tree edges. Our notation…