Related papers: On amalgamation in NTP2 theories and generically s…

We adapt a proof of Lascar in order to show the simplicity of the group of automorphisms fixing pointwise all non-generic elements for a class of uncountable models of suitable theories, encompassing both strongly minimal theories as well…

In this paper we shall prove that any $2$-transitive finitely homogeneous structure with a supersimple theory satisfying a generalized amalgamation property is a random structure. In particular, this adapts a result of Koponen for binary…

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form…

If we pick two elements of a non-abelian group at random, the odds this pair commutes is at most 5/8, so there is a "gap" between abelian and non-abelian groups \cite{G}. We prove a "topological" generalization estimating the odds a word…

Generalization is a central aspect of learning theory. Here, we propose a framework that explores an auxiliary task-dependent notion of generalization, and attempts to quantitatively answer the following question: given two sets of patterns…

For simple theories with a strong version of amalgamation we obtain the canonical hyperdefinable group from the group configuration. This provides a generalization to simple theories of the group configuration theorem for stable theories.

We construct N-complexes of non completely antisymmetric irreducible tensor fields on $\mathbb R^D$ generalizing thereby the usual complex (N=2) of differential forms. These complexes arise naturally in the description of higher spin gauge…

We give sufficient conditions for a first order expansion of the real line to define the standard model of the monadic second order theory of one successor. Such an expansion does not satisfy any of the combinatorial tameness properties…

The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…

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.

A group is $\frac{3}{2}$-generated if every non-identity element is contained in a generating pair. A conjecture of Breuer, Guralnick and Kantor from 2008 asserts that a finite group is $\frac{3}{2}$-generated if and only if every proper…

Consider the expansion $T_S$ of a theory $T$ by a predicate for a submodel of a reduct $T_0$ of $T$. We present a setup in which this expansion admits a model companion $TS$. We show that the nice features of the theory $T$ transfer to…

We present a general approach to construct a class of generalized topological field theories with constraints by means of generalized differential calculus and its application to connection theory. It turns out that not only the ordinary BF…

We consider the logic space of countable (enumerated) groups and show that closed subspaces corresponding to some standard classes of groups have (do not have) generic groups. We also discuss the cases of semigroups and associative rings.

We study the complexity of reasoning in abstracts argumentation frameworks close to graph classes that allow for efficient reasoning methods, i.e.\ to one of the classes of acyclic, noeven, biparite and symmetric AFs. In this work we show…

Groups definable in simple theories retain the chain conditions and decomposition properties known from stable groups, up to commensurability. In the small case, if a generic type of G is not foreign to some type q, there is a q-internal…

In NIP theories, generically stable Keisler measures can be characterized in several ways. We analyze these various forms of "generic stability" in arbitrary theories. Among other things, we show that the standard definition of generic…

We study stable like behaviour in first order theories without the independence property. We introduce generically stable measures, give characterizatiions, and show their ubiquity. We also introduce generic compact domination. We also…