Related papers: Combinatorial cluster expansion formulas from tria…

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…

In this paper, we utilize the machinery of cluster algebras, quiver mutations, and brane tilings to study a variety of historical enumerative combinatorics questions all under one roof. Previous work [Zha, LMNT14], which arose during the…

We demonstrate that a numerical linked cluster expansion method is a powerful tool to calculate quantum dynamics. We calculate the dynamics of the magnetization and spin correlations in the two-dimensional transverse field Ising and XXZ…

Convex clustering is a well-regarded clustering method, resembling the similar centroid-based approach of Lloyd's $k$-means, without requiring a predefined cluster count. It starts with each data point as its centroid and iteratively merges…

We study the cluster automorphism group of a skew-symmetric cluster algebra with geometric coefficients. For this, we introduce the notion of gluing free cluster algebra, and show that under a weak condition the cluster automorphism group…

In this paper, we simplify and generalize formulas for the expansion of rank 2 cluster variables. In particular, we prove an equivalent, but simpler, description of the colored Dyck subpaths framework introduced by Lee and Schiffler. We…

Spectral clustering has become one of the most widely used clustering techniques when the structure of the individual clusters is non-convex or highly anisotropic. Yet, despite its immense popularity, there exists fairly little theory about…

We generalize the perfectly clustering words of Simpson and Puglisi and relate them to band bricks over certain gentle algebras. This allows us to prove a generalization of a conjecture by the second author on perfectly clustering words.

The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type…

We analyze the clustering problem through a flexible probabilistic model that aims to identify an optimal partition on the sample X 1 , ..., X n. We perform exact clustering with high probability using a convex semidefinite estimator that…

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…

The paper concerns perfect diassociative algebras and their implications to the theory of central extensions. It is first established that perfect diassociative algebras have strong ties with universal central extensions. Then, using a…

We compute the number of $\mathcal{X}$-variables (also called coefficients) of a cluster algebra of finite type when the underlying semifield is the universal semifield. For classical types, these numbers arise from a bijection between…

In this work, we propose a new clustering algorithm to group nodes in networks based on second-order simplices (aka filled triangles) to leverage higher-order network interactions. We define a simplicial conductance function, which on…

We study Newton polytopes of cluster variables in type A_n cluster algebras, whose cluster and coefficient variables are indexed by the diagonals and boundary segments of a polygon. Our main results include an explicit description of the…

We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a…

In a categorification of skew-symmetric cluster algebras, each cluster variable corresponds with an indecomposable module over the associated Jacobian algebra. Buan, Marsh and Reiten studied when the denominator vector of each cluster…

We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…

This paper proposes a new algorithm for simultaneous graph matching and clustering. For the first time in the literature, these two problems are solved jointly and synergetically without relying on any training data, which brings advantages…

In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…