Related papers: Finiteness classes arising from Ramsey-theoretic s…
We prove a rank-finiteness conjecture for modular categories: up to equivalence, there are only finitely many modular categories of any fixed rank. Our technical advance is a generalization of the Cauchy theorem in group theory to the…
The standard axioms of set theory, the Zermelo-Fraenkel axioms (ZFC), do not suffice to answer all questions in mathematics. While this follows abstractly from Kurt G\"odel's famous incompleteness theorems, we nowadays know numerous…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We discuss in the context of finite extensions two classical theorems of Takahasi and Howson on subgroups of free groups. We provide bounds for the rank of the intersection of subgroups within classes of groups such as virtually free…
We introduce and study a natural class of fields in which certain first-order definable sets are existentially definable, and characterise this class by a number of equivalent conditions. We show that global fields belong to this class, and…
This paper provides a complete suite of axioms for a version of set theory that I call Explication. Explication borrows from the two most prominent existing systems of set theory. Explication starts with class variables. After several…
We study the preservation of certain properties under products of classes of finite structures. In particular, we examine indivisibility, definable self-similarity, the amalgamation property, and the disjoint n-amalgamation property. We…
We generalize the finiteness theorem for the locus of Hodge classes with fixed self-intersection number, due to Cattani, Deligne, and Kaplan, from Hodge classes to self-dual classes. The proof uses the definability of period mappings in the…
We show that if all collections of infinite subsets of $\N$ have the Ramsey property, then there are no infinite maximal almost disjoint (mad) families. This solves a long-standing problem going back to Mathias \cite{mathias}. The proof…
We show that Ramsey theory, a domain presently conceived to guarantee the existence of large homogeneous sets for partitions on k-tuples of words (for every natural number k) over a finite alphabet, can be extended to one for partitions on…
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets of objects. The key question in this area, which has important…
Let $X$ be an uncountable Polish space and let $\mathcal{H}$ be the Hindman ideal, that is, the family of all $S\subseteq \omega$ which are not $IP$-sets. For each sequence $x=(x_n)_{n \in \omega}$ taking values in $X$, let…
The theory of finitely supported algebraic structures is related to Pitts theory of nominal sets (by equipping finitely supported sets with finitely supported internal algebraic laws). It represents a reformulation of Zermelo Fraenkel set…
We show that the Ramsey theory of block sequences in infinite-dimensional discrete vector spaces can be parametrized by perfect sets. As special cases, we prove combinatorial dichotomies for definable families of partitions and linear…
We prove a theorem ensuring that the compositions of certain Ramsey families are still Ramsey. As an application, we show that in any finite coloring of $\mathbb{N}$ there is an infinite set $A$ and an as large as desired finite set $B$…
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…
Within the framework of Zermelo-Fraenkel set theory without the Axiom of Choice, we establish equivalents to the assertion "the union of a countable collection of finite sets is countable" in the context of metric spaces, probability…
In contrast to the abundance of "direct" Ramsey results for classes of finite structures (such as finite ordered graphs, finite ordered metric spaces and finite posets with a linear extension), in only a handful of cases we have a…
In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…
Automatic structures are infinite structures that are finitely represented by synchronized finite-state automata. This paper concerns specifically automatic structures over finite words and trees (ranked/unranked). We investigate the…