相关论文: Snake Graphs for Graph LP Algebras

We prove that the combinatorial side of the "Rational Shuffle Conjecture" provides a Schur-positive symmetric polynomial. Furthermore, we prove that the contribution of a given rational Dyck path can be computed as a certain skew LLT…

In this work, we introduce a new class of algebras called skew-Brauer graph algebras, which generalize the well-known Brauer graph algebras. We establish that skew-Brauer graph algebras are symmetric and can be defined using a Brauer graph…

Leavitt path algebras associate to directed graphs a $\mathbb Z$-graded algebra and in their simplest form recover the Leavitt algebras $L(1,k)$. In this note, we first study this $\mathbb Z$-grading and characterize the ($\mathbb…

The algebras $\mathcal{L}_{g,n}(H)$ have been introduced by Alekseev-Grosse-Schomerus and Buffenoir-Roche in the middle of the 1990's, in the program of combinatorial quantization of the moduli space of flat connections over the surface…

Spectral clustering and Singular Value Decomposition (SVD) are both widely used technique for analyzing graph data. In this note, I will present their connections using simple linear algebra, aiming to provide some in-depth understanding…

There has been much recent interest in random graphs sampled uniformly from the n-vertex graphs in a suitable minor-closed class, such as the class of all planar graphs. Here we use combinatorial and probabilistic methods to investigate a…

We introduce a rich family of generalizations of the pentagram map sharing the property that each generates an infinite configuration of points and lines with four points on each line. These systems all have a description as $Y$-mutations…

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…

Let $\Sigma_{g,n}$ be a compact oriented surface of genus $g$ with $n$ open disks removed. The graph algebra $\mathcal{L}_{g,n}(H)$ was introduced by Alekseev--Grosse--Schomerus and Buffenoir--Roche and is a combinatorial quantization of…

The classical $q$-analogue of the integers was recently generalized by Morier-Genoud and Ovsienko to give $q$-analogues of rational numbers. Some combinatorial interpretations are already known, namely as the rank generating functions for…

We mainly introduce an abstract pattern to study cluster algebras. Cluster algebras, generalized cluster algebras and Laurent phenomenon algebras are unified in the language of generalized Laurent phenomenon algebras (briefly, GLP algebras)…

We present a method for associating labeled directed graphs to finite-dimensional Lie algebras, thereby enabling rapid identification of key structural algebraic features. To formalize this approach, we introduce the concept of…

We give combinatorial formulas for F-polynomials in cluster algebras of classical types in terms of the weighted paths in certain directed graphs. As a consequence we prove the positivity of F-polynomials in cluster algebras of classical…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…

A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to B\'ina and…

One can explicitly compute the generators of a surface cluster algebra either combinatorially, through dimer covers of snake graphs, or homologically, through the CC-map applied to indecomposable modules over the appropriate algebra. Recent…

We interpret augmented racks as a certain kind of multiplicative graphs and show that this point of view is natural for defining rack homology. We also define the analogue of the group algebra for these objects; in particular, we see how…

The pentagram map was introduced by R. Schwartz in 1992 for convex planar polygons. Recently, V. Ovsienko, R. Schwartz, and S. Tabachnikov proved Liouville integrability of the pentagram map for generic monodromies by providing a Poisson…

Graph polytopes arising from vertex-weighted graphs were first introduced by B\'ona, Ju, and Yoshida. We prove a conjecture stating that for any simple connected graph, the numerator polynomial of the Ehrhart series of its graph polytope is…

We define a new algebra associated to a Legendrian submanifold $\Lambda$ of a contact manifold of the form $\mathbb{R}_{t} \times W$, called the planar diagram algebra and denoted $PDA(\Lambda, \mathcal{P})$. It is a non-commutative,…