Related papers: Complexity Classes as Mathematical Axioms II
We prove complexity dichotomies for \#CSP problems (not necessarily symmetric) with Boolean domain and complex range on several typical minor-closed graph classes. These dichotomies give a complete characterization of the complexity of…
We formulate physically-motivated axioms for a physical theory which for systems with a finite number of degrees of freedom uniquely lead to Quantum Mechanics as the only nontrivial consistent theory. Complex numbers and the existence of…
We present results from numerical studies of supervised learning operations in recurrent networks considered as graphs, leading from a given set of input conditions to predetermined outputs. Graphs that have optimized their output for…
We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…
We discuss some consequences of the fact that symmetry groups appearing in compactified (super-)gravity may be non-simply connected. The possibility to add fermions to a theory results in a simple criterion to decide whether a 3-dimensional…
It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…
Generalized contextuality is a hallmark of nonclassical theories like quantum mechanics. Yet, three fundamental computational problems concerning its decidability and complexity remain open. First, determining the complexity of deciding if…
The polynomial hierarchy plays a central role in classical complexity theory. Here, we define a quantum generalization of the polynomial hierarchy, and initiate its study. We show that not only are there natural complete problems for the…
It is shown that every knot or link is the set of complex tangents of a 3-sphere smoothly embedded in the three-dimensional complex space. We show in fact that a one-dimensional submanifold of a closed orientable 3-manifold can be realised…
These are the notes of my lectures at the 1996 European Congress of Mathematicians. {} Polynomials appear in mathematics frequently, and we all know from experience that low degree polynomials are easier to deal with than high degree ones.…
We present a process semantics for the purely additive fragment of linear logic in which formulas denote protocols and (equivalence classes of) proofs denote multi-channel concurrent processes. The polycategorical model induced by this…
Constraints on spin observables coming from discrete symmetries such as P, C, T and identical particles may be divided in two types: 1) classical ones, which insure the invariance of the cross sections under the symmetry operation; 2)…
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…
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…
We present a cocycle model for elliptic cohomology with complex coefficients in which methods from 2-dimensional quantum field theory can be used to rigorously construct cocycles. For example, quantizing a theory of vector bundle-valued…
In the first part of this paper we present a theory of proof nets for full multiplicative linear logic, including the two units. It naturally extends the well-known theory of unit-free multiplicative proof nets. A linking is no longer a set…
A survey of some results and open questions related to the following algebraic invariants of compact complex manifolds, that can be obtained from differential forms: cohomology groups, Chern classes, rational homotopy groups, and higher…
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…
In this paper we introduce the concepts of higher equivariant and invariant topological complexity; and study their properties. Then we compare them with equivariant LS-category. We give lower and upper bounds for these new invariants. We…
Examples of non-trivial higher string topology operations have been regrettably rare in the literature. In this paper, working in the context of string topology of classifying spaces, we provide explicit calculations of a wealth of…