Related papers: Rooted Clusters for Graph LP Algebras
We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…
The definition of graph automatic groups by Kharlampovich, Khoussainov and Miasnikov and its extension to C-graph automatic by Murray Elder and the first author raise the question of whether Thompson's group F is graph automatic. We define…
Mayer's theory of cluster integrals allows one to write the partition function of a gas model as a generating function of weighted graphs. Recently, Labelle, Leroux and Ducharme have studied the graph weights arising from the…
The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…
The latent space approach to complex networks has revealed fundamental principles and symmetries, enabling geometric methods. However, the conditions under which network topology implies geometricity remain unclear. We provide a…
The main result of this work is a new proof and generalization of Lazard's comparison theorem of locally analytic group cohomology with Lie algebra cohomology for K-Lie groups, where K is a finite extension of the p-adic numbers. We show…
We obtain a complete structural characterization of Cohn-Leavitt algebras over no-exit objects as graded involutive algebras. Corollaries of this result include graph-theoretic conditions characterizing when a Leavitt path algebra is a…
In this paper we introduce a class of hypergraphs that we call chordal. We also extend the definition of triangulated hypergraphs, given in \cite{VT}, so that a triangulated hypergraph, according to our definition, is a natural…
This note defines a family of Laurent polynomials (indexed in the rational projective line) which generalize the Markoff numbers and relate to the character variety of the one-cusped torus. We describe which monomials appear in each…
This is an introduction to cluster algebras and their common triangular bases. These bases are Kazhdan-Lusztig-type and serve as the canonical bases of cluster algebras from the representation-theoretic point of view. We review seeds…
We achieve an extremely useful description (up to isomorphism) of the Leavitt path algebra $L_K(E)$ of a finite graph $E$ with coefficients in a field $K$ as a direct sum of matrix rings over $K$, direct sum with a corner of the Leavitt…
We consider 15 properties of labeled random graphs that are of interest in the graph-theoretical and the graph mining literature, such as clustering coefficients, centrality measures, spectral radius, degree assortativity, treedepth,…
Knowledge graphs have emerged as a widely adopted medium for storing relational data, making methods for automatically reasoning with them highly desirable. In this paper, we present a novel approach for inducing a hierarchy of subject…
Let $G=(V, E)$ be a planar graph and let $\mathcal{C}$ be a partition of $V$. We refer to the graphs induced by the vertex sets in $\mathcal{C}$ as Clusters. Let $D_{\mathcal C}$ be an arrangement of disks with a bijection between the disks…
We extend recent work by Howie, Mathews and Purcell to simplify the calculation of A-polynomials for any family of hyperbolic knots related by twisting. The main result follows from the observation that equations defining the deformation…
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,…
We present a categorification of four mutation finite cluster algebras by the cluster category of the category of coherent sheaves over a weighted projective line of tubular weight type. Each of these cluster algebras which we call tubular…
The well-known graph-based clustering methods, including spectral clustering, symmetric non-negative matrix factorization, and doubly stochastic normalization, can be viewed as relaxations of the kernel $k$-means approach. However, we posit…
We develop a new general framework for algebras and clones, called Universal Clone Algebra. Algebras and clones of finitary operations are to Universal Algebra what t-algebras and clone algebras are to Universal Clone Algebra. Clone…
Learning community structures in graphs has broad applications across scientific domains. While graph neural networks (GNNs) have been successful in encoding graph structures, existing GNN-based methods for community detection are limited…