English
Related papers

Related papers: Type $G_2$ Quantum Subgroups from Graph Planar Alg…

200 papers

We generalize the construction of tensor categories of endomorphisms of a type III factor $M$ associated with a $G$-kernel, from the case of a discrete group $G$ to that of a compact second countable group. Our approach is based on the…

Operator Algebras · Mathematics 2026-05-19 Marcel Bischoff , Pradyut Karmakar

We develop some foundations of commutative algebra, with a view towards algebraic geometry, in symmetric tensor categories. Most results establish analogues of classical theorems, in tensor categories which admit a tensor functor to some…

Category Theory · Mathematics 2026-02-20 Kevin Coulembier

The construction of a quantum groupoid out of a double groupoid satisfying a filling condition and a perturbation datum is given. This extends previous work that appeared in math.QA/0308228. Several important classes of examples of tensor…

Quantum Algebra · Mathematics 2007-06-13 Nicolás Andruskiewitsch , Sonia Natale

In planar algebras, we show how to project certain simple "quadratic" tangles onto the linear space spanned by "linear" and "constant" tangles. We obtain some corollaries about the principal graphs and annular structure of subfactors.

Operator Algebras · Mathematics 2019-12-19 Vaughan F. R. Jones

The past few years have seen a revived interest in quantum geometrical characterizations of band structures due to the rapid development of topological insulators and semi-metals. Although the metric tensor has been connected to many…

Mesoscale and Nanoscale Physics · Physics 2023-03-07 Adrien Bouhon , Abigail Timmel , Robert-Jan Slager

It is known that graphs cellularly embedded into surfaces are equivalent to ribbon graphs. In this work, we generalize this statement to broader classes of graphs and surfaces. Half-edge graphs extend abstract graphs and are useful in…

Combinatorics · Mathematics 2017-09-06 Remi C. Avohou , Joseph Ben Geloun , Mahouton N. Hounkonnou

The content of this paper can be roughly organized into a three-level hierarchy of generality. At the first, most general level, we introduce a new language which allows us to express various categorical structures in a systematic and…

Mathematical Physics · Physics 2022-08-03 Andreas Bauer , Alexander Nietner

We prove a family of 3-term relations in the Grothendieck ring of the category of finite-dimensional modules over the affine quantum algebra of type $G_2$ extending the celebrated $T$-system relations of type $G_2$. We show that these…

Quantum Algebra · Mathematics 2013-08-23 Jian-Rong Li , Evgeny Mukhin

Given graphs $G$ and $H$, we propose a method to implicitly enumerate topological-minor-embeddings of $H$ in $G$ using decision diagrams. We show a useful application of our method to enumerating subgraphs characterized by forbidden…

Data Structures and Algorithms · Computer Science 2019-11-19 Yu Nakahata , Jun Kawahara , Takashi Horiyama , Shin-ichi Minato

When two or more subsystems of a quantum system interact with each other they can become entangled. In this case the individual subsystems can no longer be described as pure quantum states. For systems with only 2 subsystems this…

Quantum Physics · Physics 2007-05-23 Rachel Parker , Chris Doran

A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…

Mathematical Physics · Physics 2009-10-31 A. N. Leznov

We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate…

Quantum Physics · Physics 2026-04-22 Bibhas Adhikari

Knowledge graph (KG) entity typing aims at inferring possible missing entity type instances in KG, which is a very significant but still under-explored subtask of knowledge graph completion. In this paper, we propose a novel approach for KG…

Computation and Language · Computer Science 2020-07-22 Yu Zhao , Anxiang Zhang , Ruobing Xie , Kang Liu , Xiaojie Wang

We introduce a notion of planar algebra, the simplest example of which is a vector space of tensors, closed under planar contractions. A planar algebra with suitable positivity properties produces a finite index subfactor of a II_1 factor,…

Quantum Algebra · Mathematics 2007-05-23 Vaughan F. R. Jones

We use Kuperberg's diagrammatic description of the space of homomorphisms between fundamental representations of $G_2$ to give explicit recursive formulas for the idempotent projecting to the highest weight irreducible summand in each…

Representation Theory · Mathematics 2023-07-11 Elijah Bodish , Haihan Wu

In this paper, we compute the derivations of the positive part of the two-parameter quantum group of type $G_2$ by embedding it into a quantum torus. We also show that the Hochschild cohomology group of degree $1$ of this algebra is a two…

Quantum Algebra · Mathematics 2020-03-16 Yongyue Zhong , Xiaomin Tang

Knowledge Graph (KG) is a graph based data structure to represent facts of the world where nodes represent real world entities or abstract concept and edges represent relation between the entities. Graph as representation for knowledge has…

Social and Information Networks · Computer Science 2024-04-16 Manita Pote

Graph is an important data representation which occurs naturally in the real world applications \cite{goyal2018graph}. Therefore, analyzing graphs provides users with better insights in different areas such as anomaly detection…

Machine Learning · Computer Science 2024-05-06 Elika Bozorgi , Saber Soleimani , Sakher Khalil Alqaiidi , Hamid Reza Arabnia , Krzysztof Kochut

Categorical quantum mechanics (CQM) and the theory of quantum groups rely heavily on the use of structures that have both an algebraic and co-algebraic component, making them well-suited for manipulation using diagrammatic techniques.…

Logic in Computer Science · Computer Science 2014-12-31 Aleks Kissinger , David Quick

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