Related papers: Type $G_2$ Quantum Subgroups from Graph Planar Alg…
We describe algebraically, diagrammatically and in terms of weight vectors, the restriction of tensor powers of the standard representation of quantum $\mathfrak{sl}_2$ to a coideal subalgebra. We realise the category as module category…
Graph encoder embedding, a recent technique for graph data, offers speed and scalability in producing vertex-level representations from binary graphs. In this paper, we extend the applicability of this method to a general graph model, which…
In this paper, by using Gr\"obner-Shirshov bases, we show that in the following classes, each (resp. countably generated) algebra can be embedded into a simple (resp. two-generated) algebra: associative differential algebras, associative…
Knowledge graphs (KGs) are powerful tools that codify relational behaviour between entities in knowledge bases. KGs can simultaneously model many different types of subject-predicate-object and higher-order relations. As such, they offer a…
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then…
We provide a combinatorial description of the monoidal category generated by the fundamental representation of the small quantum group of $\mathfrak{sl}_2$ at a root of unity $q$ of odd order. Our approach is diagrammatic, and it relies on…
Starting from a Hopf algebra endowed with an action of a group G by Hopf automorphisms, we construct (by a twisted double method) a quasitriangular Hopf G-coalgebra. This method allows us to obtain non-trivial examples of quasitriangular…
We will argue in this paper that the type classification of v.Neumann algebras play an important role in a theory of quantum gravity and quantum space-time physics. We provide arguments that type $II_{\infty}$ and its representation as a…
In this article we propose some Maple procedures, for teaching purposes, to study the basics of General Relativity (GR) and Cosmology. After presenting some features of GRTensorII, a package specially built to deal with GR, we give two…
Groupoidification is a form of categorification in which vector spaces are replaced by groupoids, and linear operators are replaced by spans of groupoids. We introduce this idea with a detailed exposition of 'degroupoidification': a…
Knowledge Graphs (KGs) are composed of structured information about a particular domain in the form of entities and relations. In addition to the structured information KGs help in facilitating interconnectivity and interoperability between…
We develop in detail a graphical tensor product reduction scheme, first described by Antoine and Speiser, for the simple rank 2 Lie algebras so(5) = sp(2), su(3), and g(2). This leads to an efficient practical method to reduce tensor…
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…
A partially embedded graph (or PEG) is a triple (G,H,\H), where G is a graph, H is a subgraph of G, and \H is a planar embedding of H. We say that a PEG (G,H,\H) is planar if the graph G has a planar embedding that extends the embedding \H.…
Existing foundation models, such as CLIP, aim to learn a unified embedding space for multimodal data, enabling a wide range of downstream web-based applications like search, recommendation, and content classification. However, these models…
Let G be a group and let A be the algebra of complex functions on G with finite support. The product in G gives rise to a coproduct on A making it a multiplier Hopf algebra. In fact, because there exist integrals, we get an algebraic…
We construct a new class of symmetric algebras of tame representation type that are also the endomorphism algebras of cluster tilting objects in 2-Calabi-Yau triangulated categories, hence all their non-projective indecomposable modules are…
Modelling how concepts are related is a central topic in Lexical Semantics. A common strategy is to rely on knowledge graphs (KGs) such as ConceptNet, and to model the relation between two concepts as a set of paths. However, KGs are…
To formalize calculations in linear algebra for the development of efficient algorithms and a framework suitable for functional programming languages and faster parallelized computations, we adopt an approach that treats elements of linear…
We classify the planar cubic Cayley graphs of connectivity 2, providing an explicit presentation and embedding for each of them. Combined with [9] this yields a complete description of all planar cubic Cayley graphs.