相关论文: A syntactic approach to Borel functions: Some exte…

Let $\bf\Gamma$ be a Borel class, or a Wadge class of Borel sets, and $2\leq d\leq\omega$ a cardinal. We study the Borel subsets of ${\mathbb R}^d$ that can be made $\bf\Gamma$ by refining the Polish topology on the real line. These sets…

We prove a Borel version of the local lemma, i.e. we show that, under suitable assumptions, if the set of variables in the local lemma has a structure of a Borel space, then there exists a satisfying assignment which is a Borel function.…

For each $a \in \mathbb{R}$, we define a Borel function $f_a : \mathbb{R} \to \mathbb{R}$ which encodes $a$ in a certain sense. We show that for each Borel $g : \mathbb{R} \to \mathbb{R}$, $f_a \cap g = \emptyset$ implies $a \in…

We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results…

In the paper we investigate Borel classes of multivalued functions of two variables. In particular we generalize a result of Marczewski and Ryll-Nardzewski concerning of real function whose ones of its sections are right-continuous and…

We present the effective version of the theorem about turning Borel sets in Polish spaces into clopen sets while preserving the Borel structure of the underlying space. We show that under some conditions the emerging parameters can be…

A locally checkable labeling problem (LCL) on a group $\Gamma$ asks one to find a labeling of the Cayley graph of $\Gamma$ satisfying a fixed, finite set of "local" constraints. Typical examples include proper coloring and perfect matching…

The Lov\'asz Local Lemma (the LLL for short) is a powerful tool in probabilistic combinatorics that is used to verify the existence of combinatorial objects with desirable properties. Recent years saw the development of various…

The dichotomy discovered by Solecki in \cite{Sol} states that any Baire class 1 function is either $\sigma$-continuous or "includes" the Pawlikowski function $P$. The aim of this paper is to give an argument which is simpler than the…

A dichotomy discovered by Solecki says that a Baire class 1 function from a Souslin space into a Polish space either can be decomposed into countably many continuous functions, or else contains one particular function which cannot be so…

We prove that the existence of a Borel lower density operator (a Borel lifting) with respect to the $\sigma$-ideal of countable sets, for an uncountable Polish space, is equivalent to the Continuum Hypothesis.

The probabilistic method is a technique for proving combinatorial existence results by means of showing that a randomly chosen object has the desired properties with positive probability. A particularly powerful probabilistic tool is the…

We study the class of Borel equivalence relations under continuous reducibility. In particular , we characterize when a Borel equivalence relation with countable equivalence classes is $\Sigma$ 0 $\xi$ (or $\Pi$ 0 $\xi$). We characterize…

In this paper, we show that Frucht's theorem holds in Borel setting. More specifically, we prove that any standard Borel group can be realized as the Borel automorphism group of a Borel graph. A slight modification of our construction also…

We show that a {\it Borel} action of a Polish group on a standard Borel space is Borel isomorphic to a {\it continuous} action of the group on a Polish space, and we apply this result to three aspects of the theory of Borel actions of…

Jayne and Rogers proved that every function from an analytic space into a separable metric space is decomposable into countably many continuous functions with closed domains if and only if the preimage of each $F_\sigma$ set under it is…

We give a full description of the structure under inclusion of all finite level Borel classes of functions, and provide an elementary proof of the well-known fact that not every Borel function can be written as a countable union of…

We prove that no quantifier-free formula in the language of group theory can define the $\aleph_1$-half graph in a Polish group, thus generalising some results from [6]. We then pose some questions on the space of groups of automorphisms of…

In this paper we investigate the extent to which the Lov\'asz Local Lemma (an important tool in probabilistic combinatorics) can be adapted for the measurable setting. In most applications, the Lov\'asz Local Lemma is used to produce a…

In the proof of the classical Borel lemma \cite{eB} by Hayman \cite{wkH}, each continuous increasing function $T(r)\geq1$ satisfies $T\bigl(r+\frac{1}{T(r)}\bigr)<2T(r)$ outside a possible exceptional set of linear measure $2$. We note in…