Related papers: Ascending chain condition in generic groups

We introduce and study Polish topologies on various spaces of countable enumerated groups, where an enumerated group is simply a group whose underlying set is the set of natural numbers. Using elementary tools and well known examples from…

Chv\'{a}tal and Erd\"{o}s [Discrete Math. 2 (1972) 111-113] stated that, for an $m$-connected graph $G$, if its independence number $\alpha(G)\leq m-1$, then $G$ is Hamilton-connected. Note that $k$-leaf-connectedness is a natural…

A ring $R$ satisfies the {\it strong rank condition} (SRC) if, for every natural number $n$, the free $R$-submodules of $R^n$ all have rank $\leq n$. Let $G$ be a group and $R$ a ring strongly graded by $G$ such that the base ring $R_1$ is…

We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…

We establish a sufficient condition for a finitely generated pro-$p$ group to be accessible in terms of finite generation of the module of ends.

The order sequence of a finite group $G$ is a non-decreasing finite sequence formed of the element orders of $G$. Several properties of order sequences were studied by P. J. Cameron and H. K. Dey in a recent paper that concludes with a list…

We provide explicit uniform type (2,3)-generators for the special linear group SL_{12}(q) for all q except for q=2 or 4. Our considerations are easily traceable, self-contained and based only on the known list of maximal subgroups of this…

Pairs of consecutive integers have the same height in the Collatz problem with surprising frequency. Garner gave a conjectural family of conditions for exactly when this occurs. Our main result is an infinite family of counterexamples to…

Let $\mathcal C$ be a set of finite groups which is closed under taking subgroups and let $d$ and $M$ be positive integers. Suppose that for any $G\in\mathcal C$ whose order is divisible by at most two distinct primes there exists an…

Let $G$ be a connected graph of order $n$. A spanning $k$-tree of $G$ is a spanning tree with the maximum degree at most $k$, and a spanning $k$-ended-tree of $G$ is a spanning tree at most $k$ leaves, where $k\geq2$ is an integer. This…

We prove that if L is a finite simple group of Lie type and A a symmetric set of generators of L, then A grows i.e |AAA| > |A|^{1+epsilon} where epsilon depends only on the Lie rank of L, or AAA=L. This implies that for a family of simple…

We propose a generalization of Carmichael numbers, where the multiplicative group $\mathbb G_\mathrm{m} = \mathrm{GL}(1)$ is replaced by $\mathrm{GL}(m)$ for $m\geq 2$. We prove basic properties of these families of numbers and give some…

In Grayson's combinatorial description of higher K-groups, the generators are bounded acyclic binary multi-complexes of arbitrary size. Generalising work by Kasprowski, Winges and the author, we show in this paper that multi-complexes of…

Let T be a k-regular tree (k>2) and A its automorphism group. We analyze a generic finitely generated subgroup Gamma of A. We show that Gamma is free and establish a trichotomy on the closure of Gamma: it is either discrete, compact or has…

We give a structural description of the normal subgroups of subgroups of finite index in branch groups in terms of rigid stabilizers. This gives further insight into the structure lattices of branch groups introduced by the second author.…

A generalized triangle group is a group that can be presented in the form $G = < x,y | x^p=y^q=w(x,y)^r=1>$, where $p,q,r\geq 2$ and $w(x,y)$ is a cyclically reduced word of length at least 2 in the free product $\Z_p*\Z_q=< x,y |…

Motivated by generalizing Szemer\'edi's theorem, we the elements in a discrete quantum group fixing a sequence of finite subsets and prove that the set of these elements is a quantum subgroup. Using this we obtain a version of mean ergodic…

In this paper we give a new generalization of token graphs. Given two integers $1\leq m \leq k$ and a graph $G$ we define the generalized token graph of the graph $G$, to be the graph $F_k^m(G)$ whose vertices correspond to configurations…

The $k$-expansion of a graph $G$ is the $k$-uniform hypergraph obtained from $G$ by adding $k-2$ new vertices to every edge. We determine, for all $k > d \geq 1$, asymptotically optimal $d$-degree conditions that ensure the existence of all…

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.