Related papers: F{\o}lner functions and the generic Word Problem f…

Beyond the locally compact case, equivalent notions of amenability diverge, and some properties no longer hold, for instance amenability is not inherited by topological subgroups. This investigation is guided by some amenability-type…

Let (G,S) be a Coxeter group. We construct a continuation, to the open unit disc, of the unitary representations associated to the positive definite functions g -> r^l(g). (Here 0<r<1, and l denotes the length function with respect to the…

Different notions of amenability on hypergroups and their relations are studied. Developing Leptin's theorem for discrete hypergroups, we characterize the existence of a bounded approximate identity for hypergroup Fourier algebras. We study…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

In this paper we prove that the general version, F(N) of the Thompson group is inner amenable. As a consequence we generalize a result of P.Jolissaint. To do so, we prove first that F(N) together with a normal subgroup are i.c.c (infinite…

Given any amenable group $G$ (with a left Haar measure $|\cdot|$ or $dg$), we can select out a \textit{F{\o}lner subnet} $\{F_\theta,\theta\in\Theta\}$ from any left F{\o}lner net in $G$, which is \textit{$L^\infty$-admissible}, namely, for…

We contribute to a recent research program which aims at revisiting the study of the complexity of word problems, a major area of research in combinatorial algebra, through the lens of the theory of computably enumerable equivalence…

This paper concerns the study of regular Fourier hypergroups through multipliers of their associated Fourier algebras. We establish hypergroup analogues of well-known characterizations of group amenability, introduce a notion of weak…

Let $G$ be a finitely generated group, $\mathrm{Sub}(G)$ the (compact, metric) space of all subgroups of $G$ with the Chaubuty topology and $X!$ the (Polish) group of all permutations of a countable set $X$. We show that the following…

We study in this paper the validity of the mean ergodic theorem along \emph{left} F\o lner sequences in a countable amenable group $G$. Although the \emph{weak} ergodic theorem always holds along \emph{any} left F\o lner sequence in $G$, we…

We prove that the word problem is undecidable in functionally recursive groups, and that the order problem is undecidable in automata groups, even under the assumption that they are contracting.

Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…

In his study of amenable unitary representations, M. E. B. Bekka asked if there is an analogue for such representations of the remarkable fixed-point property for amenable groups. In this paper, we prove such a fixed-point theorem in the…

We study the algebra $\mathfrak{M}^{\infty,\mathrm{dec}}(G)$ of decomposable Fourier multipliers on the group von Neumann algebra $\mathrm{VN}(G)$ of a locally compact group $G$, and its relation to the Fourier-Stieltjes algebra…

We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…

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…

This is a survey of our recent results on the amenability problem for Thompson's group $F$. They mostly concern esimating the density of finite subgraphs in Cayley graphs of $F$ for various systems of generators, and also equations in the…

We study definably amenable NIP groups. We develop a theory of generics, showing that various definitions considered previously coincide, and study invariant measures. Applications include: characterization of regular ergodic measures, a…

We prove a general solvable subgroup theorem in terms of length functions. As applications, we obtain a solvable subgroup theorem in dynamical systems: any solvable group of finite Hirsch length acting on a smooth manifold with uniformly…

In this paper we explore the connections between the class of Visibly Pushdown Languages ($\mathbf{VPL}$) and the natural sets of words one can associate to a finitely generated group. We show that the word problem of a finitely generated…