Related papers: Essential countability of treeable equivalence rel…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
These lecture notes focus on a recent result of Mike Hochman: an arbitrary standard Borel system can be embedded into a mixing Markov with equal entropy, respecting all invariant probability measures, with two exceptions: those carried by…
For analytic nonlinear systems of ordinary differential equations, under some non-degeneracy and integrability conditions we prove that the formal exponential series solutions (trans-series) at an irregular singularity of rank one are Borel…
We resolve the topological version of the Erd\H{o}s Similarity conjecture introduced previously by Gallagher, Lai and Weber. We show that a set is topologically universal on ${\mathbb R}$ if and only if it is of strong measure zero. As a…
We present a method for constructing countable models of small theories and apply it to prove theorems on the maximal number of countable non-isomorphic models of linearly ordered theories.
Working in the framework of Borel reducibility, we study various notions of embeddability between groups. We prove that the embeddability between countable groups, the topological embeddability between (discrete) Polish groups, and the…
We find all finite Ockham algebras that admit only finitely many compatible relations (modulo a natural equivalence). Up to isomorphism and symmetry, these Ockham algebras form two countably infinite families: one family consists of the…
Almost isomorphism is an equivalence relation on countable state Markov shifts which provides a strong version of Borel conjugacy; still, for mixing SPR shifts, entropy is a complete invariant of almost isomorphism. In this paper, we…
We establish several optimal estimates for exceptional parameters in the projection of fractal measures: (1) For a parametric family of self-similar measures satisfying a transversality condition, the set of parameters leading to a…
For $f \colon [0,1] \rar \real^{+}$, consider the relation $\mathbf{E}_{f}$ on $[0,1]^{\omega}$ defined by $(x_{n}) \mathbf{E}_{f} (y_{n}) \Leftrightarrow \sum_{n < \omega} f(|y_{n} - x_{n}|) < \infty.$ We study the Borel reducibility of…
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…
This is mainly an expository text on the Haagerup property for countable groupoids equipped with a quasi-invariant measure, aiming to complete an article of Jolissaint devoted to the study of this property for probability measure preserving…
The literature provides dichotomies involving homomorphisms (like the G 0 dichotomy) or reductions (like the characterization of sets potentially in a Wadge class of Borel sets, which holds on a subset of a product). However, part of the…
We describe certain sufficient conditions for an infinitely divisible probability measure on a class of connected Lie groups to be embeddable in a continuous one-parameter convolution semigroup of probability measures. (Theorem 1.3). This…
We prove a pointwise ergodic theorem for quasi-probability-measure-preserving (quasi-pmp) locally countable measurable graphs, equivalently, Schreier graphs of quasi-pmp actions of countable groups. For ergodic graphs, the theorem gives an…
The game tree languages can be viewed as an automata-theoretic counterpart of parity games on graphs. They witness the strictness of the index hierarchy of alternating tree automata, as well as the fixed-point hierarchy over binary trees.…
Let $E$ be an analytic equivalence relation on a Polish space. We introduce a framework for studying the possible "reasonable" complete classifications and the complexity of possible classifying invariants for $E$, such that: (1) the…
We prove that the homeomorphism relation between compact spaces can be continuously reduced to the homeomorphism equivalence relation between absolute retracts which strengthens and simplifies recent results of Chang and Gao, and Cie\'sla.…
A relation consisting of tuples annotated by an element of a monoid K is called a K-relation. A K-database is a collection of K-relations. In this paper, we study entailment of inclusion dependencies over K-databases, where K is a positive…
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}$.…