Related papers: Definable Towers

We consider definable topological dynamics for $NIP$ groups admitting certain decompositions in terms of specific classes of definably amenable groups. For such a group, we find a description of the Ellis group of its universal definable…

In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…

We show the existence, over an arbitrary infinite ergodic $\mathbb{Z}$-dynamical system, of a generic ergodic relatively distal extension of arbitrary countable rank and arbitrary infinite compact extending groups (or more generally,…

To initiate a systematic study on the applications of perfectoid methods to Noetherian rings, we introduce the notions of perfectoid towers and their tilts. We mainly show that the tilting operation preserves several homological invariants…

Let $\mathcal R$ be a $\Sigma^1_1$ binary relation and call a set $\mathcal R$-discrete iff no two distinct of its elements are $\mathcal R$-related. We show that in the extension of $\mathbf{L}$ by iterated Sacks forcing, there is a…

We prove that there are groups in the constructible universe whose automorphism towers are highly malleable by forcing. This is a consequence of the fact that, under a suitable diamond hypothesis, there are sufficiently many highly rigid…

We continue investigating the structure of externally definable sets in NIP theories and preservation of NIP after expanding by new predicates. Most importantly: types over finite sets are uniformly definable; over a model, a family of…

Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…

Suppose that G is a finite group and A is a subset of G such that 1_A has algebra norm at most M. Then 1_A is a plus/minus sum of at most L cosets of subgroups of G, and L can be taken to be triply tower in O(M). This is a quantitative…

The Scott rank of a countable structure is a measure, coming from the proof of Scott's isomorphism theorem, of the complexity of that structure. The Scott spectrum of a theory (by which we mean a sentence of $\mathcal{L}_{\omega_1 \omega}$)…

We characterize the ``best'' model geometries for the class of virtually free groups, and we show that there is a countable infinity of distinct ``best'' model geometries in an appropriate sense--these are the maximally symmetric trees. The…

We develop new tools for the construction of fixed point sets in digital topology. We define excludable points and show that these may be excluded from all freezing sets. We show that articulation points are excludable. We also present…

We study groups and rings definable in d-minimal expansions of ordered fields. We generalize to such objects some known results from o-minimality. In particular, we prove that we can endow a definable group with a definable topology making…

Explicit constructions of infinite families of scattered ${\mathbb F}_q$--linear sets in $PG(r-1,q^t)$ of maximal rank $\frac{rt}2$, for $t$ even, are provided. When $q=2$ and $r$ is odd, these linear sets correspond to complete caps in…

We show that the Nash-Williams theorem has a uniform version and that the Galvin theorem does not. We show that there is an $F_\sigma$ tall ideal on $\mathbb{N}$ without a Borel selector and also construct a $\mathbf\Pi^1_2$ tall ideal…

We prove, assuming resolution of singularities in positive characteristic, an analogue of Siegel's theorem on sum of squares in positive characteristic. The method of proof combines techniques from central simple algebras with model theory…

We review some recent results related to the self-assembly of infinite structures in the Tile Assembly Model. These results include impossibility results, as well as novel tile assembly systems in which shapes and patterns that represent…

We compare three notions of effectiveness on uncountable structures. The first notion is that of a $\real$-computable structure, based on a model of computation proposed by Blum, Shub, and Smale, which uses full-precision real arithmetic.…

Arguments on PL,(=piecewise linear) topology work over any ordered field in the same way as over the real field, and those on differential topology do over a real closed field R in an o-minimal structure that expands (R,<,0,1,+,cdot). One…

We prove the existence of nonperiodic, properly embedded minimal surfaces in $\mathbb{R}^2\times\mathbb{S}^1$ with genus zero, infinitely many ends and one limit end (in particular, they have infinite total curvature).