Related papers: Witnessing dp-rank

We investigate the notions of strict independence and strict non-forking, and establish basic properties and connections between the two. In particular it follows from our investigation that in resilient theories strict non-forking is…

Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…

We show that there are no non-trivial linear dependencies among p-norms of vectors in finite dimensions that hold for all p. The proof is by complex analytic continuation.

Let $T$ be a (first order complete) dependent theory, ${\mathfrak{C}}$ a $\bar\kappa$-saturated model of $T$ and $G$ a definable subgroup which is abelian. Among subgroups of bounded index which are the union of $<\bar\kappa$ type definable…

We show, assuming the consistency of one measurable cardinal, that it is consistent for there to be exactly kappa+ many normal measures on the least measurable cardinal kappa. This answers a question of Stewart Baldwin. The methods…

We prove a relative decidability result for perfectoid fields. This applies to show that the fields $\mathbb{Q}_p(p^{1/p^{\infty}})$ and $\mathbb{Q}_p(\zeta_{p^{\infty}})$ are (existentially) decidable relative to the perfect hull of $…

We prove a general dichotomy theorem for groups of finite Morley rank with solvable local subgroups and of Pr\"ufer p-rank at least 2, leading either to some p-strong embedding, or to the Pr\"ufer p-rank being exactly 2.

A duality of $\kappa$-normed topological vector spaces is defined and investigated. For such spaces the analog of the Mackey-Arens theorem is proved. There are investigated cases, when $\kappa$-normability of a topological vector space…

We consider the mirrors model in $d$ dimensions on an infinite slab and with unit density. This is a deterministic dynamics in a random environment. We argue that the crossing probability of the slab goes like $\kappa/(\kappa+N)$ where $N$…

We study finitely generated models of countable theories, having at most countably many nonisomorphic finitely generated models. We intro- duce a notion of rank of finitely generated models and we prove, when T has at most countably many…

The well-known Landau's theorem states that, for any positive integer $k$, there are finitely many isomorphism classes of finite groups with exactly $k$ (conjugacy) classes. We study variations of this theorem for $p$-regular classes as…

We prove that any type in an NIP theory can be decomposed into a stable part (a generically stable partial type) and a distal-like quotient.

Let $G$ be a special $p$-group. If $G$ is of rank two, or $G$ is of maximum rank with $|G^p|\leq p$, then we describe the complex irreducible projective representations of $G$.

An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…

For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…

Assuming that there is no inner model with a Woodin cardinal, we obtain a characterization of $\lambda$-tall cardinals in extender models that are iterable. In particular we prove that in such extender models, a cardinal $\kappa$ is a tall…

In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…

A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…

Combining two results from machine learning theory we prove that a formula is NIP if and only if it satisfies uniform definability of types over finite sets (UDTFS). This settles a conjecture of Laskowski.

We study one way in which stable phenomena can exist in an NIP theory. We start by defining a notion of 'pure instability' that we call 'distality' in which no such phenomenon occurs. O-minimal theories and the p-adics for example are…