Related papers: Transitive generalized toggle groups containing a …

We consider a finite, connected and simple graph $\Gamma$ that admits a vertex-transitive group of automorphisms $G$. Under the assumption that, for all $x \in V(\Gamma)$, the local action $G_x^{\Gamma(x)}$ is the action of…

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…

After long term efforts, it was recently proved in \cite{DKM2} that except for the Peterson graph, every connected vertex-transitive graph of order $rs$ has a Hamilton cycle, where $r$ and $s$ are primes. A natural topic is to solve the…

A fine mixed subdivision of a (d-1)-simplex T of size n gives rise to a system of ${d \choose 2}$ permutations of [n] on the edges of T, and to a collection of n unit (d-1)-simplices inside T. Which systems of permutations and which…

Let $G$ be a group and $g$ a non-trivial element in $G$. If some non-empty finite product of conjugates of $g$ equals to the trivial element, then $g$ is called a generalized torsion element. To the best of our knowledge, we have no…

We show that using the cyclic group the transpose of an R-cyclic matrix can be decomposed along diagonal parts into a sum of parts which are freely independent over diagonal scalar matrices. Moreover, if the R-cyclic matrix is self-adjoint…

In 2008, Schneider and Van Maldeghem proved that if a group acts flag-transitively, point-primitively, and line-primitively on a generalised hexagon or generalised octagon, then it is an almost simple group of Lie type. We show that…

We give a simple proof of the well-known fact: any group of n elements is cyclic if and only if n and \phi(n) are coprime. This note is accessible for students familiar with permutations and basic number theory. No knowledge of abstract…

A permutation group is {\it binary} if its orbits on $k$-tuples, for any integer $k\geq 2$, can be deduced from its orbits on $2$-tuples. Cherlin conjectured that a finite primitive binary permutation group $G$ must lie in one of three…

In [arXiv:1904.12333], we introduced the concept of escaping set in general setting for a topological space and extended the notion of limit set and escaping set for the general semigroup generated by continuous self maps. In this paper we…

Marius T\u{a}rn\u{a}uceanu described the finite groups $G$ having $|G|-1$ cyclic subgroups. We describe the finite groups $G$ having $|G|-\Delta$ cyclic subgroups for $\Delta=2, 3, 4$ and $5$.

We describe two similar but independently-coded computations used to construct a complete catalogue of the transitive groups of degree less than $48$, thereby verifying, unifying and extending the catalogues previously available. From this…

The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism)…

We consider the determination of the number $c_k(\alpha)$ of ordered factorisations of an arbitrary permutation on n symbols, with cycle distribution $\alpha$, into k-cycles such that the factorisations have minimal length and such that the…

Let $G$ be a finite abelian group and $E$ a subset of it. Suppose that we know for all subsets $T$ of $G$ of size up to $k$ for how many $x \in G$ the translate $x+T$ is contained in $E$. This information is collectively called the $k$-deck…

For a given variety of groups $\X$, we develop a systematic theory of $\CSX$-groups and $\XT$-groups, extending ideas proposed in \cite{Shah}. We analyze the interplay between these classes, describe their structural properties, and examine…

Let $G$ be a transitive permutation group acting on a finite set $\Omega$ with $|\Omega|\geqslant 2$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$, and by a theorem of Jordan from 1872, $G$ always…

A graph is edge-transitive if its automorphism group acts transitively on the edge set. In this paper, we investigate the automorphism groups of edge-transitive graphs of odd order and twice prime valency. Let $\Gamma$ be a connected graph…

In this triple of papers, we examine when two cycle-free partial orders can share an abstract automorphism group. This question was posed by M. Rubin in his memoir concerning the reconstruction of trees. In this middle paper, we adapt a…

In \cite {kl1}, we extended various notions of recurrence for the generalized semigroup analogous to their counterpart in the classical theory of dynamics. In this paper, we shall address the alternative definition of chain recurrent set in…