Related papers: Definably amenable groups in Continuous logic

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

We entirely classify definable sets up to definable bijections in $\mathbb{Z}$-groups, where the language is the one of ordered abelian groups. From this, we deduce, among others, a classification of definable families of bounded definable…

We introduce and investigate different definitions of effective amenability, in terms of computability of F{\o}lner sets, Reiter functions, and F{\o}lner functions. As a consequence, we prove that recursively presented amenable groups have…

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…

Adapting a proof of Bouscaren and Delon, we show that every type-definable connected group in a given stable theory of fields embeds into an algebraic group, under a condition on the definable closure. We also present general hypotheses…

We consider definable topological dynamics for $NIP$ groups admitting certain decompositions in terms of specific classes of definably amenable groups. For such a group, we find a description of the Ellis group of its universal definable…

We study skew-amenable topological groups, i.e., those admitting a left-invariant mean on the space of bounded real-valued functions left-uniformly continuous in the sense of Bourbaki. We prove characterizations of skew-amenability for…

We show that every amenable group with a locally invariant partial order has a left-invariant total order (and is therefore locally indicable). We also show that if a group G admits a left-invariant total order, and H is a locally nilpotent…

We prove some technical results on definable types in $p$-adically closed fields, with consequences for definable groups and definable topological spaces. First, the code of a definable $n$-type (in the field sort) can be taken to be a real…

In this paper, we show that there is a net for amenable transformation groups like F{\o}lner net for amenable groups and investigate amenability of a transformation group constructed by semidirect product of groups. We introduce inner…

This paper is about the $dfg$/$fsg$ decomposition for groups $G$ definable in $p$-adically closed fields. It is proved that for $G$ definably amenable, $G$ has a definable normal $dfg$ subgroup $H$ such that the quotient $G/H$ is a…

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

We study pseudorandomness and pseudorandom generators from the perspective of logical definability. Building on results from ordinary derandomization and finite model theory, we show that it is possible to deterministically construct, in…

We consider the question of when sets definable in first-order expansions of groups contain the product of two infinite sets (we refer to this as the "productset property"). We first show that the productset property holds for any definable…

We introduce a class of theories called metastable, including the theory of algebraically closed valued fields (ACVF) as a motivating example. The key local notion is that of definable types dominated by their stable part. A theory is…

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…

We answer an open question of Grigorchuk and Zuk about amenability using random walks. Our results separate the class of amenable groups from the closure of subexponentially growing groups under the operations of group extension and direct…

We study definably complete locally o-minimal expansions of ordered groups in this paper. A definable continuous function defined on a closed, bounded and definable set behave like a continuous function on a compact set. We demonstrate…

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…