Related papers: On Computational Complexity of Clifford Algebra

A strong clique in a graph is a clique intersecting every maximal independent set. We study the computational complexity of six algorithmic decision problems related to strong cliques in graphs and almost completely determine their…

1. Translated by Thomas E. Cecil, Department of Mathematics and Computer Science, College of the Holy Cross, Worcester, MA 01610, USA; E-mail address: [email protected] 2. Typed by Wenjiao Yan, School of Mathematical Sciences,…

Closed form expressions for a logarithm of general multivector (MV) in base-free form in real geometric algebras (GAs) Cl(p,q) are presented for all n=p+q=3. In contrast to logarithm of complex numbers (isomorphic to Cl(0,1), 3D logarithmic…

We give an algebraic formulation based on Clifford algebras and algebraic spinors for quantum information. In this context, logic gates and concepts such as chirality, charge conjugation, parity and time reversal are introduced and explored…

This example of Clifford algebras calculations uses GiNaC (http://www.ginac.de/) library, which includes a support for generic Clifford algebra starting from version~1.3.0. Both symbolic and numeric calculation are possible and can be…

We provide a generalized definition for the quantized Clifford algebra introduced by Hayashi using another parameter $k$ that we call the twist. For a field of characteristic not equal to $2$, we provide a basis for our quantized Clifford…

General braided counterparts of classical Clifford algebras are introduced and investigated. Braided Clifford algebras are defined as Chevalley-Kahler deformations of the corresponding braided exterior algebras. Analogs of the spinor…

The maximum clique problem is a well known NP-Hard problem with applications in data mining, network analysis, information retrieval and many other areas related to the World Wide Web. There exist several algorithms for the problem with…

Real Clifford algebras play a fundamental role in the eight real Altland-Zirnbauer symmetry classes and the classification tables of topological phases. Here, we present another elegant realization of real Clifford algebras in the…

In this paper, we express Euler's formula and De Moivre's formula for Clifford algebra Cl2 and find nth roots of an element in Clifford algebra Cl2.

Finding large "cliquish" subgraphs is a central topic in graph mining and community detection. A popular clique relaxation are 2-clubs: instead of asking for subgraphs of diameter one (these are cliques), one asks for subgraphs of diameter…

Constraint satisfaction problems are computational problems that naturally appear in many areas of theoretical computer science. One of the central themes is their computational complexity, and in particular the border between…

Since its first use by Euler on the problem of the seven bridges of K\"onigsberg, graph theory has shown excellent abilities in solving and unveiling the properties of multiple discrete optimization problems. The study of the structure of…

The clique number of a tournament is the maximum clique number of a graph formed by keeping backwards arcs in an ordering of its vertices. We study the time complexity of computing the clique number of a tournament and prove that, for any…

The clique-width is a measure of complexity of decomposing graphs into certain tree-like structures. The class of graphs with bounded clique-width contains bounded tree-width graphs. We give a polynomial time graph isomorphism algorithm for…

We define and study an action of the symmetric group on the Yokonuma--Hecke algebra. This leads to the definition of two classes of algebras. The first one is connected with the image of the algebra of the braid group inside the…

This paper is an elaboration of an introductory talk given by the author at a workshop on Clifford algebras at Tennessee Technical University, in May 2002. We give an introduction to the basic concepts of Clifford analysis, including links…

All 7-dimensional subalgebras of the 8-dimensional Clifford algebra over the field C of complex numbers are found. Canonical bases are used throughout the determination. It is found that the 8-dimensional Clifford algebra over C has exactly…

The study of complex functions is based around the study of holomorphic functions, satisfying the Cauchy-Riemann equations. The relatively recent field of Clifford Analysis lets us extend many results from Complex Analysis to higher…

We address the problem of enumerating all maximal clique-partitions of an undirected graph and present an algorithm based on the observation that every maximal clique-partition can be produced from the maximal clique-cover of the graph by…