Related papers: On Computational Complexity of Clifford Algebra
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
We survey classical and recent developments in numerical linear algebra, focusing on two issues: computational complexity, or arithmetic costs, and numerical stability, or performance under roundoff error. We present a brief account of the…
It is well-known that the Clifford algebra Cl(2n) can be given a description in terms of creation/annihilation operators acting in the space of inhomogeneous differential forms on C^n. We refer to such inhomogeneous differential forms as…
Isotopic liftings of algebraic structures are investigated in the context of Clifford algebras, where it is defined a new product involving an arbitrary, but fixed, element of the Clifford algebra. This element acts as the unit with respect…
Parameterized complexity theory has enabled a refined classification of the difficulty of NP-hard optimization problems on graphs with respect to key structural properties, and so to a better understanding of their true difficulties. More…
We investigate the space complexity of certain perfect matching problems over bipartite graphs embedded on surfaces of constant genus (orientable or non-orientable). We show that the problems of deciding whether such graphs have (1) a…
Clifford geometric algebras of multivectors are introduced which exhibit a bilinear form which is not necessarily symmetric. Looking at a subset of bi-vectors in CL(K^{2n},B), we proof that theses elements generate the Hecke algebra…
A clique transversal in a graph is a set of vertices intersecting all maximal cliques. The problem of determining the minimum size of a clique transversal has received considerable attention in the literature. In this paper, we initiate the…
We study the Clifford dimension of an integral curve. To do so, we extend the notion of Clifford index, allowing torsion-free sheaves on its computation. We derive results for arbitrary curves, and then focus on the monomial case. In this…
A clique in an undirected graph G= (V, E) is a subset V' V of vertices, each pair of which is connected by an edge in E. The clique problem is an optimization problem of finding a clique of maximum size in graph. The clique problem is…
Classical Clifford theory studies the decomposition of simple $G$-modules into simple $H$-modules for some normal subgroup $H \triangleleft G$. In this paper we deal with chains of normal subgroups $1 \triangleleft G_1 \triangleleft \cdots…
This paper is divided in three parts. In the first part, I study the Clifford algebra associated to the hessian of a functional $f$ defined on an open subset of $\mathbb{R}^n$ \ and the Clifford algebra associated to the hessian of the…
We tackle the long-standing question of the computational complexity of determining homology groups of simplicial complexes, a fundamental task in computational topology, posed by Kaibel and Pfetsch 20 years ago. We show that this decision…
While structural width parameters (of the input) belong to the standard toolbox of graph algorithms, it is not the usual case in computational geometry. As a case study we propose a natural extension of the structural graph parameter of…
For each quadratic form Q in Quad(V) over a given vector space over a field R we have the Clifford algebra Cl(V,Q) defined as the quotient T(V)/I(Q) of the tensor algebra T(V) over the two-sided ideal generated by expressions of the form $x…
In this work we consider a straightforward linear programming formulation of the recently introduced $\{k\}$-packing function problem in graphs, for each fixed value of the positive integer number $k$. We analyse a special relation between…
This paper exhibits a multiplicative and minimal cellular complex which allows explicit and complete (co)homological calculations for the symmetric products of a finite two dimensional CW complex. By considering cohomology, we observe that…
We consider the problems of finding a maximum clique in a graph and finding a maximum-edge biclique in a bipartite graph. Both problems are NP-hard. We write both problems as matrix-rank minimization and then relax them using the nuclear…
We propose improved exact and heuristic algorithms for solving the maximum weight clique problem, a well-known problem in graph theory with many applications. Our algorithms interleave successful techniques from related work with novel data…
In this paper, we present two fast matrix representation algorithms based on the recursive decomposition of multivectors into specific right and left ideals. We also examine the relation between these two representations. Furthermore, we…