Related papers: On Computational Complexity of Clifford Algebra
In this paper, we make the case that Clifford algebra is the natural framework for root systems and reflection groups, as well as related groups such as the conformal and modular groups: The metric that exists on these spaces can always be…
The representations of Clifford algebras and their involutions and anti-involutions are fully investigated since decades. However, these representations do sometimes not comply with usual conventions within physics. A few simple examples…
In this paper we prove isomorphisms between 5 Lie groups (of arbitrary dimension and fixed signatures) in Clifford algebra and classical matrix Lie groups - symplectic, orthogonal and linear groups. Also we obtain isomorphisms of…
Finding complete subgraphs in a graph, that is, cliques, is a key problem and has many real-world applications, e.g., finding communities in social networks, clustering gene expression data, modeling ecological niches in food webs, and…
We consider problems of finding a maximum size/weight $t$-matching without forbidden subgraphs in an undirected graph $G$ with the maximum degree bounded by $t+1$, where $t$ is an integer greater than $2$. Depending on the variant forbidden…
Ram and Rammage have introduced an automorphism and Clifford theory on affine Hecke algebras. Here we will extend them to cyclotomic Hecke algebras and rational Cherednik algebras.
Using representations of Clifford algebras we construct indecomposable singular Riemannian foliations on round spheres, most of which are non-homogeneous. This generalizes the construction of non-homogeneous isoparametric hypersurfaces due…
Quantum circuits are considered more powerful than classical circuits and require exponential resources to simulate classically. Clifford circuits are a special class of quantum circuits that can be simulated in polynomial time but still…
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications in models of local computation. For a fixed target graph…
In this paper we find a Clifford algebra associated to generalized Fibonacci quaternions. In this way, we provide a nice algorithm to obtain a division quaternion algebra starting from a quaternion non-division algebra and vice-versa.
A complete graph is the graph in which every two vertices are adjacent. For a graph $G=(V,E)$, the complete width of $G$ is the minimum $k$ such that there exist $k$ independent sets $\mathtt{N}_i\subseteq V$, $1\le i\le k$, such that the…
There has been recent interest in novel Clifford geometric invariants of linear transformations. This motivates the investigation of such invariants for a certain type of geometric transformation of interest in the context of root systems,…
We discuss a generalization of Clifford algebras known as generalized Clifford algebras (in particular, ternary Clifford algebras). In these objects, we have a fixed higher-degree form (in particular, a ternary form) instead of a quadratic…
We study the complexity of multiplication in noncommutative group algebras which is closely related to the complexity of matrix multiplication. We characterize such semisimple group algebras of the minimal bilinear complexity and show…
A set of valuable universal similarity factorization equalities are established over complex Clifford algebras $\Cn.$ Through them matrix representations of complex Clifford algebras $\Cn$ can directly be derived, and their properties can…
Clifford circuits -- i.e. circuits composed of only CNOT, Hadamard, and $\pi/4$ phase gates -- play a central role in the study of quantum computation. However, their computational power is limited: a well-known result of Gottesman and…
The aim of this paper is to find generating sets of commuting involutions and use them to explicitly construct minimal representations of Clifford algebras $Cl(n)_{p,q}$. By results of [HL] and [LW], we know the dimension of such minimal…
We initiate the study of computational complexity of graph coverings, aka locally bijective graph homomorphisms, for {\em graphs with semi-edges}. The notion of graph covering is a discretization of coverings between surfaces or topological…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We review Bacry and Levy-Leblond's work on possible kinematics as applied to 2-dimensional spacetimes, as well as the nine types of 2-dimensional Cayley-Klein geometries, illustrating how the Cayley-Klein geometries give homogeneous…