相关论文: Theories for TC0 and Other Small Complexity Classe…

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

We describe classes of toric varieties of codimension 2 which are either minimally defined by 3 binomial equations over any algebraically closed field, or are set-theoretic complete intersections in exactly one positive characteristic.

An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…

This paper investigates second-order representations in the sense of Kawamura and Cook for spaces of integrable functions that regularly show up in analysis. It builds upon prior work about the space of continuous functions on the unit…

Subclasses of TFNP (total functional NP) are usually defined by specifying a complete problem, which is necessarily in TFNP, and including all problems many-one reducible to it. We study two notions of how a TFNP problem can be reducible to…

We define counting classes #P_R and #P_C in the Blum-Shub-Smale setting of computations over the real or complex numbers, respectively. The problems of counting the number of solutions of systems of polynomial inequalities over R, or of…

The classifying topos of a geometric theory is a topos such that geometric morphisms into it correspond to models of that theory. We study classifying toposes for different infinitary logics: first-order, sub-first-order (i.e. geometric…

Holant problems are a family of counting problems on graphs, parametrised by sets of complex-valued functions of Boolean inputs. Holant^c denotes a subfamily of those problems, where any function set considered must contain the two unary…

Throughout, $T$ denotes a complete first-order theory in a countable language $L$ that has infinite models and $I(\aleph_0,T)$ denotes the number of countable models of $T$, up to an isomorphism. To determine $I(\aleph_0,T)$, it suffices to…

One of the prominent current challenges in complexity theory is the attempt to prove lower bounds for $TC^0$, the class of constant-depth, polynomial-size circuits with majority gates. Relying on the results of Williams (2013), an appealing…

Implicit computational complexity is a lively area of theoretical computer science, which aims to provide machine-independent characterizations of relevant complexity classes. % for uniformity with subsequent uses >> 1960s (but feel free to…

Finite topological spaces became much more essential in topology, with the development of computer science. The task of this paper is to study and investigate some properties of such spaces with the existence of an ordered relation between…

We determine the computational complexity of approximately counting the total weight of variable assignments for every complex-weighted Boolean constraint satisfaction problem (or CSP) with any number of additional unary (i.e., arity 1)…

Discrete optimisation problems arise in many different areas and are studied under many different names. In many such problems the quantity to be optimised can be expressed as a sum of functions of a restricted form. Here we present a…

We present an extension to the $\mathtt{mathlib}$ library of the Lean theorem prover formalizing the foundations of computability theory. We use primitive recursive functions and partial recursive functions as the main objects of study, and…

We prove new results about the remarkable infinite simple groups introduced by Richard Thompson in the 1960s. We define the groups as partial transformation groups and we give a faithful representation in the Cuntz C*-algebra. For the…

The objective of this article is to formalize the definition of NP problems. We construct a mathematical model of discrete problems as independence systems with weighted elements. We introduce two auxiliary sets that characterize the…

The category $\bcalNT$ was defined in \cite{Lobos2}, it is a category whose objects are commutative nil graded algebras over a field, defined by presentation encoded by triangular matrices. A natural problem related to this category is to…

The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…

In the paper the foundation of the $k$-orbit theory is developed. The theory opens a new simple way to the investigation of groups and multidimensional symmetries. The relations between combinatorial symmetry properties of a $k$-orbit and…