Related papers: On Computational Complexity of Clifford Algebra
We study briefly some properties of real Clifford algebras and identify them as matrix algebras. We then show that the representation space on which Clifford algebras act are spinors and we study in details matrix representations. The…
Geometric algebra was initiated by W.K. Clifford over 130 years ago. It unifies all branches of physics, and has found rich applications in robotics, signal processing, ray tracing, virtual reality, computer vision, vector field processing,…
Deep neural networks have been applied to a wide range of problems across different application domains with great success. Recently, research into combinatorial optimization problems in particular has generated much interest in the machine…
The necessary appearance of Clifford algebras in the quantum description of fermions has prompted us to re-examine the fundamental role played by the quaternion Clifford algebra, C(0,2). This algebra is essentially the geometric algebra…
We give a one dimensional octonionic representation of the different Clifford algebra $Cliff(5,5)\sim Cliff(1,9), Cliff(6,6)\sim Cliff(2,10)$ and lastly $Cliff(7,6)\sim Cliff(3,10)$.
We resolve the longstanding open problem concerning the computational complexity of Max Cut on interval graphs by showing that it is NP-complete.
We study holonomy algebras generated by an algebraic element of the Clifford algebra, or equivalently, the holonomy algebras of certain spin connections in flat space. We provide series of examples in arbitrary dimensions and establish…
We show that Clifford algebras are closely related to the study of isoclinic subspaces of spinor spaces and, consequently, to the Hurwitz-Radon matrix problem. Isocliny angles are introduced to parametrize gamma matrices, i.e., matrix…
Let Cl(V,g) be the real Clifford algebra associated to the real vector space V, endowed with a nondegenerate metric g. In this paper, we study the class of Z_2-gradings of Cl(V,g) which are somehow compatible with the multivector structure…
In fault-tolerant quantum computation and quantum error-correction one is interested on Pauli matrices that commute with a circuit/unitary. We provide a fast algorithm that decomposes any Clifford gate as a $\textit{minimal}$ product of…
We study central simple algebras in various ways, focusing on the role of $p$-central subspaces. The first part of my thesis is dedicated to the study of Clifford algebras. The standard Clifford algebra of a given form is the generic…
We study the notion of $\Gamma$-graded commutative algebra for an arbitrary abelian group $\Gamma$. The main examples are the Clifford algebras already treated by Albuquerque and Majid. We prove that the Clifford algebras are the only…
Real physical systems with reflective and rotational symmetries such as viruses, fullerenes and quasicrystals have recently been modeled successfully in terms of three-dimensional (affine) Coxeter groups. Motivated by this progress, we…
Given a linear space $U \subset \mathrm{Sym}^2V^\vee$ of quadrics in a projective space $\mathbb{P}(V)$ whose intersection is empty, we consider the corresponding Clifford space -- the projective space $\mathbb{P}(U)$ endowed with the even…
Following Herranz and Santander [Herranz F.J., Santander M., Mem. Real Acad. Cienc. Exact. Fis. Natur. Madrid 32 (1998), 59-84, physics/9702030] we will construct homogeneous spaces based on possible kinematical algebras and groups [Bacry…
Computing the topology of an algebraic plane curve $\mathcal{C}$ means to compute a combinatorial graph that is isotopic to $\mathcal{C}$ and thus represents its topology in $\mathbb{R}^2$. We prove that, for a polynomial of degree $n$ with…
The problem of maximising the number of cliques among $n$-vertex graphs from various graph classes has received considerable attention. We investigate this problem for the class of $1$-planar graphs where we determine precisely the maximum…
In the last decade, algorithmic frameworks based on a structural graph parameter called mim-width have been developed to solve generally NP-hard problems. However, it is known that the frameworks cannot be applied to the Clique problem, and…
We present a discussion of the generalized Clifford group over non-cyclic finite abelian groups. These Clifford groups appear naturally in the theory of topological error correction and abelian anyon models. We demonstrate a generalized…
We study the problem of approximating the number of $k$-cliques in a graph when given query access to the graph. We consider the standard query model for general graphs via (1) degree queries, (2) neighbor queries and (3) pair queries. Let…