Related papers: Nonmeasurable sets in tree structures and Ellentuc…
It is proved that no non-meager subspace of the space $[\omega]^\omega$ equipped with the Ellentuck topology does admit a Kuratowski partition, that is such a subset cannot be covered by a family $\mathfrak{F}$ of disjoint relatively meager…
We show that large sets in Ellentuck topology (i.e. sets which are not nowhere Ramsey) do not admit Kuratowski's partition. The similar result is true for the Sacks real forcing.
In this paper we consider a notion of nonmeasurablity with respect to Marczewski and Marczewski-like tree ideals $s_0$, $m_0$, $l_0$, and $cl_0$. We show that there exists a subset $A$ of the Baire space $\omega^\omega$ which is $s$-, $l$-,…
In 1935 K. Kuratowski posed the problem whether a function f:X ! Y , (X is completely metrizable and Y is metrizable), with the property that a preimage of each open has the Baire property, is continuous apart from a meager set. This paper…
In this paper we consider nonmeasurablity with respect to sigma-ideals defined be trees. First classical example of such ideal is Marczewski ideal s_0. We will consider also ideal l_0 defined by Laver trees and m_0 defined by Miller trees.…
A long-standing conjecture of Lapidus asserts that, under certain conditions, a self-similar fractal set is not Minkowski measurable if and only if it is of lattice-type. For self-similar sets in $\mathbb{R}$, the Lapidus conjecture has…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
In this paper we present a few properties of $K$-partitions, which are partitions of Baire spaces such that all subfamilies of such a partition sum to a set with the Baire property. Among the result proven we have general existence result…
The first author introduced a measure of compactness for families of sets, relative to a class of filters, in the context of convergence approach spaces. We characterize a variety of maps (types of quotient maps, closed maps, and variants…
In this paper, we prove a result on nonmeasurable subgroups in commutative Polish groups with respect to more generalized structures than sigma-finite measures.
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
We present a construction, called the limit of a tree system of spaces (or, less formally, a tree of spaces). The construction is designed to produce compact metric spaces that resemble fractals, out of more regular spaces, such as closed…
We provide a short combinatorial proof of Cayley's formula by means of a bijective map to an outcome space of an urn-drawing problem. Furthermore we introduce an algebraic structure on the set of labeled trees, which provides a more…
Let $f$ be a function from a metric space $Y$ to a separable metric space $X$. If $f$ has the Baire property, then it is continuous apart a 1st category set. In 1935, Kuratowski asked whether the separability requirement could be lifted. A…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
In this short paper, Kuratowski problem will be investigated in vector space. The highest number of distinct sets that can be generated from one convex set in linear space by repeatedly applying algebraic closure and complement in any order…
We establish a cutting lemma for definable families of sets in distal structures, as well as the optimality of the distal cell decomposition for definable families of sets on the plane in $o$-minimal expansions of fields. Using it, we…
The goal of this work is to decompose random populations with a genealogy in subfamilies of a given degree of kinship and to obtain a notion of infinitely divisible genealogies. We model the genealogical structure of a population by…
We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…