Related papers: Balanced and functionally balanced $P$-groups
Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…
Topological groups whose underlying spaces are basically disconnected, $F$-, or $F'$-spaces but not $P$-spaces are considered. It is proved, in particular, that the existence of a Lindel\"of basically disconnected topological group which is…
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.
We prove that every uniform approximate homomorphism from a discrete amenable group into a symmetric group is uniformly close to a homomorphism into a slightly larger symmetric group. That is, amenable groups are uniformly flexibly stable…
A Riemannian manifold is called harmonic if its volume density function expressed in polar coordinates centered at any point is radial. Flat and rank-one symmetric spaces are harmonic. The converse (the Lichnerowicz Conjecture) is true for…
We study balancedness properties of words given by the Arnoux-Rauzy and Brun multi-dimensional continued fraction algorithms. We show that almost all Brun words on 3 letters and Arnoux-Rauzy words over arbitrary alphabets are finitely…
A configuration of particles confined to a sphere is balanced if it is in equilibrium under all force laws (that act between pairs of points with strength given by a fixed function of distance). It is straightforward to show that every…
The main result of [4] is that all finitely presented groups of p-deficiency greater than one are p-large. Here we prove that groups with a finite presentation of p-deficiency one possess a finite index subgroup that surjects onto . This…
A sofic group $G$ is said to be flexibly stable if every sofic approximation to $G$ can converted to a sequence of disjoint unions of Schreier graphs by modifying an asymptotically vanishing proportion of edges. We establish that if…
Finite $p$-groups with a unique $\mathcal{A}_2$-subgroup are classified up to isomorphism. A problem proposed by Berkovich and Janko is solved.
We prove that the generalised word problem of a finitely generated subgroup of a finitely generated virtually free group is context-free, that a hyperbolic group must be virtually free if it has a torsion-free quasiconvex subgroup of…
A class of languages C is perfect if it is closed under Boolean operations and the emptiness problem is decidable. Perfect language classes are the basis for the automata-theoretic approach to model checking: a system is correct if the…
Let p be a prime and G be a torsion-free abelian group. A homomorphism from G to the p-adic integers is called a p-adic functional on G. If G has finite rank, then G can be represented as an inductive limit of an inductive sequence of free…
A topological space $X$ is defined to have a neighborhood $P$-base at any $x\in X$ from some poset $P$ if there exists a neighborhood base $(U_p[x])_{p\in P}$ at $x$ such that $U_p[x]\subseteq U_{p'}[x]$ for all $p\geq p'$ in $P$. We prove…
A finitely generated group or monoid is said to be context-free if it has context-free word problem. In this note, we give an example of a context-free monoid, none of whose maximal subgroups are finitely generated. This answers a question…
A finite number of rational functions are compatible if they satisfy the compatibility conditions of a first-order linear functional system involving differential, shift and q-shift operators. We present a theorem that describes the…
In this paper we investigate Hartman functions on a topological group $G$. Recall that $(\iota, C)$ is a group compactification of $G$ if $C$ is a compact group, $\iota: G\to C$ is a continuous group homomorphism and $\iota(G)$ is dense in…
We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…
The valence of a function $f$ at a point $w$ is the number of distinct, finite solutions to $f(z) = w$. Let $f$ be a complex-valued harmonic function in an open set $R \subseteq \mathbb{C}$. Let $S$ denote the critical set of $f$ and $C(f)$…
The word problem for Thompson's group $F$ has a solution, but it remains unknown whether $F$ is automatic or has a finite or regular convergent (terminating and confluent) rewriting system. We show that the group $F$ admits a natural…