English
Related papers

Related papers: Definably amenable groups in Continuous logic

200 papers

Consider $\operatorname{Sym}(n)$, endowed with the normalized Hamming metric $d_n$. A finitely-generated group $\Gamma$ is \emph{P-stable} if every almost homomorphism $\rho_{n_k}\colon \Gamma\rightarrow\operatorname{Sym}(n_k)$ (i.e., for…

Group Theory · Mathematics 2019-09-18 Oren Becker , Alexander Lubotzky , Andreas Thom

The aim of this paper is to generalize and improve two of the main model-theoretic results of "Stable group theory and approximate subgroups" by E. Hrushovski to the context of piecewise hyperdefinable sets. The first one is the existence…

Logic · Mathematics 2025-10-01 Arturo Rodriguez Fanlo

Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…

Logic · Mathematics 2008-06-04 Wesley Calvert

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.

Logic · Mathematics 2007-05-23 Tristram De Piro , Byunghan Kim , Jessica Millar

A group is said to be stable if it is isomorphic to its automorphism group. We investigate how we can extend centerless groups to construct finite stable groups with nontrivial centers. To this end, we classify all finite stable groups…

Group Theory · Mathematics 2026-05-05 Isaac Ochoa

We study the first-order model checking problem on two generalisations of pushdown graphs. The first class is the class of nested pushdown trees. The other is the class of collapsible pushdown graphs. Our main results are the following.…

Logic · Mathematics 2012-02-02 Alexander Kartzow

We prove that every uniform approximate homomorphism from a discrete amenable group into a symmetric group is uniformly close to a homomorphism into a slightly larger symmetric group. That is, amenable groups are uniformly flexibly stable…

Group Theory · Mathematics 2020-05-15 Oren Becker , Michael Chapman

Averaging linear functional on the space continuous functions of the group of diffeomorphisms of interval is found. Amenability of several discrete subgroups of the group of diffeomorphisms $\Diff^3([0,1])$ of interval is prove. In…

Group Theory · Mathematics 2015-05-13 E. T. Shavgulidze

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

We develop a comprehensive theory of the stable representation categories of several sequences of groups, including the classical and symmetric groups, and their relation to the unstable categories. An important component of this theory is…

Representation Theory · Mathematics 2015-06-17 Steven V Sam , Andrew Snowden

Let G be an infinite discrete countable amenable group acting continuously on a Lebesgue space X. In this article, using partition and factor-space, the conditional entropy of the action G is defined. We introduction some properties of…

Dynamical Systems · Mathematics 2025-05-06 Yuan Lian , Bin Zhu

We study the action of groups generated by bounded activity automata with infinite alphabets on their orbital Schreier graphs. We introduce an amenability criterion for such groups based on the recurrence of the first level action. This…

Group Theory · Mathematics 2020-04-13 Bernhard Reinke

We study definably amenable groups in NIP theories, and answer a question of Newelski (and also of Chernikov-Simon), by giving an example in the o-minimal context where weak generic types do not coincide with almost periodic types,…

Logic · Mathematics 2015-04-06 Anand Pillay , Ningyuan Yao

We consider two-variable first-order logic on finite words with a fixed number of quantifier alternations. We show that all languages with a neutral letter definable using the order and finite-degree predicates are also definable with the…

Logic in Computer Science · Computer Science 2015-07-30 Charles Paperman

We describe elementary examples of finitely presented sofic groups which are not residually amenable (and thus not initially subamenable or LEA, for short). We ask if an amalgam of two amenable groups over a finite subgroup is residually…

Group Theory · Mathematics 2015-09-03 Aditi Kar , Nikolay Nikolov

We prove that in an arbitrary o-minimal structure, every interpretable group is definably isomorphic to a definable one. We also prove that every definable group lives in a cartesian product of one-dimensional definable group-intervals (or…

Logic · Mathematics 2011-11-01 Janak Ramakrishnan , Ya'acov Peterzil , Pantelis Eleftheriou

We settle some open problems in the special case of groups in o-minimal structures, such as the equality of G^00 and G^000 and the equivalence of definable amenability and existence of a type with bounded orbit. We prove almost exactness of…

Logic · Mathematics 2011-01-11 Anand Pillay

We develop a semigroup approach to representation theory for pro-Lie groups satisfying suitable amenability conditions. As an application of our approach, we establish a one-to-one correspondence between equivalence classes of unitary…

Representation Theory · Mathematics 2016-06-07 Daniel Beltita , Amel Zergane

Extending M.\ Daws' definition of ultra-amenable Banach algebras, we introduce the notion of operator ultra-amenability for completely contractive Banach algebras. For a locally compact group $G$, we show that the operator ultra-amenability…

Functional Analysis · Mathematics 2017-08-02 Brian E. Forrest , Volker Runde , Kyle Schlitt

A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…

Logic · Mathematics 2012-06-20 Joel David Hamkins , David Linetsky , Jonas Reitz