Related papers: Newton polytopes of rank 3 cluster variables
The amoeba of a Laurent polynomial $f \in \C[z_1^{\pm 1},\ldots,z_n^{\pm 1}]$ is the image of its zero set $\mathcal{V}(f)$ under the log-absolute-value map. Understanding the space of amoebas (i.e., the decomposition of the space of all…
We introduce a class of commutative superalgebras generalizing cluster algebras. A cluster superalgebra is defined by a hypergraph called an "extended quiver", and transformations called mutations. We prove the super analog of the "Laurent…
We give compact extended formulations for the packing and partitioning orbitopes (with respect to the full symmetric group) described and analyzed in (Kaibel and Pfetsch, 2008). These polytopes are the convex hulls of all 0/1-matrices with…
We study the symmetrised rank-one convex hull of monoclinic-I martensite (a twelve-variant material) in the context of geometrically-linear elasticity. We construct sets of T3s, which are (non-trivial) symmetrised rank-one convex hulls of…
This is an introductory survey on cluster algebras and their (additive) categorification using derived categories of Ginzburg algebras. After a gentle introduction to cluster combinatorics, we review important examples of coordinate rings…
Given $n$ symmetric Bernoulli variables, what can be said about their correlation matrix viewed as a vector? We show that the set of those vectors $R(\mathcal{B}_n)$ is a polytope and identify its vertices. Those extreme points correspond…
For a given cluster-tilted algebra $A$ of tame type, it is proved that different indecomposable $\tau$-rigid $A$-modules have different dimension vectors. This is motivated by Fomin-Zelevinsky's denominator conjecture for cluster algebras.…
Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…
For a rooted cluster algebra $\mathcal{A}(Q)$ over a valued quiver $Q$, a \emph{symmetric cluster variable} is any cluster variable belonging to a cluster associated with a quiver $\sigma (Q)$, for some permutation $\sigma$. The subalgebra…
We describe a framework for encoding cluster combinatorics using categorical methods. We give a definition of an abstract cluster structure, which captures the essence of cluster mutation at a tropical level and show that cluster algebras,…
A basic combinatorial invariant of a convex polytope $P$ is its $f$-vector $f(P)=(f_0,f_1,\dots,f_{\dim P-1})$, where $f_i$ is the number of $i$-dimensional faces of $P$. Steinitz characterized all possible $f$-vectors of $3$-polytopes and…
The Birkhoff polytope $B_n$ is the convex hull of all $n\times n$ permutation matrices in $\mathbb{R}^{n\times n}$. We compute the combinatorial symmetry group of the Birkhoff polytope. A representation polytope is the convex hull of some…
In 2003, Fomin and Zelevinsky obtained Cartan-Killing type classification of all cluster algebras of finite type, i.e. cluster algebras having only finitely many distinct cluster variables. A wider class of cluster algebras is formed by…
The invariants of finite-dimensional representations of simple Lie algebras, such as even-degree indices and anomaly numbers, are considered in the context of the non-crystallographic finite reflection groups $H_2$, $H_3$ and $H_4$. Using a…
We study cluster algebras arising from cluster tubes. We obtain categorical interpretations for $g$-vectors, $c$-vectors and denominator vectors for cluster algebras of type $\mathrm{C}$ with respect to arbitrary initial seeds. In…
A celebrated theorem of Balas gives a linear mixed-integer formulation for the union of two nonempty polytopes whose relaxation gives the convex hull of this union. The number of inequalities in Balas formulation is linear in the number of…
Let $Q$ be any invertible valued quiver without oriented cycles. We study connections between the category of valued representations of $Q$ and expansions of cluster variables in terms of the initial cluster in quantum cluster algebras. We…
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…
We consider the bipartite boolean quadric polytope (BQP) with multiple-choice constraints and analyse its combinatorial properties. The well-studied BQP is defined as the convex hull of all quadric incidence vectors over a bipartite graph.…
Recent articles have shown the connection between representation theory of quivers and the theory of cluster algebras. In this article, we prove that some cluster algebras of type ADE can be recovered from the data of the corresponding…