Related papers: Quantized dual graded graphs
We consider the line graph of a pure simplicial complex. We prove that, as in the case of line graphs of simple graphs, one can compute the second graded Betti number of the facet ideal of a pure simplicial complex in terms of the…
We define a new mathematical structure ( graph quantum group) which combines the tower of algebras associated with a graph ${\cal G}$ and the structure of a Hopf algebra {\cal A}. In this structure Ocneanu's string operators become Hopf…
For a finite dimensional semisimple Lie algebra ${\frak{g}}$ and a root $q$ of unity in a field $k,$ we associate to these data a double quiver $\bar{\cal{Q}}.$ It is shown that a restricted version of the quantized enveloping algebras…
We study the Koszul property of a standard graded $K$-algebra $R$ defined by the binomial edge ideal of a pair of graphs $(G_1,G_2)$. We show that the following statements are equivalent: (i) $R$ is Koszul; (ii) the defining ideal…
We classify, up to isomorphism, twisted graded Calabi--Yau algebras of dimension two on two-vertex quivers. By work of Reyes and Rogalski, such algebras may be presented as quotients of translation quivers by mesh relations. We also…
This paper presents four new classes of binary quantum codes with minimum dis- tance 3 and 4, namely Class-I, Class-II, Class-III and Class-IV. The classes Class-I and Class-II are constructed based on self-dual orientable embeddings of the…
In this article bipartite planar graphs St_r are investigated, r the number of their plane regions. Bounds for the graded Betti numbers and the projective dimension of the quotient ring associated to such graphs are discussed. We prove that…
We study the question of whether, for a given class of finite graphs, one can define, for each graph of the class, a linear ordering in monadic second-order logic, possibly with the help of monadic parameters. We consider two variants of…
We consider a class of linear differential operators acting on vector-valued function spaces with general coupled boundary conditions. Unlike in the more usual case of so-called quantum graphs, the boundary conditions can be nonlinear.…
Path and boundary-path groupoids of finitely aligned higher-rank graphs are often constructed using either filters or graph morphisms. We generalise the graph morphism approach to finitely aligned P-graphs where (Q, P) is a weakly…
Ramsey-good graphs are graphs that contain neither a clique of size $s$ nor an independent set of size $t$. We study doubly saturated Ramsey-good graphs, defined as Ramsey-good graphs in which the addition or removal of any edge necessarily…
Threshold graphs are a prevalent and widely studied class of simple graphs. They have several equivalent definitions which makes them a go-to class for finding examples and counter examples when testing and learning. This versatility has…
While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…
We study in an unified fashion several quadratic vector and matrix equations with nonnegativity hypotheses. Specific cases of such problems (QBD equations, nonsymmetric algebraic Riccati equations, Lu's simple equation, Markovian binary…
Inspired by a width invariant on permutations defined by Guillemot and Marx, Bonnet, Kim, Thomass\'e, and Watrigant introduced the twin-width of graphs, which is a parameter describing its structural complexity. This invariant has been…
We consider GLq(N)-covariant quantum algebras with generators satisfying quadratic polynomial relations. We show that, up to some inessential arbitrariness, there are only two kinds of such quantum algebras, namely, the algebras with…
The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…
Cographs--defined most simply as complete graphs with colored lines--both dualize and generalize ordinary graphs, and promise a comparably wide range of applications. This article introduces them by examples, catalogues, and elementary…
A \emph{queue layout} of a graph consists of a \emph{linear order} of its vertices and a partition of its edges into \emph{queues}, so that no two independent edges of the same queue are nested. The \emph{queue number} of a graph is the…
We study a pair of dual operads which arise in the study of moduli spaces of pointed genus 0 curves (this duality is similar to that between commutative and Lie algebras). These operads are both quadratic, and even Koszul, and arise in the…