Related papers: Towards inductive proofs in algebraic combinatoric…

Let $s$ be a positive integer. A graph is $s$-transitive if its automorphism group is transitive on s-arcs but not on $(s + 1)$-arcs. In this paper, we study all tetravalent s-transitive graphs of order $6p^2$.

Tournaments are graphs obtained by assigning a direction for every edge in an undirected complete graph. We give a formula for the number of isomorphism classes of vertex-transitive tournaments with prime order. For that, we introduce…

The so-called Tits class, associated to an adjoint absolutely almost simple algebraic group, provides a cohomological obstruction for this group to admit an outer automorphism. If the group has inner type, this obstruction is the only one.…

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

We continue the analysis of the Modular Isomorphism Problem for $2$-generated $p$-groups with cyclic derived subgroup, $p>2$, started in [D. Garc\'ia-Lucas, \'A. del R\'io, and M. Stanojkovski. On group invariants determined by modular…

A graph is said to be symmetric if its automorphism group is transitive on its arcs. Guo et al. (Electronic J. Combin. 18, \#P233, 2011) and Pan et al. (Electronic J. Combin. 20, \#P36, 2013) determined all pentavalent symmetric graphs of…

The operation of switching a graph $\Gamma$ with respect to a subset $X$ of the vertex set interchanges edges and non-edges between $X$ and its complement, leaving the rest of the graph unchanged. This is an equivalence relation on the set…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

We give a construction of a family of designs with a specified point-partition, and determine the subgroup of automorphisms leaving invariant the point-partition. We give necessary and sufficient conditions for a design in the family to…

Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…

For each finite classical group $G$, we classify the subgroups of $G$ which act transitively on a $G$-invariant set of subspaces of the natural module, where the subspaces are either totally isotropic or nondegenerate. Our proof uses the…

First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…

In two previous papers we constructed new families of completely regular codes by concatenation methods. Here we determine cases in which the new codes are completely transitive. For these cases we also find the automorphism groups of such…

A graph is called {\em half-arc-transitive} if its full automorphism group acts transitively on vertices and edges, but not on arcs. It is well known that for any prime $p$ there is no tetravalent half-arc-transitive graph of order $p$ or…

A conjecture of Berkovich asserts that every non-simple finite p-group has a non-inner automorphism of order p. This conjecture is far from being proved despite the great effort devoted to it. In this paper we prove it for p-groups of…

Evidences have suggested that counting representations are sometimes tractable even when the corresponding classification problem is almost impossible, or "wild" in a precise sense. Such counting problems are directly related to matrix…

A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…

We classify compact Riemann surfaces of genus $g$, where $g-1$ is a prime $p$, which have a group of automorphisms of order $\rho(g-1)$ for some integer $\rho\ge 1$, and determine isogeny decompositions of the corresponding Jacobian…