Related papers: Snake Graphs for Graph LP Algebras
In this paper we define an algebra structure on the vector space $L(\Sigma)$ generated by links in the manifold $\Sigma \times [0,1]$ where $\Sigma $ is an oriented surface. This algebra has a filtration and the associated graded algebra…
In [LP] we introduced Laurent phenomenon algebras, a generalization of cluster algebras. Here we give an explicit description of Laurent phenomenon algebras with a linear initial seed arising from a graph. In particular, any graph…
In this paper, we define a number of closely related isomorphisms. On one side of these isomorphisms sit a number of of algebras generalizing the Hecke and affine Hecke algebras, which we call the "Hecke family"; on the other, we find…
Constellations and hypermaps generalize combinatorial maps, i.e. embedding of graphs in a surface, in terms of factorization of permutations. In this paper, we extend a result of Jackson and Visentin (1990) stating an enumerative relation…
Using the shuffle structure of the graphs, we introduce a new kind of the Hopf algebraic structure for tagged graphs with, or without loops. Like a quantum group structure, its product is non-commutative. With the help of the Hopf algebraic…
We introduce a new class of combinatorial objects, named tight gradings, which are certain nonnegative integer-valued functions on maximal Dyck paths. Using tight gradings, we derive a manifestly positive formula for any wall-function in a…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
As an improvement of the combinatorial realization of totally positive matrices via the essential positive weightings of certain planar network by S.Fomin and A.Zelevisky \cite{[4]}, in this paper, we give the test method of positive…
Dyck paths categories are introduced as a combinatorial model of the category of representations of quivers of Dynkin type An. In particular, it is proved that there is a bijection between some Dyck paths and perfect matchings of some snake…
This paper is concerned with the structures introduced recently by the authors of the current paper concerning the multiplier Hopf $*$-graph algebras and also the Cuntz-Krieger algebras and their relations with the $C^*$-graph algebras, and…
An integer generalized spline is a set of vertex labels on an edge-labeled graph that satisfy the condition that if two vertices are joined by an edge, the vertex labels are congruent modulo the edge label. Foundational work on these…
Spectral clustering is discussed from many perspectives, by extending it to rectangular arrays and discrepancy minimization too. Near optimal clusters are obtained with singular value decomposition and with the weighted $k$-means algorithm.…
In this paper, we prove some combinatorial results on generalized cluster algebras. To be more precisely, we prove that (i) the seeds of a generalized cluster algebra $\mathcal A(\mathcal S)$ whose clusters contain particular cluster…
Hom-algebras are generalizations of algebras obtained using a twisting by a linear map. But there is a priori a freedom on where to twist. We enumerate here all the possible choices in the Lie and associative categories and study the…
A graph is called a sum graph if its vertices can be labelled by distinct positive integers such that there is an edge between two vertices if and only if the sum of their labels is the label of another vertex of the graph. Most papers on…
Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the…
Spectral algorithms are graph partitioning algorithms that partition a node set of a graph into groups by using a spectral embedding map. Clustering techniques based on the algorithms are referred to as spectral clustering and are widely…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
A functor from the category of directed trees with inclusions to the category of commutative C*-algebras with injective *-homomorphisms is constructed. This is used to define a functor from the category of directed graphs with inclusions to…
In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…