Related papers: On Computational Complexity of Clifford Algebra
Given an input graph and weights on its vertices, the maximum co-2-plex problem is to find a subset of vertices maximizing the sum of their weights and inducing a graph of degree at most 1. In this article, we analyze polyhedral aspects of…
The congested clique model of distributed computing has been receiving attention as a model for densely connected distributed systems. While there has been significant progress on the side of upper bounds, we have very little in terms of…
Obtaining the symmetries of a model is a critical step towards developing an understanding and ultimately analytically or numerically solving the model. However, finding symmetries is generally extremely complicated, often being the result…
We extend Kostant's results about $\mathfrak{g}$-invariants in the Clifford algebra $Cl(\mathfrak{g})$ of a complex semisimple Lie algebra $\mathfrak{g}$ to the relative case of $\mathfrak{k}$-invariants in the Clifford algebra…
The clique problems, including $k$-CLIQUE and Triangle Finding, form an important class of computational problems; the former is an NP-complete problem, while the latter directly gives lower bounds for Matrix Multiplication. A number of…
An abundance of real-world problems manifest as covering edges and/or vertices of a graph with cliques that are optimized for some objectives. We consider different structural parameters of graph, and design fixed-parameter tractable…
Deciding whether a graph can be embedded in a grid using only unit-length edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a number of graph classes for which the problem is polynomial, even…
We discuss the complexity of completions of partial combinatory algebras, in particular of Kleene's first model. Various completions of this model exist in the literature, but all of them have high complexity. We show that although there do…
Finding a maximum clique in a given graph is one of the fundamental NP-hard problems. We compare two multi-core thread-parallel adaptations of a state-of-the-art branch and bound algorithm for the maximum clique problem, and provide a novel…
We obtain inductive and enumerative formulas for the multiplicities of the weights of the spin module for the Clifford algebra of a Levi subalgebra in a complex semisimple Lie algebra. Our formulas involve only matrices and tableaux, and…
For the complex Clifford algebra Cl(p,q) of dimension n=p+q we define a Hermitian scalar product. This scalar product depends on the signature (p,q) of Clifford algebra. So, we arrive at unitary spaces on Clifford algebras. With the aid of…
We give a definition of the Clifford algebra of an antiautomorphism of a central simple algebra, and compute it for the algebras of degree 2.
We consider the Clifford algebra and the Clifford group associated with any quadratic module, degenerate or not, over an arbitrary commutative ring with 1. We determine some of the important subalgebras of the Clifford algebra under some…
We give a one dimensional octonionic representation of the different Clifford algebra Cliff(5,5)\sim Cliff(9,1), Cliff(6,6)\sim Cliff(10,2) and lastly Cliff(7,6)\sim Cliff(10,3) which can be given by (8x8) real matrices taking into account…
In this paper, we solve the problem of computing the inverse in Clifford algebras of arbitrary dimension. We present basis-free formulas of different types (explicit and recursive) for the determinant, other characteristic polynomial…
In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…
We completely classify the computational complexity of the list H-colouring problem for graphs (with possible loops) in combinatorial and algebraic terms: for every graph H the problem is either NP-complete, NL-complete, L-complete or is…
Multiple interval graphs are variants of interval graphs where instead of a single interval, each vertex is assigned a set of intervals on the real line. We study the complexity of the MAXIMUM CLIQUE problem in several classes of multiple…
This work examines the problem of clique enumeration on a graph by exploiting its clique covers. The principle of inclusion/exclusion is applied to determine the number of cliques of size $r$ in the graph union of a set $\mathcal{C} =…
Let $\Gamma$ be a metric graph having a linear system $g^r_{2r}$ for some $2 \leq r \leq g-2$ then $\Gamma$ has a linear system $g^1_2$. This is similar to the well-known Clifford's Theorem from the theory of linear systems on smooth…