Related papers: Mekler's construction and tree properties
We formulate a theory of shape valid for objects of arbitrary dimension whose contours are path connected. We apply this theory to the design and modeling of viable trajectories of complex dynamical systems. Infinite families of…
We construct a sequence of simple non-discrete totally disconnected locally compact (tdlc) groups separated by finiteness properties; that is, for every positive integer $n$ there exists a simple non-discrete tdlc group that is of type…
We consider nonlinear scalar conservation laws posed on a network. We establish $L^1$ stability, and thus uniqueness, for weak solutions satisfying the entropy condition. We apply standard finite volume methods and show stability and…
In \cite{Kramer11} Kramer proves for a large class of semisimple Lie groups that they admit just one locally compact $\sigma$-compact Hausdorff topology compatible with the group operations. We present two different methods of generalising…
In this note, we investigate a new model theoretical tree property, called the antichain tree property (ATP). We develop combinatorial techniques for ATP. First, we show that ATP is always witnessed by a formula in a single free variable,…
In this monograph, we give an account of the relationship between the algebraic structure of finitely generated and countable groups and the regularity with which they act on manifolds. We concentrate on the case of one--dimensional…
Given a finitely generated linear group $G$ over $\mathbb{Q}$, we construct a simple group $\Gamma$ that has the same finiteness properties as $G$ and admits $G$ as a quasi-retract. As an application, we construct a simple group of type…
We prove some results about the theory of independence in $\mathrm{NSOP}_{3}$ theories that do not hold in $\mathrm{NSOP}_{4}$ theories. We generalize Chernikov's work on simple and co-simple types in $\mathrm{NTP}_{2}$ theories to types…
Let $\mathrm{cof}(\mu)=\mu$ and $\kappa$ be a supercompact cardinal with $\mu<\kappa$. Assume that there is an increasing and continuous sequence of cardinals $\langle\kappa_\xi\mid \xi<\mu\rangle$ with $\kappa_0:=\kappa$ and such that, for…
We prove two results about generically stable types $p$ in arbitrary theories. The first, on existence of strong germs, generalizes results from D. Haskell, E. Hrushovski and D. Macpherson on stably dominated types. The second is an…
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications which use alphabets which are structured in some sense. We…
The classes stable, simple and NSOP$_1$ in the stability hierarchy for first-order theories can be characterised by the existence of a certain independence relation. For each of them there is a canonicity theorem: there can be at most one…
Let k be a number field, p$\ge$2 a prime and S a set of tame or wild finite places of k. We call K/k a totally S-ramified cyclic p-tower if Gal(K/k)=Z/p^NZ and if S non-empty is totally ramified. Using analogues of Chevalley's formula…
We prove that some natural "outside" property is equivalent (for a first order class) to being stable. For a model, being resplendent is a strengthening of being kappa-saturated. Restricting ourselves to the case kappa > |T| for…
We provide the first examples of finitely generated simple groups that are amenable (and infinite). This follows from a general existence result on invariant states for piecewise-translations of the integers. The states are obtained by…
We construct a finitely presented group with property (T) which can not act on on reasonable spaces. Such group is constructed using an generalization of Hall embedding theorem, where property (T) is added at the expense of weakening the…
This paper aims at developing model-theoretic tools to study interpretable fields and definably amenable groups, mainly in $\mathrm{NIP}$ or $\mathrm{NTP_2}$ settings. An abstract theorem constructing definable group homomorphisms from…
A well-known result of Shelah and Spencer tells us that the almost sure theory for first order language on the random graph sequence $\left\{G(n, cn^{-1})\right\}$ is not complete. This paper proposes and proves what the complete set of…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
This paper develops a categorical framework to clarify the relationship between the completeness and compactness theorems in classical first-order logic. Rather than claiming that different model constructions yield naturally isomorphic…