Related papers: Type $G_2$ Quantum Subgroups from Graph Planar Alg…
Node embedding is a key technique for representing graph nodes as vectors while preserving structural and relational properties, which enables machine learning tasks like feature extraction, clustering, and classification. While classical…
Let $G=(V,E)$ be an arbitrary undirected source graph to be embedded in a target graph $EM$, the extended grid with vertices on integer grid points and edges to nearest and next-nearest neighbours. We present an algorithm showing how to…
Using an algebraic orbifold method, we present non-commutative aspects of $G_2$ structure of seven dimensional real manifolds. We first develop and solve the non commutativity parameter constraint equations defining $G_2$ manifold algebras.…
We consider composition and division algebras over the real numbers: We note two r\^oles for the group $G_{2}$: as automorphism group of the octonions and as the isotropy group of a generic 3-form in 7 dimensions. We show why they are…
We show how one can associate to a given class of finite type G-structures a classifying Lie algebroid. The corresponding Lie groupoid gives models for the different geometries that one can find in the class, and encodes also the different…
Quantum gauge theory in the connection representation uses functions of holonomies as configuration observables. Physical observables (gauge and diffeomorphism invariant) are represented in the Hilbert space of physical states; physical…
Graph classification is a significant problem in many scientific domains. It addresses tasks such as the classification of proteins and chemical compounds into categories according to their functions, or chemical and structural properties.…
Traditional representations of graphs and their duals suggest the requirement that the dual vertices be placed inside their corresponding primal faces, and the edges of the dual graph cross only their corresponding primal edges. We consider…
A general method is described for finding algebraic expressions for matrix elements of any one- and two-particle operator for an arbitrary number of subshells in an atomic configuration, requiring neither coefficients of fractional…
We give a combinatorial description of the ``$D_{2n}$ planar algebra,'' by generators and relations. We explain how the generator interacts with the Temperley-Lieb braiding. This shows the previously known braiding on the even part extends…
!-graphs provide a means of reasoning about infinite families of string diagrams and have proven useful in manipulation of (co)algebraic structures like Hopf algebras, Frobenius algebras, and compositions thereof. However, they have…
Learning efficient graph representation is the key to favorably addressing downstream tasks on graphs, such as node or graph property prediction. Given the non-Euclidean structural property of graphs, preserving the original graph data's…
In this paper, we analyze embeddings of grid graphs on orientable surfaces. We determine the genus of a large class of k-dimensional grid graphs and effective two-sided bounds for the genus of any 3-dimensional grid graph, both in terms of…
Using quaternions and octonions, we construct some maps from the Grassmannian of 2-dimensional planes of $\mathbb{R}^n$, $\mathrm{Gr}_2(\mathbb{R}^n)$, to the projective space $\mathbb{R}\mathrm{P}^k$, for certain values of $n$ and $k$. All…
We show that the rigid C*-tensor categories of finite dimensional type 1 unitary representations of the quantum groups $U_{q}(\mathfrak{g}_{2})$ corresponding to the exceptional Lie group $G_2$ for positive $q\ne 1$ have property (T).
Tiered graph autoencoders provide the architecture and mechanisms for learning tiered latent representations and latent spaces for molecular graphs that explicitly represent and utilize groups (e.g., functional groups). This enables the…
We give a diagrammatic presentation of the A_2-Temperley-Lieb algebra. Generalizing Jones' notion of a planar algebra, we formulate an A_2-planar algebra motivated by Kuperberg's A_2-spider. This A_2-planar algebra contains a subfamily of…
We propose a novel variational method for solving the sub-graph isomorphism problem on a gate-based quantum computer. The method relies (1) on a new representation of the adjacency matrices of the underlying graphs, which requires a number…
We extend the usual process-theoretic view on locality and causality in subsystems (based on the tensor product case) to general quantum systems (i.e.\ possibly non-factor, finite-dimensional von Neumann algebras). To do so, we introduce a…
Starting from the groupoid approach to Schwinger's picture of Quantum Mechanics, a proposal for the description of symmetries in this framework is advanced.It is shown that, given a groupoid $G\rightrightarrows \Omega$ associated with a…