Related papers: Quantized dual graded graphs
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
We study bipartite graphs partially ordered by the induced subgraph relation. Our goal is to distinguish classes of bipartite graphs which are or are not well-quasi-ordered (wqo) by this relation. Answering an open question from…
The gauge theories underlying gauged supergravity and exceptional field theory are based on tensor hierarchies: generalizations of Yang-Mills theory utilizing algebraic structures that generalize Lie algebras and, as a consequence, require…
Multivalued linear operators, also known as linear relations, are studied on a specific class of weighted, composition transforms on Fock space. Basic properties of this class of linear relations, such as closed graph, boundedness, complex…
We define a graded graph, called the Schur--Weyl graph, which arises naturally when one considers simultaneously the RSK algorithm and the classical duality between representations of the symmetric and general linear groups. As one of the…
We study the geometry of equiclassical strata of the discriminant in the space of plane curves of a given degree, which are families of curves of given degree, genus and class (degree of the dual curve). Our main observation is that the use…
The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…
Modular operads are a special type of operad: in fact, they bear the same relationship to operads that graphs do to trees (i.e. simply connected graphs). One of the basic examples of a modular operad is the collection of…
In math.QA/0506507 I. Gelfand and the authors introduced and studied a new class of algebras associated to directed graphs. In this paper we show that these algebras are Koszul for a large class of layered (i.e. ranked) graphs.
Quantum physics has revealed many interesting formal properties associated with the algebra of two operators, A and B, satisfying the partial commutation relation AB-BA=1. This study surveys the relationships between classical combinatorial…
We show that every gammoid has special digraph representations, such that a representation of the dual of the gammoid may be easily obtained by reversing all arcs. In an informal sense, the duality notion of a poset applied to the digraph…
The new graph parameter twin-width, introduced by Bonnet, Kim, Thomass e and Watrigant in 2020, allows for an FPT algorithm for testing all FO properties of graphs. This makes classes of efficiently bounded twin-width attractive from the…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
These graphs generalize both affine and finite type and provide an explanation for some quantum properties of roots of unity.
Algebro-geometric methods have proven to be very successful in the study of graphical models in statistics. In this paper we introduce the foundations to carry out a similar study of their quantum counterparts. These quantum graphical…
We study the curved Koszul duality theory for associative algebras presented by quadratic-linear-constant (QLC) relations. As an application, we investigate the cyclic (co)homology of a QLC algebra and its Koszul dual curved DG algebra, and…
Generalized geometry finds many applications in the mathematical description of some aspects of string theory. In a nutshell, it explores various structures on a generalized tangent bundle associated to a given manifold. In particular,…
The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…
Several types of linear layouts of graphs are obtained by leveraging known data structures; the most notable representatives are the stack and the queue layouts. In this content, given a data structure, one seeks to specify an order of the…
Quantum algebra of differential operators are studied