Related papers: Stable amalgamation over a predicate and the Gaifm…

We note a parallel between some ideas of stable model theory and certain topics in finite combinatorics related to the sum-product phenomenon. For a simple linear group G, we show that a finite subset X with |X X \^{-1} X |/ |X| bounded is…

A definable type of a first-order theory is the same as a section (retraction) of the simplicial path space (decalage) of its space of types viewed as a simplicial topological space; as is well-known, in the category of simplicial sets such…

This paper investigates the independence polynomials arising from iterated strong products of cycle graphs, examining their algebraic symmetries and combinatorial structures. Leveraging modular arithmetic and Galois theory, we establish…

A graph class $\mathscr{C}$ is called monadically stable if one cannot interpret, in first-order logic, arbitrary large linear orders in colored graphs from $\mathscr{C}$. We prove that the model checking problem for first-order logic is…

For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…

In this paper, we prove that any graph product of finitely many groups, all satisfying the Haagerup property (or Gromov's a-T-menability) also satisfies Haagerup property.

It is well known that on arbitrary metric measure spaces, the notion of minimal $p$-weak upper gradient may depend on $p$. In this paper we investigate how a first-order condition of the metric-measure structure, that we call Bounded…

We study model theory of actions of finite groups on substructures of a stable structure. We give an abstract description of existentially closed actions as above in terms of invariants and PAC structures. We show that if the corresponding…

Geometrical stability theory is a powerful set of model-theoretic tools that can lead to structural results on models of a simple first-order theory. Typical results offer a characterization of the groups definable in a model of the theory.…

Using a m\'elange of techniques at the rich intersection of deformation/rigidity theory, finite index subfactor theory, and geometric group theory, we prove the existence of a continuum of property (T) factors that are pairwise non-stably…

Let us say that a discrete countable group is stable if it has an ergodic, free, probability-measure-preserving and stable action. Let G be a discrete countable group with a central subgroup C. We present a sufficient condition and a…

We study the Stable Fixtures problem, a many-to-many generalisation of the classical non-bipartite Stable Roommates matching problem. Building on the foundational work of Tan on stable partitions, we extend his results to this significantly…

Using algebraic geometry methods, the third author proved that the group ring of a surjunctive group with coefficients in a field is always stably finite. In other words, every group satisfying Gottschalk's conjecture also satisfies…

In this paper we introduce a new property for normed algebras. This property which we call it stability, plays a key role in the studying of the theory of almost multiplier maps. In this note we study some of the basic properties of this…

In recent years, there has been a considerable amount of interest in the stability of a finitely-generated group $\Gamma$ with respect to a sequence of groups $\left\{G_{n}\right\}_{n=1}^{\infty}$, equipped with bi-invariant metrics…

In the first edition of Classification Theory, the second author characterized the stable theories in terms of saturation of ultrapowers. Prior to this theorem, stability had already been defined in terms of counting types, and the unstable…

We prove that for every simple theory $T$ (or even simple thick compact abstract theory) there is a (unique) compact abstract theory $T^\fP$ whose saturated models are the lovely pairs of $T$. Independence-theoretic results that were proved…

The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory, main result here, built on recursive evaluation of p. r. map…

A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if G is an abelian group, then the follwing are equivalent: 1. Th(G, +) has the…

This paper explores the consistency strength of The Proper Forcing Axiom ($\textsf{PFA}$) and the theory (T) which involves a variation of the Viale-Wei$\ss$ guessing hull principle. We show that (T) is consistent relative to a supercompact…