Related papers: Folner sets of alternate directed groups
Many groups possess highly symmetric generating sets that are naturally endowed with an underlying combinatorial structure. Such generating sets can prove to be extremely useful both theoretically in providing new existence proofs for…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
For a weakly branch group $G$ acting on a regular enough rooted tree, we provide two constructions of continuous families of distinct subgroups that are not closed in the profinite topology on $G$. On the one hand, we construct a continuous…
It is proved that each of compact linear groups of one special type admits a polynomial factorization map onto a real vector space. More exactly, the group is supposed to be non-commutative one-dimensional and to have two connected…
We find an explicit presentation of relative odd unitary Steinberg groups constructed by odd form rings and of relative doubly laced Steinberg groups over commutative rings, i.e. the Steinberg groups associated with the Chevalley group…
We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…
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…
In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…
In this paper we study definable families of functions from an ordered abelian group into various naturally arising definable quotients. We show that for an ordered abelian group $G$ and definable family of convex subgroups…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…
We define a class of higher inductive types that can be constructed in the category of sets under the assumptions of Zermelo-Fraenkel set theory without the axiom of choice or the existence of uncountable regular cardinals. This class…
We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…
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 give a new proof of quantifier elimination in the theory of all ordered abelian groups in a suitable language. More precisely, this is only "quantifier elimination relative to ordered sets" in the following sense. Each definable set in…
In this note we give a short proof that graphs having no linearly small F{\o}lner sets can be partitioned into a union of expanders. We use this fact to prove a partition result for graphs admitting linearly small maximal F{\o}lner sets and…
In this paper, certain mixed special polynomial families associated with Appell sequences are introduced and their properties are established. Further, operational rules providing connections between these families and the known special…
We give a combinatorial characterization of amenability of monomial algebras and prove the existence of monomial Folner sequences, answering a question due to Ceccherini-Silberstein and Samet-Vaillant. We then use our characterization to…
We present a general result giving us families of incomplete and boundedly complete families of discrete distributions. For such families, the classes of unbiased estimators of zero with finite variance and of parametric functions which…
We study the class of groups generated by automata that act essentially freely on the boundary of a rooted tree. In the process we establish and discuss some general tools for determining if a group belongs to this class, and explore the…
We construct families of finitely presented groups exhibiting new divergence behavior; we obtain divergence functions of the form $r^\alpha$ for a dense set of exponents $\alpha \in [2,\infty)$ and $r^n\log(r)$ for integers $n \geq 2$. The…