English
Related papers

Related papers: Quantized dual graded graphs

200 papers

We give a supersymmetric generalization of the sine algebra and the quantum algebra $U_{t}(sl(2))$. Making use of the $q$-pseudo-differential operators graded with a fermionic algebra, we obtain a supersymmetric extension of sine algebra.…

High Energy Physics - Theory · Physics 2008-11-26 Ahmed Jellal , El Hassan El Kinani

We introduce a duality triads` notion. These are dual recurrences as used in dynamical data bases theory completed by a third pertinacious relation. Several representative examples of them are given. q-Gaussian triads as well as Fibonomial…

General Mathematics · Mathematics 2007-05-23 A. K. Kwasniewski

Motivated by affine Schubert calculus, we construct a family of dual graded graphs $(\Gamma_s,\Gamma_w)$ for an arbitrary Kac-Moody algebra $\g(A)$. The graded graphs have the Weyl group $W$ of $\g(A)$ as vertex set and are labeled versions…

Combinatorics · Mathematics 2007-10-01 Thomas Lam , Mark Shimozono

Borrowing ideas from the relation between simply laced Lie algebras and Dynkin diagrams, a weighted graph theory representation of quantum information is addressed. In this way, the density matrix of a quantum state can be interpreted as a…

High Energy Physics - Theory · Physics 2016-09-13 Abdelilah Belhaj , Adil Belhaj , Larbi Machkouri , Moulay Brahim Sedra , Soumia Ziti

Connectedness and bipartiteness are basic properties of classical graphs, and the purpose of this paper is to investigate the case of quantum graphs. We introduce the notion of connectedness and bipartiteness of quantum graphs in terms of…

Operator Algebras · Mathematics 2024-07-31 Junichiro Matsuda

We are interested in characterizing which classes of finite graphs are well-quasi-ordered by the induced subgraph relation. To that end, we devise an algorithm to decide whether a class of finite graphs well-quasi-ordered by the induced…

Logic in Computer Science · Computer Science 2024-07-02 Aliaume Lopez

We develop a curved Koszul duality theory for algebras presented by quadratic-linear-constant relations over unital versions of binary quadratic operads. As an application, we study Poisson $n$-algebras given by polynomial functions on a…

Algebraic Topology · Mathematics 2022-09-07 Najib Idrissi

First some old as well as new results about P.I. algebras, Ore extensions, and degrees are presented. Then quantized $n\times r$ matrices as well as quantized factor algebras of $M_q(n)$ are analyzed. The latter are the quantized function…

Quantum Algebra · Mathematics 2007-05-23 Hans Plesner Jakobsen , Søren Jøndrup

We present a simple combinatorial model for quasipositive surfaces and positive braids, based on embedded bipartite graphs. As a first application, we extend the well-known duality on standard diagrams of torus links to twisted torus links.…

Geometric Topology · Mathematics 2011-11-17 Sebastian Baader

We study the equivalence/duality between various non-commutative gauge models at the classical and quantum level. The duality is realised by a linear Seiberg-Witten-like map. The infinitesimal form of this map is analysed in more details.

High Energy Physics - Theory · Physics 2007-05-23 Elias Kiritsis , Corneliu Sochichiu

We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…

Operator Algebras · Mathematics 2024-11-27 Matthew Daws

We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…

Discrete Mathematics · Computer Science 2015-12-31 Vivek S. Nittoor

Multi-qubit quantum states corresponding to bipartite graphs $G(U,V,E)$ are examined. These states are constructed by applying $CNOT$ gates to an arbitrary separable multi-qubit quantum state. The entanglement distance of the resulting…

Quantum Physics · Physics 2025-12-17 Kh. P. Gnatenko

We address the problem of duality between the coloured extension of the quantised algebra of functions on a group and that of its quantised universal enveloping algebra i.e. its dual. In particular, we derive explicitly the algebra dual to…

Quantum Algebra · Mathematics 2009-11-07 Deepak Parashar

Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…

Chaotic Dynamics · Physics 2007-05-23 Prot Pakonski , Gregor Tanner , Karol Zyczkowski

We study quotients of multi-graded bundles, including double vector bundles. Among other things, we show that any such quotient fits into a tower of affine bundles. Applications of the theory include a construction of normal bundles for…

Differential Geometry · Mathematics 2024-11-28 Eckhard Meinrenken

We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…

Operator Algebras · Mathematics 2024-05-09 Paul Meunier

We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed…

The groups which can act semisymmetrically on a cubic graph of twice odd order are determined modulo a normal subgroup which acts semiregularly on the vertices of the graph.

Group Theory · Mathematics 2007-05-23 Chris Parker

We introduce and study the problem \mpd, which asks for two planar graphs $G_1$ and $G_2$ whether $G_1$ can be embedded such that its dual is isomorphic to $G_2$. Our algorithmic main result is an NP-completeness proof for the general case…

Data Structures and Algorithms · Computer Science 2013-03-08 Patrizio Angelini , Thomas Bläsius , Ignaz Rutter