Related papers: Theories for TC0 and Other Small Complexity Classe…
We review and compare five ways of assigning totally ordered sizes to subsets of the natural numbers: cardinality, infinite lottery logic with mirror cardinalities, natural density, generalised density, and $\alpha$-numerosity. Generalised…
We identify the class of elementary groups: the smallest class of totally disconnected locally compact second countable (t.d.l.c.s.c.) groups that contains the profinite groups and the discrete groups, is closed under group extensions of…
We introduce and investigate a topological version of St\"ackel's 1907 characterization of finite sets, with the goal of obtaining an interesting notion that characterizes usual compactness (or a close variant of it). Define a $T_2$…
This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…
In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…
Binary functions are a generalisation of the cocircuit spaces of binary matroids to arbitrary functions. Every rank function is assigned a binary function, and the deletion and contraction operations of binary functions generalise matroid…
Two rooted locally finite trees are considered equivalent if both can be embedded into each other as topological minors by means of tree-order preserving mappings. By exploiting Nash-William's Theorem, Matthiesen provided a non-constructive…
Constraint satisfaction problems have been studied in numerous fields with practical and theoretical interests. In recent years, major breakthroughs have been made in a study of counting constraint satisfaction problems (or #CSPs). In…
Complexity theory can be viewed as the study of the relationship between computation and applications, understood the former as complexity classes and the latter as problems. Completeness results are clearly central to that view. Many…
Simpson and the second author asked whether there exists a characterization of the natural numbers by a second-order sentence which is provably categorical in the theory RCA$^*_0$. We answer in the negative, showing that for any…
We investigate the complexity of uniform OR circuits and AND circuits of polynomial-size and depth. As their name suggests, OR circuits have OR gates as their computation gates, as well as the usual input, output and constant (0/1) gates.…
We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…
The Tate conjecture has two parts: i) Tate classes are linear combination of algebraic classes, ii) semisimplicity of Galois representations (for smooth projective varieties). B. Moonen proved that i) implies ii) in characteristic 0, using…
The class of functions from the integers to the integers computable in polynomial time has been characterized recently using discrete ordinary differential equations (ODE), also known as finite differences. In the framework of ordinary…
The weights for a finite group G with respect to a prime number p where introduced by Jon Alperin, in order to formulate his celebrated conjecture affirming that that the number of G-conjugacy classes of weights of G coincides with the…
A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…
Given a space $X$, the topological complexity of $X$, denoted by $TC(X)$, can be viewed as the minimum number of "continuous rules" needed to describe how to move between any two points in $X$. Given subspaces $Y_1$ and $Y_2$ of $X$, there…
Let V be a variety of algebras of some type. An interest to describing automorphisms of the category C of finitely generated free V-algebras was inspired in connection with development of universal algebraic geometry founded by B. Plotkin.…
We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…