Related papers: Snake Graphs for Graph LP Algebras

We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…

Theoretical development and applications of graph signal processing (GSP) have attracted much attention. In classical GSP, the underlying structures are restricted in terms of dimensionality. A graph is a combinatorial object that models…

We investigate the generalizability of learned binary relations: functions that map pairs of instances to a logical indicator. This problem has application in numerous areas of machine learning, such as ranking, entity resolution and link…

Graph clustering is a fundamental technique in data analysis with applications in many different fields. While there is a large body of work on clustering undirected graphs, the problem of clustering directed graphs is much less understood.…

Stanislaw Ulam asked whether there exists a universal countable planar graph (that is, a countable planar graph that contains every countable planar graph as a subgraph). J\'anos Pach (1981) answered this question in the negative. We…

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…

This paper proposes a family of permutation-invariant graph embeddings, generalizing the Skew Spectrum of graphs of Kondor & Borgwardt (2008). Grounded in group theory and harmonic analysis, our method introduces a new class of graph…

The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on…

We establish a connection between a generalization of KLR algebras, called quiver Schur algebras, and the cohomological Hall algebras of Kontsevich and Soibelman. More specifically, we realize quiver Schur algebras as algebras of…

Leavitt path algebras associate to directed graphs a $\mathbb Z$-graded algebra and in their simplest form recover the Leavitt algebras L(1,n). In this note, we introduce iterated Leavitt path algebras associated to directed weighted graphs…

For a set-endofunctor $F$, we extend the notion of universal $F$-coalgebras to $F$-graphs. These generalized coalgebras are models for various types of graphs, such as (un)directed (hyper)graphs, relational structures or fuzzy graphs. The…

We introduce admissible group actions on cluster algebras, cluster categories and quivers with potential and study the resulting orbit spaces. The orbit space of the cluster algebra has the structure of a generalized cluster algebra. This…

We give several explicit examples of quantum cluster algebra structures, as introduced by Berenstein and Zelevinsky, on quantized coordinate rings of partial flag varieties and their associated unipotent radicals. These structures are shown…

In this paper, first, we define and investigate $k$-layered numbers, which are a generalization of Zumkeller numbers. After that, we generalize the concept of Zumkeller labeling and Zumkeller cordial labeling to $k$-layered labeling and…

This article is the first of two where we investigate to what extent homotopy invariant, excisive and matrix stable homology theories help one distinguish between the Leavitt path algebras $L(E)$ and $L(F)$ of graphs $E$ and $F$ over a…

Uniform Lie algebras are combinatorially defined two-step nilpotent Lie algebras which can be used to define Einstein solvmanifolds. These Einstein spaces often have nontrivial isotropy groups. We derive basic properties of uniform Lie…

We present a means of formulating and solving graph coloring problems with probabilistic graphical models. In contrast to the prevalent literature that uses factor graphs for this purpose, we instead approach it from a cluster graph…

We introduce a new class of symmetric algebras, which we call hybrid algebras. This class contains on one extreme Brauer graph algebras, and on the other extreme general weighted surface algebras. We show that hybrid algebras are precisely…

We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…