Related papers: An order analysis of hyperfinite Borel equivalence…
In this work, we study several equivalence relations induced from the partitions of the sets of words of finite length. We have results on words over finite fields extending the work of Bacher (2002, Europ. J. Combinatorics, {\bf 23},…
A long standing open problem in the theory of hyperfinite equivalence relations asks if the orbit equivalence relation generated by a Borel action of a countable amenable group is hyperfinite. In this paper we show that this question has a…
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…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
The motivation of this article is to introduce a kind of orbit equivalence relations which can well describe structures and properties of Polish groups from the perspective of Borel reducibility. Given a Polish group $G$, let $E(G)$ be the…
In 1986 Stanley associated to a poset the order polytope. The close interplay between its combinatorial and geometric properties makes the order polytope an object of tremendous interest. Double posets were introduced in 2011 by Malvenuto…
We consider countable Borel equivalence relations on quotient Borel spaces. We prove a generalization of the Feldman-Moore representation theorem, but provide some examples showing that other very simple properties of countable equivalence…
The main goal of this paper is to develop a concept of approximate differentiability of higher order for subsets of the Euclidean space that allows to characterize higher order rectifiable sets, extending somehow well known facts for…
We prove, in ZF+$\bf\Sigma^1_2$-determinacy, that for any analytic equivalence relation $E$, the following three statements are equivalent: (1) $E$ does not have perfectly many classes, (2) $E$ satisfies hyperarithmetic-is-recursive on a…
The superamalgamation property is a strong form of the amalgamation property which applies to ordered structures; it has found many applications in algebraic logic. We show that superamalgamation has some interest also from the pure…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…
We give a new short proof of the theorem due to Marquis and Sabok, which states that the orbit equivalence relation induced by the action of a finitely generated hyperbolic group on its Gromov boundary is hyperfinite. Our methods permit…
If $X$ is an analytic metric space satisfying a very mild doubling condition, then for any finite Borel measure $\mu$ on $X$ there is a set $N\subseteq X$ such that $\mu(N)>0$, an ultrametric space $Z$ and a Lipschitz bijection $\phi:N\to…
A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of…
We characterize Borel line graphs in terms of 10 forbidden induced subgraphs, namely the 9 finite graphs from the classical result of Beineke together with a 10th infinite graph associated to the equivalence relation $\mathbb{E}_0$ on the…
The notions of equivalence and strict equivalence for order one differential equations are introduced. The more explicit notion of strict equivalence is applied to examples and questions concerning autonomous equations and equations having…
We prove a number of results motivated by global questions of uniformity in computability theory, and universality of countable Borel equivalence relations. Our main technical tool is a game for constructing functions on free products of…
In this paper, we construct a compact subset of the real plane whose path-connectedness equivalence relation is Borel bireducible to a nonsmooth hyperfinite Borel equivalence relation. This answers a question of \cite{bec98}.
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…
We prove the Borel Conjecture for a class of groups containing word-hyperbolic groups and groups acting properly, isometrically and cocompactly on a finite dimensional CAT(0)-space.