Related papers: The generating pairs of the 2-transitive groups

Let n >1 be an integer, and G a doubly transitive subgroup of the symmetric group on X={1,...,n}. In this paper we find all linear group representations rho of G on an euclidean vector space V which contains a set of equiangular vector…

Let A be a topological space which is not finitely generated and CH(A) denote the coreflective hull of A in Top. We construct a generator of the coreflective subcategory SCH(A) consisting of all subspaces of spaces from CH(A) which is a…

Let $G$ be the multiplicative group generated by the gamma functions $\Gamma(ax+1)$ $(a=1,2,\dots)$, and $H$ be the subgroup of all elements of $G$ that converge to nonzero constants as $x\rightarrow\infty$. The quotient group $G/H$ is the…

In this article, we deeply reveal the relationship between functions $\theta$ and $\vartheta$ in an overlap function additively generated by an additive generator pair ($\theta$,$\vartheta$). Then we characterize the conditions for an…

Given a formation $\mathfrak F$, we consider the graph whose vertices are the elements of $G$ and where two vertices $g,h\in G$ are adjacent if and only if $\langle g,h \rangle \notin\mathfrak F$. We are interested in the two following…

We show how to find higher generating families of subgroups, in the sense of Abels and Holz, for groups acting on Cohen-Macaulay complexes. We apply this to groups with a BN-pair to prove higher generation by parabolic and Levi-subgroups…

A group $G$ is invariably generated (IG) if there is a subset $S \subseteq G$ such that for every subset $S' \subseteq G$, obtained from $S$ by replacing each element with a conjugate, $S'$ generates $G$. $G$ is finitely invariably…

Let $\epsilon>0$. In this article we will present a deterministic algorithm which does the following. The input is a hyperelliptic curve $C$ of genus $g$ over a finite field $k$ of cardinality $q$ given by $y^2+h(x)y=f(x)$ such that the…

In this paper we characterize the finite permutation groups $F<S_d$ on $d$ letters such that every compact open subgroup of the associated universal group $U(F)<{\rm Aut} T_d$ is topologically finitely generated. Actually we show that in…

This expository article revolves around the question to find short presentations of finite simple groups. This subject is one of the most active research areas of group theory in recent times. We bring together several known results on…

We are interested in semigroups of the form $\langle G,a\rangle\setminus G$, where $G$ is a permutation group of degree $n$ and $a$ a non-permutation on the domain of $G$. A theorem of the first author, Mitchell and Schneider shows that, if…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

We show how to efficiently count and generate uniformly at random finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. The method to achieve these results relies on a natural map of…

In a 2018 paper, Cameron and Semeraro posed the problem of finding all group-graph reciprocal pairs. In this paper, we make a significant contribution to finding all such pairs. A group and graph form a reciprocal pair if they satisfy the…

Famously, every finite simple group $G$ can be generated by a pair of elements. Moreover, Liebeck and Shalev (1995) proved that the probability that a pair of elements generate $G$ tends to $1$ as $|G| \to \infty$. More generally, work of…

Let $G$ be a group. Then $S\subseteq G$ is an invariable generating set of $G$ if every subset $S'$ obtained from $S$ by replacing each element with a conjugate is also a generating set of $G$. We investigate invariable generation among key…

We answer a question raised by Lanier about the possibility of generating $A_n$ and $S_n$ with two elements of order $k$, where $n \geqslant k \geqslant 3$. We show that this can always be done apart from some clear exceptions.

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

There exist two different sorts of gaps in the nonsymmetric numerical additive semigroups finitely generated by a minimal set of positive integers {d_1,...,d_m}. The h-gaps are specific only for the nonsymmetric semigroups while the g-gaps…

We examine the Polish group $H_{+}^{AC}$ of order-preserving self-homeomorphisms $f$ of the interval $\left[ 0,1 \right]$ for which both $f$ and $f^{-1}$ are absolutely continuous; in particular, we establish two results. First, we prove…