Related papers: On minimal non-potentially closed subsets of the p…
We prove that for each partition of the Lobachevsky plane into finitely many Borel pieces one of the cells of the partition contains an unbounded centrally symmetric subset.
There are certain countably generated sigma-algebras of sets in the real line which do not admit any non-zero, sigma-finite, diffused (or, continuous) measure. Such countably generated sigma-algebras can be obtained by the use of some…
We study the descriptive complexity of sets of points defined by placing restrictions on statistical behaviour of their orbits in dynamical systems on Polish spaces. A particular examples of such sets are the set of generic points of a…
This survey paper deals with upper and lower bounds on the number of $k$-matchings in regular graphs on $N$ vertices. For the upper bounds we recall the upper matching conjecture which is known to hold for perfect matchings. For the lower…
In this paper, we investigate Polish semigroup topologies on the endomorphism monoids $\operatorname{End}(\mathbb{N},\leq)$ and $\operatorname{End}(\mathbb{Z},\leq)$. We introduce a new structural condition, property $\mathbb{XX}$, which…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
A subset of vertices of a graph is minimal if, within all subsets of the same size, its vertex boundary is minimal. We give a complete, geometric characterization of minimal sets for the planar integer lattice X. Our characterization…
We first explain how to endow the space of subequivalence relations of any non-singular countable equivalence relation with a Polish topology, extending the framework of Kechris' recent monograph on subequivalence relations of probability…
A partially embedded graph (or PEG) is a triple (G,H,\H), where G is a graph, H is a subgraph of G, and \H is a planar embedding of H. We say that a PEG (G,H,\H) is planar if the graph G has a planar embedding that extends the embedding \H.…
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…
The first part of these notes give an introduction to the theory of Polish group actions on compact Hausdorff spaces, leading up to a proof of the Kechris-Pestov-Todorcevic correspondence and discussions of properties of universal minimal…
A series of recent papers by Bergfalk, Lupini and Panagiotopoulus developed the foundations of a field known as `definable algebraic topology,' in which classical cohomological invariants are enriched by viewing them as groups with a Polish…
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…
In the aftermath of the Robertson--Seymour Graph Minor Theorem, Thomas conjectured that the countable graphs are well-quasi-ordered under the minor relation. We prove that this conjecture, when restricted to graphs with no infinite paths…
Fedorchuk's fully closed (continuous) maps and resolutions are applied in constructions of non-metrizable higher-dimensional analogues of Anderson, Choquet, and Cook's continua. Certain theorems on dimension-lowering maps are proved for…
In a directed graph, a kernel is a subset of vertices that is both stable and absorbing. Not all digraphs have a kernel, but a theorem due to Boros and Gurvich guarantees the existence of a kernel in every clique-acyclic orientation of a…
We develop a novel technique, which we call poset splitting, that allows us to solve two open problems regarding minimality of finite models of spaces: the nonexistence of a finite model of the real projective plane with fewer than 13…
We study the extension of the Kechris-Solecki-Todorcevic dichotomy on analytic graphs to dimensions higher than 2. We prove that the extension is possible in any dimension, finite or infinite. The original proof works in the case of the…
In the zero-dimensional systems, the Bratteli-Vershik models can be built upon certain closed sets that are called `quasi-sections' in this article. There exists a bijective correspondence between the topological conjugacy classes of…
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.