相关论文: Cluster algebras and binary subwords

Snake graphs are a class of planar graphs that are important in the theory of cluster algebras. Indeed, the Laurent expansions of the cluster variables in cluster algebras from surfaces are given as weight generating functions for 1-dimer…

Spectral clustering views the similarity matrix as a weighted graph, and partitions the data by minimizing a graph-cut loss. Since it minimizes the across-cluster similarity, there is no need to model the distribution within each cluster.…

An edge subset $S$ of a connected graph $G$ is called an anti-Kekul\'{e} set if $G-S$ is connected and has no perfect matching. We can see that a connected graph $G$ has no anti-Kekul\'{e} set if and only if each spanning tree of $G$ has a…

Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…

Clustering graphs based on a comparison of the number of links within clusters and the expected value of this quantity in a random graph has gained a lot of attention and popularity in the last decade. Recently, Aldecoa and Marin proposed a…

A perfect pseudo-matching M in a cubic graph G is a spanning subgraph of G such that every component of M is isomorphic to K_2 or to K_1,3. In view of snarks G with dominating cycle C, this is a natural generalization of perfect matchings…

We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…

We discuss relation between the cluster integrable systems and spin chains in the context of their correspondence with 5d supersymmetric gauge theories. It is shown that $\mathfrak{gl}_N$ XXZ-type spin chain on $M$ sites is isomorphic to a…

In 2013, Lee, Li, and Zelevinsky introduced combinatorial objects called compatible pairs to construct the greedy bases for rank-2 cluster algebras, consisting of indecomposable positive elements including the cluster monomials.…

General treebank analyses are graph structured, but parsers are typically restricted to tree structures for efficiency and modeling reasons. We propose a new representation and algorithm for a class of graph structures that is flexible…

The $n$-slice algebra is introduced as a generalization of path algebra in higher dimensional representation theory. In this paper, we give a classification of $n$-slice algebras via their $(n+1)$-preprojective algebras and the trivial…

We review some important results by Gross, Hacking, Keel, and Kontsevich on cluster algebra theory, namely, the column sign-coherence of $C$-matrices and the Laurent positivity, both of which were conjectured by Fomin and Zelevinsky. We…

Let $G \leq \operatorname{SL}_3(\mathbb{C})$ be a non-trivial finite group, acting on $R = \mathbb{C}[x_1, x_2, x_3]$. We continue our investigation from arXiv:2505.10683 [math.RT] into when the resulting skew-group algebra $R \ast G$ is a…

A graph $G=(V,E)$ is word-representable if there exists a word $w$ over the alphabet $V$ such that letters $x$ and $y$ alternate in $w$ if and only if $(x,y)\in E$. A triangular grid graph is a subgraph of a tiling of the plane with…

For a positive braid $\beta \in \mathrm{Br}^{+}_{k}$, we consider the braid variety $X(\beta)$. We define a family of open sets $\mathcal{U}_{r, w}$ in $X(\beta)$, where $w \in S_k$ is a permutation and $r$ is a positive integer no greater…

The tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph $G$. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some…

Real-world networks often exhibit strong transitivity with nontrivial local clustering spectra and degree correlations. Such features are not easily modeled in tractable network models, creating an obstacle to the theoretical understanding…

We generalize the brick polytope of V. Pilaud and F. Santos to spherical subword complexes for finite Coxeter groups. This construction provides polytopal realizations for a certain class of subword complexes containing all cluster…

We present a novel deep-learning-based method to cluster words in documents which we apply to detect and recognize tables given the OCR output. We interpret table structure bottom-up as a graph of relations between pairs of words (belonging…

In the graph clustering problem with a planted solution, the input is a graph on $n$ vertices partitioned into $k$ clusters, and the task is to infer the clusters from graph structure. A standard assumption is that clusters induce…