相关论文: Snake Graphs for Graph LP Algebras

The concept of sum labelling was introduced in 1990 by Harary. A graph is a sum graph if its vertices can be labelled by distinct positive integers in such a way that two vertices are connected by an edge if and only if the sum of their…

Goldman and Turaev found a Lie bialgebra structure on the vector space generated by non-trivial free homotopy classes of curves on a surface. When the surface has non-empty boundary, this vector space has a basis of cyclic reduced words in…

In a number of recent papers, (k+l)-graphs have been constructed from k-graphs by inserting new edges in the last l dimensions. These constructions have been motivated by C*-algebraic considerations, so they have not been treated…

We use category-theoretic techniques to provide two proofs showing that for a higher-rank graph $\Lambda$, its cubical (co-)homology and categorical (co-)homology groups are isomorphic in all degrees, thus answering a question of Kumjian,…

Barot, Geiss and Zelevinsky define a notion of a ``cyclically orientable graph'' and use it to devise a test for whether a cluster algebra is of finite type. Barot, Geiss and Zelivinsky's work leaves open the question of giving an efficient…

For every positive integer $n$, we find a complete classification for planar graphs according to the collection of numbers of common neighbours for every $n$-tuple of distinct vertices. Our results expand the literature on planar graphical…

Semantic parsing is the task of producing structured meaning representations for natural language sentences. Recent research has pointed out that the commonly-used sequence-to-sequence (seq2seq) semantic parsers struggle to generalize…

Graph clustering is a fundamental computational problem with a number of applications in algorithm design, machine learning, data mining, and analysis of social networks. Over the past decades, researchers have proposed a number of…

We introduce a class of algebras over a field $\mathbb{F}$ related to directed graphs in which all edges are labeled by nonzero elements of the field $\mathbb{F}$. If all labels are different from $1$, these algebras are axial algebras. We…

The aim of this work is the description of the isomorphism classes of all Leavitt path algebras coming from graphs satisfying Condition (Sing) with up to three vertices. In particular, this classification recovers the one achieved by Abrams…

The generalized $k$-connectivity $\kappa_k(G)$ of a graph $G$, introduced by Hager in 1985, is a nice generalization of the classical connectivity. Recently, as a natural counterpart, we proposed the concept of generalized…

Motivated by work of Buch on set-valued tableaux in relation to the K-theory of the Grassmannian, Lam and Pylyavskyy studied six combinatorial Hopf algebras that can be thought of as K-theoretic analogues of the Hopf algebras of symmetric…

We prove that any skew-symmetrizable cluster algebra is unistructural, which is a conjecture by Assem, Schiffler, and Shramchenko. As a corollary, we obtain that a cluster automorphism of a cluster algebra $\mathcal A(\mathcal S)$ is just…

For any row-finite graph $E$ and any field $K$ we construct the {\its Leavitt path algebra} $L(E)$ having coefficients in $K$. When $K$ is the field of complex numbers, then $L(E)$ is the algebraic analog of the Cuntz Krieger algebra…

Spectral clustering is a powerful technique for clustering high-dimensional data, utilizing graph-based representations to detect complex, non-linear structures and non-convex clusters. The construction of a similarity graph is essential…

We define a class of associative algebras generalizing 'clannish algebras', as introduced by the second author, but also incorporating semilinear structure, like a skew polynomial ring. Clannish algebras generalize the well known 'string…

The pentagram map was introduced by R. Schwartz more than 20 years ago. In 2009, V. Ovsienko, R. Schwartz and S. Tabachnikov established Liouville complete integrability of this discrete dynamical system. In 2011, M. Glick interpreted the…

In two seminal papers Kontsevich used a construction called_graph homology_ as a bridge between certain infinite dimensional Lie algebras and various topological objects, including moduli spaces of curves, the group of outer automorphisms…

A graph $G$ is said to be determined by the spectrum of its Laplacian matrix (DLS) if every graph with the same spectrum is isomorphic to $G$. van Dam and Haemers (2003) conjectured that almost all graphs have this property, but that is…

A graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs. Polar graphs and…