Related papers: Complexity Classes and Completeness in Algebraic G…
In physics, two systems that radically differ at short scales can exhibit strikingly similar macroscopic behaviour: they are part of the same long-distance universality class. Here we apply this viewpoint to geometry and initiate a program…
The central open question of algebraic complexity is whether VP is unequal to VNP, which is saying that the permanent cannot be represented by families of polynomial-size algebraic circuits. For symmetric algebraic circuits, this has been…
The complexity class $\exists\mathbb R$, standing for the complexity of deciding the existential first order theory of the reals as real closed field in the Turing model, has raised considerable interest in recent years. It is well known…
Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…
A geometric realization of the projective completion of the Jordan pair corresponding to a three-graded Lie algebra is given which permits to develop a geometric structure theory of the projective completion. This will be used in Part II of…
We show that the two main reduction notions in arithmetic circuit complexity, p-projections and c-reductions, differ in power. We do so by showing unconditionally that there are polynomials that are VNP-complete under c-reductions but not…
We classify the possible Scott complexities for models of Peano arithmetic. We construct models of particular complexities by first giving a complete Scott analysis of colored linear orderings and constructing models of Peano arithmetic…
We study the homotopy types of spaces of algebraic (rational) maps from real projective spaces into complex projective spaces. In a previous paper we have shown that the inclusion of the first space into the second one is a homotopy…
Some classical graph problems such as finding minimal spanning tree, shortest path or maximal flow can be done efficiently. We describe slight variations of such problems which are shown to be NP-complete. Our proofs use straightforward…
We introduce the notion of universal odd generalized Poisson superalgebra associated to an associative algebra A, by generalizing a construction made in [5]. By making use of this notion we give a complete classification of simple linearly…
Consider a finite dimensional (generally reducible) polynomial representation \rho of GL_n. A projective compactification of GL_n is the closure of \rho(GL_n) in the space of all operators defined up to a factor (this class of spaces can be…
Classification theory and the study of projective varieties which are covered by rational curves of minimal degrees naturally leads to the study of families of singular rational curves. Since families of arbitrarily singular curves are hard…
In this paper, we present a constructive generalization of metric and uniform spaces by introducing a new class of spaces, called cover spaces. These spaces form a topological concrete category with a full reflective subcategory of complete…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
A classical result asserts that the complex projective plane modulo complex conjugation is the 4-dimensional sphere. We generalize this result in two directions by considering the projective planes over the normed real division algebras and…
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate…
We examine categoricity issues for computable algebraic fields. We give a structural criterion for relative computable categoricity of these fields, and use it to construct a field that is computably categorical, but not relatively…
Circuit algebras are a symmetric analogue of Jones's planar algebras introduced to study finite-type invariants of virtual knotted objects. Circuit algebra structures appear, in different forms, across mathematics. This paper provides a…
The circuit equivalence problem of a finite algebra $\mathbf A$ is the computational problem of deciding whether two circuits over $\mathbf A$ define the same function or not. This problem not just generalises the equivalence problem for…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…