Related papers: Algebraic Combinatorics in Mathematical Chemistry.…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…
An automorphism of a graph $G$ with $n$ vertices is a bijective map $\phi$ from $V(G)$ to itself such that $\phi(v_i)\phi(v_j)\in E(G)$ $\Leftrightarrow$ $v_i v_j\in E(G)$ for any two vertices $v_i$ and $v_j$ of $G$. Denote by…
Let G be a connected complex simple Lie group with maximal compact subgroup U. Let g be the Lie algebra of G, and X = G/U be the associated Riemannian globally symmetric space of type IV. We have constructed three types of arithmetic…
We apply the new method for constructing integrable Hamiltonian hierarchies of Lax type equations developed in our previous paper, to show that all W-algebras W(gl_N,f) carry such a hierarchy. As an application, we show that all vector…
This paper gives a complete selfcontained proof of our result announced in hep-th/9909126 showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on…
Graph Neural Networks (GNNs) are limited in their expressive power, struggle with long-range interactions and lack a principled way to model higher-order structures. These problems can be attributed to the strong coupling between the…
It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decomposition of the plane induced by a finite number of algebraic…
Let $R=\oplus_{\Gamma\in\Gamma}R_{\gamma}$ be a $\Gamma$-graded $K$-algebra over a field $K$, where $\Gamma$ is a totally ordered semigroup, and let $I$ be an ideal of $R$. Considering the $\Gamma$-grading filtration $FR$ of $R$ and the…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
Finding a new mathematical representations for graph, which allows direct comparison between different graph structures, is an open-ended research direction. Having such a representation is the first prerequisite for a variety of machine…
Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…
We construct a new quantum algorithm for the graph collision problem; that is, the problem of deciding whether the set of marked vertices contains a pair of adjacent vertices in a known graph G. The query complexity of our algorithm is…
We present an algorithm for verifying the local unitary (LU) equivalence of graph and stabilizer states. Our approach reduces the problem to solving a system of linear equations in modular arithmetic. Furthermore, we demonstrate that any LU…
We investigate quantum cellular automata (QCA) on one-dimensional spin systems defined over a subalgebra of the full local operator algebra - the symmetric subalgebra under a finite Abelian group symmetry $G$. For systems where each site…
With a nilpotent element in a semisimple Lie algebra g one associates a finitely generated associative algebra W called a W-algebra of finite type. This algebra is obtained from the universal enveloping algebra U(g) by a certain Hamiltonian…
Graph neural networks have been widely used on modeling graph data, achieving impressive results on node classification and link prediction tasks. Yet, obtaining an accurate representation for a graph further requires a pooling function…
In recent years, we have seen several approaches to the graph isomorphism problem based on "generic" mathematical programming or algebraic (Gr\"obner basis) techniques. For most of these, lower bounds have been established. In fact, it has…
In this paper we study the complexity of the following problems: Given a colored graph X=(V,E,c), compute a minimum cardinality set S of vertices such that no nontrivial automorphism of X fixes all vertices in S. A closely related problem…