English
Related papers

Related papers: Partitioning the real line into Borel sets

200 papers

It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…

Logic · Mathematics 2016-09-07 Martin Goldstern , Saharon Shelah

Results of Sierpinski and others have shown that certain finite-dimensional product sets can be written as unions of subsets, each of which is "narrow" in a corresponding direction; that is, each line in that direction intersects the subset…

Logic · Mathematics 2021-02-09 Randall Dougherty

We continue the investigations in the author's book on cardinal arithmetic, assuming some knowledge of it. We deal with the cofinality of (S_{<= aleph_0}(kappa), subseteq) for kappa real valued measurable (Section 3), densities of box…

Logic · Mathematics 2016-09-06 Saharon Shelah

A \emph{hull} of $A \subset [0,1]$ is a set $H$ containing $A$ such that $\lambda^*(H)=\lambda^*(A)$. We investigate all four versions of the following problem. Does there exist a monotone (wrt. inclusion) map that assigns a…

Classical Analysis and ODEs · Mathematics 2011-09-23 Márton Elekes , András Máthé

We study the complexity of the classification problem for countable models of set theory (ZFC). We prove that the classification of arbitrary countable models of ZFC is Borel complete, meaning that it is as complex as it can conceivably be.…

Logic · Mathematics 2020-07-21 John Clemens , Samuel Coskey , Samuel Dworetzky

We show that the Dual Borel Conjecture implies that ${\mathfrak d}> \aleph_1$ and find some topological characterizations of perfectly meager and universally meager sets.

Logic · Mathematics 2007-05-23 Tomek Bartoszynski

Let $E \subseteq \mathbb{R}^n$ be a union of line segments and $F \subseteq \mathbb{R}^n$ the set obtained from $E$ by extending each line segment in $E$ to a full line. Keleti's line segment extension conjecture posits that the Hausdorff…

Classical Analysis and ODEs · Mathematics 2025-03-11 Ryan E. G. Bushling , Jacob B. Fiedler

We investigate the computational complexity of computing the Hausdorff distance. Specifically, we show that the decision problem of whether the Hausdorff distance of two semi-algebraic sets is bounded by a given threshold is complete for…

Computational Geometry · Computer Science 2022-08-26 Paul Jungeblut , Linda Kleist , Tillmann Miltzow

We consider, for infinite cardinals kappa and alpha <= kappa^+, the group Pi(kappa,< alpha) of sequences of integers, of length kappa, with non-zero entries in fewer than alpha positions. Our main result tells when Pi(kappa,< alpha) can be…

Logic · Mathematics 2007-05-23 Andreas Blass , Saharon Shelah

We show that, consistently, there is a Borel set which has uncountably many pairwise very non-disjoint translations, but does not allow a perfect set of such translations.

Logic · Mathematics 2017-11-15 Andrzej Roslanowski , Vyacheslav Rykov

We consider a class of $n^{\text{th}}$-order linear ordinary differential equations with a large parameter $u$. Analytic solutions of these equations can be described by (divergent) formal series in descending powers of $u$. We demonstrate…

Classical Analysis and ODEs · Mathematics 2024-09-30 Gergő Nemes

Following Laczkovich we consider the partially ordered set $\iB_1(\RR)$ of Baire class 1 functions endowed with the pointwise order, and investigate the order types of the linearly ordered subsets. Answering a question of Komj\'ath and…

Logic · Mathematics 2011-09-29 Márton Elekes , Juris Steprāns

We investigate $\mathcal F$-Borel topological spaces. We focus on finding out how a~complexity of a~space depends on where the~space is embedded. Of a~particular interest is the~problem of determining whether a~complexity of given space $X$…

General Topology · Mathematics 2020-02-24 Vojtěch Kovařík

We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…

Combinatorics · Mathematics 2025-01-20 Michele Graffeo , Sergej Monavari , Riccardo Moschetti , Andrea T. Ricolfi

Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…

Logic · Mathematics 2022-01-28 Gabriel Goldberg

We prove that it is relatively consistent with $\mathrm{ZFC}$ that every strong measure zero subset of the real line is meager-additive while there are uncountable strong measure zero sets (i.e., Borel's conjecture fails). This answers a…

Logic · Mathematics 2021-04-08 Daniel Calderón

Given an analytic equivalence relation, we tend to wonder whether it is Borel. When it is non Borel, there is always the hope it will be Borel on a "large" set -- nonmeager or of positive measure. That has led Kanovei, Sabok and Zapletal to…

Logic · Mathematics 2016-05-31 Ohad Drucker

We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lov\'asz, Catlin, Kostochka and Rabern.

Combinatorics · Mathematics 2011-07-12 Landon Rabern

It is shown that if $A \subseteq \mathbb{R}^3$ is a Borel set of Hausdorff dimension $\dim A>1$, and if $\rho_{\theta}$ is orthogonal projection to the line spanned by $( \cos \theta, \sin \theta, 1 )$, then $\rho_{\theta}(A)$ has positive…

Classical Analysis and ODEs · Mathematics 2024-10-15 Terence L. J. Harris

A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. An amorphous set is an infinite set that cannot be partitioned into two infinite subsets. A strictly…

Logic · Mathematics 2025-10-16 Yifan Hu , Ruihuan Mao , Guozhen Shen