Related papers: Geometric Complexity Theory II: Towards explicit o…

We study the computational complexity of sequences of projective varieties. We define analogues of the complexity classes P and NP for these and prove the NP-completeness of a sequence called the universal circuit resultant. This is the…

We present an argument due to Thom to formulate a priori cohomology obstructions for a projective variety to admit an embedded resolution of singularities, and generalize the argument to a field of characteristic $p > 0$. We show that these…

Understanding the difference between group orbits and their closures is a key difficulty in geometric complexity theory (GCT): While the GCT program is set up to separate certain orbit closures, many beautiful mathematical properties are…

We unify problems about the equivariant geometry of symmetric quiver representation varieties, in the finite type setting, with the corresponding problems for symmetric varieties $GL(n)/K$ where $K$ is an orthogonal or symplectic group. In…

We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…

This paper establishes the separation of complexity classes $\mathbf{P}$ and $\mathbf{NP}$ through a novel homological algebraic approach grounded in category theory. We construct the computational category $\mathbf{Comp}$, embedding…

In the first section we discuss Morita invariance of differentiable/algebroid cohomology. In the second section we present an extension of the van Est isomorphism to groupoids. This immediately implies a version of Haefliger's conjecture…

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…

Finite-order invariants of knots in arbitrary 3-manifolds (including non-orientable ones) are constructed and studied by methods of the topology of discriminant sets. Obstructions to the integrability of admissible weight systems to…

As it follows from G\"odel's incompleteness theorems, any consistent formal system of axioms and rules of inference should imply a true unprovable statement. Actually, this fundamental principle can be efficiently applicable in…

Planar graphs can be represented as intersection graphs of different types of geometric objects in the plane, e.g., circles (Koebe, 1936), line segments (Chalopin \& Gon{\c{c}}alves, 2009), \textsc{L}-shapes (Gon{\c{c}}alves et al, 2018).…

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

We study the variety membership testing problem in the case when the variety is given as an orbit closure and the ambient space is the set of all 3-tensors. The first variety that we consider is the slice rank variety, which consists of all…

Let $R$ be an algebra over a ring $\Bbbk$, $T$ an $R$-algebra, $M$ a finitely generated projective $R$-module, and $N$ a $T$-module. Let $G$ be a linearly reductive group scheme over $\Bbbk$ equipped with a representation…

A general problem in complex cobordism theory is to find useful representatives for cobordism classes. One particularly convenient class of complex manifolds consists of smooth projective toric varieties. The bijective correspondence…

This paper is motivated by questions such as P vs. NP and other questions in Boolean complexity theory. We describe an approach to attacking such questions with cohomology, and we show that using Grothendieck topologies and other ideas from…

In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…

This paper gives a uniform, self-contained and direct approach to a variety of obstruction-theoretic problems on manifolds of dimension 7 and 6. We give necessary and sufficient cohomological criteria for the existence of various…

The subject logic in computer science should entail proof theoretic applications. So the question arises whether open problems in computational complexity can be solved by advanced proof theoretic techniques. In particular, consider the…

We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…