English
Related papers

Related papers: Chain conditions, elementary amenable groups, and …

200 papers

There are several natural families of groups acting on rooted trees for which every member is known to be amenable. It is, however, unclear what the elementary amenable members of these families look like. Towards clarifying this situation,…

Group Theory · Mathematics 2018-01-09 Kate Juschenko , Benjamin Steinberg , Phillip Wesolek

We study the coarse classification of partial orderings using chain conditions in the context of descriptive combinatorics. We show that (unlike the Borel counterpart of many other combinatorics), we have a distinct hierarchy of different…

Combinatorics · Mathematics 2023-06-02 Ming Xiao

In extremal set theory our usual goal is to find the maximal size of a family of subsets of an $n$-element set satisfying a condition. A condition is called chain-dependent, if it is satisfied for a family if and only if it is satisfied for…

Combinatorics · Mathematics 2023-07-06 Dániel T. Nagy , Kartal Nagy

We consider groups of automorphisms of locally finite trees, and give conditions on its subgroups that imply that they are not elementary amenable. This covers all known examples of groups that are not elementary amenable and act on the…

Group Theory · Mathematics 2015-04-03 Kate Juschenko

We consider a very weak chain condition for a poset, that is the absence of subsets which are order isomorphic to the set of real numbers in their natural ordering; we study generalised radical groups in which this finiteness condition is…

Group Theory · Mathematics 2023-07-18 Ulderico Dardano , Fausto De Mari

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

Group Theory · Mathematics 2023-04-10 Matteo Cavaleri , Daniele D'Angeli , Alfredo Donno , Emanuele Rodaro

We show that the group of bounded automatic automorphisms of a rooted tree is amenable, which implies amenability of numerous classes of groups generated by finite automata. The proof is based on reducing the problem to showing amenability…

Group Theory · Mathematics 2019-12-19 Laurent Bartholdi , Vadim A. Kaimanovich , Volodymyr V. Nekrashevych

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

Logic · Mathematics 2025-11-25 Sy-David Friedman , Tapani Hyttinen , Vadim Kulikov

We prove a structure theorem for periodic locally soluble groups satisfying a chain condition on intersections of relatively uniformly definable subgroups using results from the theory of stable groups. The result in particular shows that…

Logic · Mathematics 2019-11-06 Jamshid Derakhshan

We prove a characterization of the amenability of countable Borel equivalence relations in terms of the uniform Liouville property for group actions on their classes. Furthermore, inspired by a well-known amenability criterion for locally…

Group Theory · Mathematics 2026-03-10 Maksym Chaudkhari , Kate Juschenko , Friedrich Martin Schneider

In this paper we address the question: How many pairwise non-isomorphic extremely amenable groups are there which are separable metrizable or even Polish? We show that there are continuum many such groups. In fact we construct continuum…

Logic · Mathematics 2026-03-23 Mahmood Etedadialiabadi , Su Gao , Feng Li , Ruiwen Li

In this note we prove and disprove some chain conditions in type definable and definable groups in dependent, strongly dependent and strongly^{2} dependent theories.

Logic · Mathematics 2012-02-10 Itay Kaplan , Saharon Shelah

In this paper we study the elementary theory of graph products of groups and show that under natural conditions on the vertex groups we can recover (the core of) the underlying graph and the associated vertex groups. More precisely, we…

Group Theory · Mathematics 2021-06-08 Montserrat Casals-Ruiz , Ilya Kazachkov , Javier de la Nuez González

The paper is a naive introduction to descriptive set theory. It is aimed mathematicians without a background in logic. The goal is to provide the basic facts used for applications of descriptive set theory to other areas of mathematics,…

Logic · Mathematics 2021-10-19 Matthew Foreman

The union-closed sets conjecture (sometimes referred to as Frankl's conjecture) states that every finite, nontrivial union-closed family of sets has an element that is in at least half of its members. Although the conjecture is known to be…

Combinatorics · Mathematics 2025-12-03 Cory H. Colbert

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its…

Group Theory · Mathematics 2026-03-20 Clinton T. Conley , Damien Gaboriau , Andrew S. Marks , Robin D. Tucker-Drob

We prove that for an elementary amenable group, coherence of the group, homological coherence of the group, and coherence of the integral group ring are all equivalent. This generalises a result of Bieri and Strebel for finitely generated…

Group Theory · Mathematics 2025-01-15 Sam Hughes , Dawid Kielak , Peter H. Kropholler , Ian J. Leary

We explore classifiability of crossed products of actions of countable amenable groups on compact, metrizable spaces. It is completely understood when such crossed products are simple, separable, unital, nuclear and satisfy the UCT: these…

Operator Algebras · Mathematics 2024-05-08 Eusebio Gardella , Shirly Geffen , Rafaela Gesing , Grigoris Kopsacheilis , Petr Naryshkin

It is proved that, in certain subgroups of direct products of countable groups, the property of being an unconditionally closed set coincides with that of being an algebraic set. In particular, these properties coincide in all Abelian…

Group Theory · Mathematics 2007-05-23 Ol'ga V. Sipacheva

We prove a converse to Myhill's "Garden-of-Eden" theorem and obtain in this manner a characterization of amenability in terms of cellular automata: "A group $G$ is amenable if and only if every cellular automaton with carrier $G$ that has…

Formal Languages and Automata Theory · Computer Science 2016-06-09 Laurent Bartholdi , Dawid Kielak
‹ Prev 1 2 3 10 Next ›