Related papers: On Computational Complexity of Clifford Algebra
Clique-width is a well-studied graph parameter. For graphs of bounded clique-width, many problems that are NP-hard in general can be polynomial-time solvable. The fact motivates several studies to investigate whether the clique-width of…
Finding a Maximum Clique is a classic property test from graph theory; find any one of the largest complete subgraphs in an Erd\"os-R\'enyi G(N, p) random graph. We use Maximum Clique to explore the structure of the problem as a function of…
This paper investigates the computational complexity of deciding whether the vertices of a graph can be partitioned into a disjoint union of cliques and a triangle-free subgraph. This problem is known to be $\NP$-complete on arbitrary…
We study the algebra of complex polynomials which remain invariant under the action of the local Clifford group under conjugation. Within this algebra, we consider the linear spaces of homogeneous polynomials degree by degree and construct…
We give a full classification of Lie algebras of specific type in complexified Clifford algebras. These sixteen Lie algebras are direct sums of subspaces of quaternion types. We obtain isomorphisms between these Lie algebras and classical…
We introduce Clifford Group Equivariant Neural Networks: a novel approach for constructing $\mathrm{O}(n)$- and $\mathrm{E}(n)$-equivariant models. We identify and study the $\textit{Clifford group}$, a subgroup inside the Clifford algebra…
Division algebras have demonstrated their utility in studying non-associative algebras and their connection to the Standard Model through complex Clifford algebras. This article focuses on exploring the connection between these complex…
The Clifford spectrum is an elegant way to define the joint spectrum of several Hermitian operators. While it has been know that for examples as small as three $2$-by-$2$ matrices the Clifford spectrum can be a two-dimensional manifold, few…
The well-known classification of the Clifford algebras $Cl(r,s)$ leads to canonical forms of complex and real representations which are essentially unique by virtue of the Wedderburn theorem. For $s\ge 1$ representations of $Cl(r,s)$ on…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
Clique-width is a well-studied graph parameter owing to its use in understanding algorithmic tractability: if the clique-width of a graph class ${\cal G}$ is bounded by a constant, a wide range of problems that are NP-complete in general…
Formulas to calculate multivector exponentials in a base-free representation and in a orthonormal basis are presented for an arbitrary Clifford geometric algebra Cl(p,q). The formulas are based on the analysis of roots of characteristic…
The linearization of a quadratic form gives rise to a Clifford algebra structure, as seen in Dirac's factorization of the d'Alembert operator. A similar structure known as a generalized Clifford algebra arises from the continuation of this…
Computing the clique number and chromatic number of a general graph are well-known NP-Hard problems. Codenotti et al. (Bruno Codenotti, Ivan Gerace, and Sebastiano Vigna. Hardness results and spectral techniques for combinatorial problems…
We establish for smooth projective real curves the equivalent of the classical Clifford inequality known for complex curves. We also study the cases when equality holds.
The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, informatics, and many other areas. Although there exist several algorithms with acceptable runtimes for certain classes of…
In this work we explore the structure of Clifford algebras and the representations of the algebraic spinors in quantum information theory. Initially we present an general formulation through elements of left minimal ideals in tensor…
Albuquerque and Majid have shown how to view Clifford algebras $\cl_{p,q}$ as twisted group rings whereas Chernov has observed that Clifford algebras can be viewed as images of group algebras of certain 2-groups modulo an ideal generated by…
The Clifford spectrum is a form of joint spectrum for noncommuting matrices. This theory has been applied in photonics, condensed matter and string theory. In applications, the Clifford spectrum can be efficiently approximated using…
The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…