Related papers: Complexity Classes as Mathematical Axioms

In [1, arXiv:1102.1844] the author disputes the conclusion of our paper [2, arXiv:1006.0714]. He claims that the Feynman graphs of three dimensional group field theory always represent pseudo manifolds. However, [1] uses a different…

We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…

The P versus NP problem is addressed in a context of provability and limitations on the possibility of finding sound axioms for formal theories. It is shown that if the term "constructible theory" is defined in a way which satisfies certain…

Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group…

The theory of $N$-complexes is a generalization of both ordinary chain complexes and graded objects. Hence it yields deeper insight in the structure of these and offers a broader range of applications. This work generalizes the tensor…

We present an approach to non-uniform complexity in which single-pass instruction sequences play a key part, and answer various questions that arise from this approach. We introduce several kinds of non-uniform complexity classes. One kind…

We consider simplicial sets equipped with a notion of smallness, and observe that this slight "topological" extension of the "algebraic" simplicial language allows a concise reformulation of a number of classical notions in topology, e.g.…

For an elliptic complex of first order differential operators on a smooth manifold, we define a system of two equations which can be thought of as abstract Maxwell equations. The formal theory of this system proves to be very similar to…

Mazur, Kapranov, Reznikov, and others developed ``Arithmetic Topology,'' a theory describing some surprising analogies between 3-dimensional topology and number theory, which can be summarized by saying that knots are like prime numbers. We…

Abstraction is a powerful idea widely used in science, to model, reason and explain the behavior of systems in a more tractable search space, by omitting irrelevant details. While notions of abstraction have matured for deterministic…

We give a syntactic characterization of abstract elementary classes (AECs) closed under intersections using a new logic with a quantifier for isomorphism types that we call structural logic: we prove that AECs with intersections correspond…

In low dimensional topology, we have some invariants defined by using solutions of some nonlinear elliptic operators. The invariants could be understood as Euler class or degree in the ordinary cohomology, in infinite dimensional setting.…

We show that the satisfiability problem for the quantifier-free theory of product structures with the equicardinality relation is in NP. As an application, we extend the combinatory array logic fragment to handle cardinality constraints.…

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 illustrate the generative power of the lifting property (orthogonality of morphisms in a category) as means of defining natural elementary mathematical concepts by giving a number of examples in various categories, in particular showing…

We improve upon Huntington's affine geometry by showing that his independence proofs can be, in some cases, simplified. We carry out a systematic investigation of the strict notion of betweenness that Huntington employs (the three arguments…

We introduce a geometric invariant, called finite decomposition complexity (FDC), to study topological rigidity of manifolds. We prove for instance that if the fundamental group of a compact aspherical manifold M has FDC, and if N is…

In the spirit of topological entropy we introduce new complexity functions for general dynamical systems (namely groups and semigroups acting on closed manifolds) but with an emphasis on the dynamics induced on simplicial complexes. For…

We relate the Andrews-Curtis conjecture to the triviality problem for balanced presentations of groups using algorithms from 3-manifold topology. Implementing this algorithm could lead to counterexamples to the Andrews-Curtis conjecture.

We prove that a space whose topological complexity equals 1 is homotopy equivalent to some odd-dimensional sphere. We prove a similar result, although not in complete generality, for spaces X whose higher topological complexity TC_n(X) is…