Related papers: Finite primitive groups and edge-transitive hyperg…

We show that every finite group occurs as the automorphism group of infinitely many finite (field) extensions of any given Hilbertian field. This extends and unifies previous results of M. Fried and Takahashi on the global field case.

A new infinite family of bipartite cubic 3-arc transitive graphs is constructed and studied. They provide the first known examples admitting a 2-arc transitive vertex-biquasiprimitive group of automorphisms for which the index two subgroup…

We study endomorphisms of a free group of finite rank by means of their action on specific sets of elements. In particular, we prove that every endomorphism of the free group of rank 2 which preserves an automorphic orbit (i.e., acts ``like…

In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information…

The role of finite centralizers of involutions in pseudo-finite groups is analyzed. It is shown that a pseudo-finite group admitting a definable involutory automorphism fixing only finitely many elements is finite-by-abelian-by-finite. As a…

We solve the long-standing existence problem of vertex-primitive 2-arc-transitive digraphs by constructing an infinite family of such digraphs.

The fact that the adjacency matrix of every finite graph is diagonalizable plays a fundamental role in spectral graph theory. Since this fact does not hold in general for digraphs, it is natural to ask whether it holds for digraphs with…

In response to a question raised by Belolipetsky and the first author, we prove that for every finite group $G$ there are infinitely many isomorphism classes of compact complex hyperbolic $2$-manifolds with automorphism group isomorphic to…

The minimal degree of a permutation group $G$ is the minimum number of points not fixed by non-identity elements of $G$. Lower bounds on the minimal degree have strong structural consequences on $G$. In 2014 Babai proved that the…

In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…

A transitive decomposition of a graph is a partition of the edge set together with a group of automorphisms which transitively permutes the parts. In this paper we determine all transitive decompositions of the Johnson graphs such that the…

Consider a finite, regular cover $Y\to X$ of finite graphs, with associated deck group $G$. We relate the topology of the cover to the structure of $H_1(Y;\mathbb{C})$ as a $G$-representation. A central object in this study is the {\em…

Coherent configurations (CCs) are highly regular colorings of the set of ordered pairs of a "vertex set"; each color represents a "constituent digraph." CCs arise in the study of permutation groups, combinatorial structures such as…

In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this result to the infinite case. Additionally, we generalize…

We describe the full automorphism group of the power (di)graph of a finite group. As an application, we solve a conjecture proposed by Doostabadi, Erfanian and Jafarzadeh in 2013.

We classify all infinite primitive permutation groups possessing a finite point stabilizer, thus extending the seminal Aschbacher-O'Nan-Scott Theorem to all primitive permutation groups with finite point stabilizers.

Suppose that an automorphism group $G$ acts flag-transitively on a finite generalized hexagon or octagon $\cS$, and suppose that the action on both the point and line set is primitive. We show that $G$ is an almost simple group of Lie type,…

We prove that, if $\Gamma$ is a finite connected $3$-valent vertex-transitive, or $4$-valent vertex- and edge-transitive graph, then either $\Gamma$ is part of a well-understood family of graphs, or every non-identity automorphism 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…

A complete classification is given of finite groups whose elements are partitioned into three orbits by the automorphism groups, solving the long-standing classification problem initiated by G. Higman in 1963. As a consequence, a…