Related papers: Asymptotic dynamics on amenable groups and van der…

We define the notion of computability of F{\o}lner sets for finitely generated amenable groups. We prove, by an explicit description, that the Kharlampovich group, a finitely presented solvable group with unsolvable word problem, has…

We show that if $G$ is a real semi-simple Lie group, and $\Gamma$ is a discrete subgroup of $G$ containing a subgroup $\Sigma$ acting ergodically (in a strong sense) on the Furstenberg boundary of $G$, then $\Gamma$ is not isomorphic to a…

We present a different proof of the characterization of non--degenerate recurrence sequences, which are also divisibility sequences, given by Van der Poorten, Bezevin, and Petho in their paper "A Full Characterisation of Divisibility…

We prove a version of ergodic theorem for an action of an amenable group, where a F{\o} lner sequence needs not to be tempered. Instead, it is assumed that a function satisfies certain mixing condition.

In this paper we continue our earlier investigations into the asymptotic behaviour of infinite systems of coupled differential equations. Under the mild assumption that the so-called characteristic function of our system is completely…

In 2022, using methods from ergodic theory, Kra, Moreira, Richter, and Robertson resolved a longstanding conjecture of Erd\H{o}s about sumsets in large subsets of the natural numbers. In this paper, we extend this result to several…

We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…

We study the notion of linear sofic approximations for algebras, analogous to the concept of sofic representations for groups. We prove that for a finitely generated amenable $K$-algebra with no zero divisors, all linear sofic…

We give examples of (i) a simple theory with a formula (with parameters) which does not fork over the empty set but has mu measure 0 for every automorphism invariant Keisler measure mu, and (ii) a definable group G in a simple theory such…

We provide a pure algebraic version of the dynamical characterization of Conrad's property. This approach allows dealing with general group actions on totally ordered spaces. As an application, we give a new and somehow constructive proof…

We prove that the reduced group C*-algebras of infinite countable discrete groups having topologically-free extreme boundaries, or more generally groups that satisfy certain combinatorial property including all acylindrically hyperbolic…

We establish an uncountable amenable ergodic Roth theorem, in which the acting group is not assumed to be countable and the space need not be separable. This generalizes a previous result of Bergelson, McCutcheon and Zhang, and complements…

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…

We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…

Let $G$ be a real linear semisimple algebraic group without compact factors and $\Gamma$ a Zariski dense subgroup of $G$. In this paper, we use a probabilistic counting in order to study the asymptotic properties of $\Gamma$ acting on the…

We provide new examples of the asymptotic counting for the number of subsets on groups of given size which are free of certain configurations. These examples include sets without solutions to equations in non-abelian groups, and linear…

Orthogonality is a fundamental theme in representation theory and Fourier analysis. An orthogonality relation for characters of finite abelian groups (now recognized as an orthogonality relation on GL(1)) was used by Dirichlet to prove…

We consider the proportion of zero entries in the character table of a sequence of reductive groups over a finite field. We prove an asymptotic lower bound when the reductive group is fixed and the size of the finite field increases.…

Following the works of Furstenberg and Glasner on stationary means, we strengthen and extend in this paper some recent results by Di Nasso, Goldbring, Jin, Leth, Lupini and Mahlburg on piecewise syndeticity of product sets in countable…

Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notion of a recognizable set of graphs in terms of finite…