Related papers: Snake Graphs for Graph LP Algebras
Graph Neural Networks (GNNs) have been predominant for graph learning tasks; however, recent studies showed that a well-known graph algorithm, Label Propagation (LP), combined with a shallow neural network can achieve comparable performance…
Using the LP algebraic toolkit, Conway's original topograph is rethought of as a cluster construction, paving the way for a wider topography based on mutation-type local rules. As a remarkable application of such cluster-driven upgrade,…
We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…
We propose a Laplacian based on general inner product spaces, which we call the inner product Laplacian. We show the combinatorial and normalized graph Laplacians, as well as other Laplacians for hypergraphs and directed graphs, are special…
In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…
We develop a new, intrinsic, computationally friendly approach to Lie coalgebras through graph coalgebras, which are new and likely to be of independent interest. Our graph coalgebraic approach has advantages both in finding relations…
An ultragraph gives rise to a labelled graph with some particular properties. In this paper we describe the algebras associated to such labelled graphs as groupoid algebras. More precisely, we show that the known groupoid algebra…
Laman graphs naturally arise in structural mechanics and rigidity theory. Specifically, they characterize minimally rigid planar bar-and-joint systems which are frequently needed in robotics, as well as in molecular chemistry and polymer…
The generalized Dehn-Sommerville relations determine the odd subalgebra of the combinatorial Hopf algebra. We introduce a class of eulerian hypergraphs that satisfy the generalized Dehn-Sommerville relations for the combinatorial Hopf…
In prior joint work with Lewis, we developed a theory of enriched set-valued $P$-partitions to construct a $K$-theoretic generalization of the Hopf algebra of peak quasisymmetric functions. Here, we situate this object in a diagram of six…
This is a brief and informal introduction to cluster algebras. It roughly follows the historical path of their discovery, made jointly with A.Zelevinsky. Total positivity serves as the main motivation.
We establish a combinatorial realization of continued fractions as quotients of cardinalities of sets. These sets are sets of perfect matchings of certain graphs, the snake graphs, that appear naturally in the theory of cluster algebras. To…
In the standard category of directed graphs, graph morphisms map edges to edges. By allowing graph morphisms to map edges to finite paths (path homomorphisms of graphs), we obtain an ambient category in which we determine subcategories…
Motivated by Stanley's conjecture about the $e$-positivity of claw-free incomparability graphs, Hamel and her collaborators studied the $e$-positivity of $(claw, H)$-free graphs, where $H$ is a four-vertex graph. In this paper we establish…
It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form…
For cluster algebras from surfaces, there is a known formula for cluster variables and F-polynomials in terms of the perfect matchings of snake graphs. If the cluster algebra has trivial coefficients, there is also a known formula for…
In this paper, we introduce the solvabilizer and the solvable graph for a Lie superalgebra and establish their basic properties. Then we define a category which links Lie superalgebras to their solvable substructures. Afterwards, we prove…
Kontsevich has proven that the Lie homology of the Lie algebra of symplectic vector fields can be computed in terms of the homology of a graph complex. We prove that the Leibniz homology of this Lie algebra can be computed in terms of the…
Associating graph algebras to directed graphs leads to both covariant and contravariant functors from suitable categories of graphs to the category k-Alg of algebras and algebra homomorphisms. As both functors are often used at the same…
Generalized splines are an algebraic combinatorial framework that generalizes and unifies various established concepts across different fields, most notably the classical notion of splines and the topological notion of GKM theory. The…