Related papers: Subword complexes, cluster complexes, and generali…
We introduce $k$-robust clique complexes, a family of simplicial complexes that generalizes the traditional clique complex. Here, a subset of vertices forms a simplex provided it does not contain an independent set of size $k$. We…
We study the deformation theory of the Stanley-Reisner rings associated to cluster complexes for skew-symmetrizable cluster algebras of geometric and finite cluster type. In particular, we show that in the skew-symmetric case, these cluster…
With any non necessarily orientable unpunctured marked surface (S,M) we associate a commutative algebra, called quasi-cluster algebra, equipped with a distinguished set of generators, called quasi-cluster variables, in bijection with the…
It was recently shown by Gross, Hacking, and Keel that, in the absence of frozen indices, a cluster A-variety with generic coefficients is the universal torsor of the corresponding cluster X-variety with corresponding coefficients. We…
A notion of an $i$-banner simplicial complex is introduced. For various values of $i$, these complexes interpolate between the class of flag complexes and the class of all simplicial complexes. Examples of simplicial spheres of an arbitrary…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
We suggest a definition of cluster polylogarithms on an arbitrary cluster variety and classify them in type $A$. We find functional equations for multiple polylogarithms which generalize equations discovered by Abel, Kummer, and Goncharov…
Taking a representation-theoretic viewpoint, we construct a continuous associahedron motivated by the realization of the generalized associahedron in the physical setting. We show that our associahedron shares important properties with the…
Let (W,S) be a Coxeter system of finite rank (ie |S| is finite) and let A be the associated Coxeter (or Davis) complex. We study chains of pairwise parallel walls in A using Tits' bilinear form associated to the standard root system of…
Any finite simplicial complex K and a partition of the vertex set of K determines a canonical quotient space of the moment-angle complex of K. We prove that the cohomology groups of such a space can be computed via some Hochster's type…
The cluster category is a triangulated category introduced for its combinatorial similarities with cluster algebras. We prove that a cluster algebra A of finite type can be realized as a Hall algebra, called the exceptional Hall algebra, of…
Let $\mathcal{C}$ be a Hom-finite triangulated 2-Calabi-Yau category with a cluster tilting object. Under some constructibility assumptions on $\mathcal{C}$ which are satisfied for instance by cluster categories, by generalized cluster…
We introduce Coxeter-sortable elements of a Coxeter group W. For finite W, we give bijective proofs that Coxeter-sortable elements are equinumerous with clusters and with noncrossing partitions. We characterize Coxeter-sortable elements in…
We prove that any skew-symmetrizable cluster algebra is unistructural, which is a conjecture by Assem, Schiffler, and Shramchenko. As a corollary, we obtain that a cluster automorphism of a cluster algebra $\mathcal A(\mathcal S)$ is just…
Motivated by the theory of cluster algebras, F. Chapoton, S. Fomin and A. Zelevinsky associated to each finite type root system a simple convex polytope called \emph{generalized associahedron}. They provided an explicit realization of this…
We show that the quotient of the continuous cluster category $\mathcal C_\pi$ modulo the additive subcategory generated by any cluster is an abelian category and we show that it is isomorphic to the category of infinite length modules over…
Text clustering holds significant value across various domains due to its ability to identify patterns and group related information. Current approaches which rely heavily on a computed similarity measure between documents are often limited…
We develop and prove the analogs of some results shown in [Berenstein A., Fomin S., Zelevinsky A., Duke Math. J. 126 (2005), 1-52] concerning lower and upper bounds of cluster algebras to the generalized cluster algebras of geometric type.…
This paper presents a new clustering algorithm for symmetric positive semi-definite (SPSD) matrices, called K-Tensors. The method identifies structured subsets of the SPSD cone characterized by common principal component (CPC)…
Recently, Ramos and Whiting showed that any generalized cluster algebra of geometric type is isomorphic to a quotient of a subalgebra of a certain cluster algebra. Based on their idea and method, we show that the same property holds for any…