Related papers: Complexity Classes as Mathematical Axioms
We classify the computability-theoretic complexity of two index sets of classes of first-order theories: We show that the property of being an $\aleph_0$-categorical theory is $\Pi^0_3$-complete; and the property of being an Ehrenfeucht…
We define and study a new notion of "robust simulations" between complexity classes which is intermediate between the traditional notions of infinitely-often and almost-everywhere, as well as a corresponding notion of "significant…
We prove a complexity dichotomy theorem for all non-negative weighted counting Constraint Satisfaction Problems (CSP). This caps a long series of important results on counting problems including unweighted and weighted graph homomorphisms…
There is no single canonical polynomial-time version of the Axiom of Choice (AC); several statements of AC that are equivalent in Zermelo-Fraenkel (ZF) set theory are already inequivalent from a constructive point of view, and are similarly…
Huayi Chen introduces the notion of an approximable graded algebra, which he uses to prove a Fujita-type theorem in the arithmetic setting, and asked if any such algebra is the graded ring of a big line bundle on a projective variety. This…
Pseudo-holomorphic curves on almost complex manifolds have been much more intensely studied than their "dual" objects, the plurisubharmonic functions. These functions are defined classically by requiring that the restriction to each…
Let p be a prime number and f an overconvergent p-adic automorphic form on a definite unitary group which is split at p. Assume that f is of "classical weight" and that its Galois representation is crystalline at places dividing p, then f…
We explain and explore class-theoretic potentialism -- the view that one can always individuate more classes over a set-theoretic universe. We examine some motivations for class-theoretic potentialism, before proving some results concerning…
To characterize categorical constraints - associativity, commutativity and monoidality - in the context of quasimonoidal categories, from a cohomological point of view, we define the notion of a parity (quasi)complex. Applied to groups…
In this paper we introduce constructible analogs of the discrete complexity classes $\mathbf{VP}$ and $\mathbf{VNP}$ of sequences of functions. The functions in the new definitions are constructible functions on $\mathbb{R}^n$ or…
We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…
The paper "Is Complexity an Illusion?" (Bennett, 2024) provides a formalism for complexity, learning, inference, and generalization, and introduces a formal definition for a "policy". This reply shows that correct policies do not exist for…
We develop a generalization of manifold calculus in the sense of Goodwillie-Weiss where the manifold is replaced by a simplicial complex. We consider functors from the category of open subsets of a fixed simplical complex into the category…
We give a self-contained introduction to accessible categories and how they shed light on both model- and set-theoretic questions. We survey for example recent developments on the study of presentability ranks, a notion of cardinality…
Some aspects of the development of physics and the mathematics set one think about relation between complex numbers and reality around us. If number to spot as the relation of two quantities, from the fact of existence of complex numbers…
This paper presents a new representation of natural numbers and discusses its consequences for computability and computational complexity. The paper argues that the introduction of the first Peano axiom in the traditional definition of…
An important objective of research in counting complexity is to understand which counting problems are approximable. In this quest, the complexity class TotP, a hard subclass of #P, is of key importance, as it contains self-reducible…
The term complexity derives etymologically from the Latin plexus, which means interwoven. Intuitively, this implies that something complex is composed by elements that are difficult to separate. This difficulty arises from the relevant…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
A notion of general manifolds is introduced. It covers all usual manifolds in mathematics. Essentially, it is a way how to get a bigger 'fibration' over a site which locally coincides with a given one. An enrichment with generalized…