Related papers: Universal countable Borel quasi-orders

Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…

We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…

We prove the Grothendieck-Serre conjecture for quasi-split reductive groups schemes. Our method involves reducing to the Borel subgroup in order to conclude the result from purity for tori and the structure theorem for unipotent radicals of…

In this paper we extend previous studies of selection principles for families of open covers of sets of real numbers to also include families of countable Borel covers. The main results of the paper could be summarized as follows: 1. Some…

Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…

The topic of this paper is the subtle interplay between countability and representations. In particular, we establish that the definition of countability of a certain set $X$ crucially hinges on the associated equivalence relation $=_{X}$.…

We use quasi-orders to describe the structure of C-groups. We do this by associating a quasi-order to each compatible C-relation of a group, and then give the structure of such quasi-ordered groups. We also reformulate in terms of…

Following Davies, Elekes and Keleti, we study measured sets, i.e. Borel sets $B$ in $\mathbb{R}$ (or in a Polish group) for which there is a translation invariant Borel measure assigning positive and \sigma-finite measure to $B$. We…

We study groups which satisfy Gardner's equidecomposition conjecture for uniformly distributed sets. We prove that an amenable group has this property if and only if it does not admit $(\mathbb{Z}/2\mathbb{Z}) *(\mathbb{Z}/2\mathbb{Z})$ as…

Borel's triangle is an array of integers closely related to the classical Catalan numbers. In this paper we study combinatorial statistics counted by Borel's triangle. We present various combinatorial interpretations of Borel's triangle in…

The aim of this paper is to prove ergodic decomposition theorems for probability measures quasi-invariant under Borel actions of inductively compact groups (Theorem 1) as well as for sigma-finite invariant measures (Corollary 1). For…

We prove several results showing that every locally finite Borel graph whose large-scale geometry is "tree-like" induces a treeable equivalence relation. In particular, our hypotheses hold if each component of the original graph either has…

The regular open subsets of a topological space form a Boolean algebra, where the `join' of two regular open sets is the interior of the closure of their union. A `credence' is a finitely additive probability measure on this Boolean…

A quandle will be called quasi-affine, if it embeds into an affine quandle. Our main result is a characterization of quasi-affine quandles, by group-theoretic properties of their displacement group, by a universal algebraic condition coming…

We assess the descriptive complexity of *bisimilarity* or "equality of behavior" on a family of Markov decision processes over uncountable standard Borel spaces, namely *nondeterministic labelled Markov processes* (NLMP). We show that…

Two of the pillars of combinatorics are the notion of choosing an arbitrary subset of a set with $n$ elements (which can be done in $2^n$ ways), and the notion of choosing a $k$-element subset of a set with $n$ elements (which can be done…

We study the complexity of the classification problem of conjugacy on dynamical systems on some compact metrizable spaces. Especially we prove that the conjugacy equivalence relation of interval dynamical systems is Borel bireducible to…

We prove that faithful traces on separable and nuclear C*-algebras in the UCT class are quasidiagonal. This has a number of consequences. Firstly, by results of many hands, the classification of unital, separable, simple and nuclear…

We consider the posets of equivalence relations on finite sets under the standard embedding ordering and under the consecutive embedding ordering. In the latter case, the relations are also assumed to have an underlying linear order, which…

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…