Related papers: Cofinitary groups and projective well-orders

Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…

We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable $P$-points, definable tight MAD families and definable selective independent families. As a result, we…

Assuming that every set is constructible, we find a $\Pi^1_1$ maximal cofinitary group of permutations of $\mathbb N$ which is indestructible by Cohen forcing. Thus we show that the existence of such groups is consistent with arbitrarily…

We develop a new forcing notion for adjoining self-coding cofinitary permutations and use it to show that consistently, the minimal cardinality $\mathfrak a_{\text{g}}$ of a maximal cofinitary group (MCG) is strictly between $\aleph_1$ and…

Improving and clarifying a construction of Horowitz and Shelah, we show how to construct (in $\textsf{ZF}$, that is, without using the Axiom of Choice) maximal cofinitary groups. Among the groups we construct, one is definable by a formula…

We show Shelah's original creature forcing from 1984 strongly preserves tight mad families. In particular, answering questions of Fischer and Friedman and Friedman and Zdomskyy, we show the constellation $\aleph_1 = \mathfrak{a} <…

Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…

Generalizing the proof for Sacks forcing, we show that the $h$-perfect tree forcing notions introduced by Goldstern, Judah and Shelah preserve selective independent families even when iterated. As a result we obtain new proofs of the…

We investigate the local topological structure of non-metrizable topological groups through the lens of Tukey order and cofinal types. Motivated by recent advances in topological groups admitting an $\omega^\omega$-base, we introduce the…

Sofic groups generalise both residually finite and amenable groups, and the concept is central to many important results and conjectures in measured group theory. We introduce a topological notion of a sofic boundary attached to a given…

We prove that in some cases definable thin sets (including chains) of Borel partial orderings are necessarily countably cofinal. This includes the following cases: analytic thin sets, ROD thin sets in the Solovay model, and $\Sigma^1_2$…

We introduce a forcing technique to construct three-dimensional arrays of generic extensions through FS (finite support) iterations of ccc posets, which we refer to as 3D-coherent systems. We use them to produce models of new constellations…

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a…

We define a class of partial orders on a Coxeter group associated with sets of reflections. In special cases, these lie between the left weak order and the Bruhat order. We prove that these posets are graded by the length function and that…

Under $\text{CH}$ we construct a partition of Baire space into compact sets, which is indestructible by countably supported iteration and product of Sacks forcing of any length, answering a question of Newelski. Further, we present an…

We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other…

We provide a general preservation theorem for preserving selective independent families along countable support iterations. The theorem gives a general framework for a number of results in the literature concerning models in which the…

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

We analyse limits and colimits in the category $Part$ of partial groups, algebraic structures introduced by A. Chermak. We will prove that $Part$ is both complete and cocomplete and, in addition, that the full subcategory of finite partial…

We generalize the "facial weak order" of a finite Coxeter group to a partial order on a set of intervals in a complete lattice. We apply our construction to the lattice of torsion classes of a finite-dimensional algebra and consider its…