Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Brendle, Joerg"'
How many permutations are needed so that every infinite-coinfinite set of natural numbers with asymptotic density can be rearranged to no longer have the same density? We prove that the density number $\mathfrak{dd}$, which answers this question, is
Externí odkaz:
http://arxiv.org/abs/2410.21102
We investigate the combinatorial structure of the set of maximal antichains in a Boolean algebra ordered by almost refinement. We also consider the reaping relation and its associated cardinal invariants, focusing in particular on reduced powers of B
Externí odkaz:
http://arxiv.org/abs/2410.18595
Autor:
Brendle, Joerg, Wohofsky, Wolfgang
We show in ZFC that there is no set of reals of size continuum which can be translated away from every set in the Marczewski ideal. We also show that in the Cohen model, every set with this property is countable.
Externí odkaz:
http://arxiv.org/abs/2401.04300
Let $\mathcal{SN}$ be the $\sigma$-ideal of the strong measure zero sets of reals. We present general properties of forcing notions that allow to control of the additivity of $\mathcal{SN}$ after finite support iterations. This is applied to force th
Externí odkaz:
http://arxiv.org/abs/2309.01931
Autor:
Brendle, Joerg
Publikováno v:
RIMS Kokyuroku 2213 (2022), 1-13
This is a survey on the amalgamated limit, a limit construction for complete Boolean algebras in iterated forcing theory, which generalizes both the direct limit and the two-step amalgamation. We focus in particular on examples of the amalgamated lim
Externí odkaz:
http://arxiv.org/abs/2302.05072
Autor:
Brendle, Joerg
We develop iterated forcing constructions dual to finite support iterations in the sense that they add random reals instead of Cohen reals in limit steps. In view of useful applications we focus in particular on two-dimensional "random" iterations, w
Externí odkaz:
http://arxiv.org/abs/2302.05069
We study some strong combinatorial properties of $\textsf{MAD}$ families. An ideal $\mathcal{I}$ is Shelah-Stepr\={a}ns if for every set $X\subseteq{\left[ \omega\right]}^{<\omega}$ there is an element of $\mathcal{I}$ that either intersects every se
Externí odkaz:
http://arxiv.org/abs/2206.14936
Autor:
Brendle, Joerg
A classical theorem of Balcar, Pelant, and Simon says that there is a base matrix of height h, where h is the distributivity number of P(omega)/fin. We show that if the continuum c is regular, then there is a base matrix of height c, and that there a
Externí odkaz:
http://arxiv.org/abs/2202.00897
Autor:
Brendle, Jörg, Switzer, Corey Bacal
We study the values of the higher dimensional cardinal characteristics for sets of functions $f:\omega^\omega \to \omega^\omega$ introduced by the second author. We prove that while the bounding numbers for these cardinals can be strictly less than t
Externí odkaz:
http://arxiv.org/abs/2107.05947
Autor:
Brendle, Jörg, Parente, Francesco
Publikováno v:
Topology and its Applications 323 (2023) 108279
We study two generalizations of the Rudin-Keisler ordering to ultrafilters on complete Boolean algebras. To highlight the difference between them, we develop new techniques to construct incomparable ultrafilters in this setting. Furthermore, we discu
Externí odkaz:
http://arxiv.org/abs/2107.01447