Related papers: Transitive generalized toggle groups containing a …

For each of the 14 classes of edge-transitive maps described by Graver and Watkins, necessary and sufficient conditions are given for a group to be the automorphism group of a map, or of an orientable map without boundary, in that class.…

A broad range of nonlinear processes over networks are governed by threshold dynamics. So far, existing mathematical theory characterizing the behavior of such systems has largely been concerned with the case where the thresholds are…

We prove that thick groups (and more generally thick graphs) have trivial Floyd boundary. This shows a wide class of finitely generated groups that are non-relatively hyperbolic have trivial Floyd boundary. In addition to giving new…

It has been recently shown that, under appropriate hypotheses, the $\omega$-limit sets of a dynamical system are characterized by internal chain transitivity. In this paper, we examine generalizations of these ideas in the context of the…

We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…

This paper studies the long-standing open problem of the reduction of Steiner 3-designs admitting a block-transitive automorphism group. We prove that if G acts as a point-primitive, block-transitive automorphism group of a nontrivial…

The goal of this article is to clarify the relationship between the topos of triads and the neo-Riemannian PLR-group. To do this, we first develop some theory of generalized interval systems: 1) we prove the well known fact that every pair…

The finite sharply $2$-transitive groups were classified by Zassenhaus in the 1930's. They essentially all look like the group of affine linear transformations $x\mapsto ax+b$ for some field (or at least near-field) $K$. However, the…

In this article we present a unification of the theory of algebraic, singular, topological and directional transition matrices by introducing the (generalized) transition matrix which encompasses each of the previous four. Some transition…

We study a simple generalization of the rotation (or circular shift) of the binary sequences. In particular, we show each orbit of this generalized rotation has a certain statistical symmetry. This generalized rotation naturally arises when…

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…

A finite group $G$ is called a Schur group, if any Schur ring over $G$ is the transitivity module of a permutation group on the set $G$ containing the regular subgroup of all right translations. It was proved by R. P\"oschel (1974) that…

Let T denote Thompson's group of piecewise 2-adic linear homeomorphisms of the circle. Ghys and Sergiescu showed that the rotation number of every element of T is rational, but their proof is very indirect. We give here a short, direct…

Bestvina and Feighn showed that a morphism S --> T between two simplicial trees that commutes with the action of a group G can be written as a product of elementary folding operations. Here a more general morphism between simplicial trees…

Suppose that a group $G$ has socle $L$ a simple large-rank classical group. Suppose furthermore that $G$ acts transitively on the set of lines of a linear space $\mathcal{S}$. We prove that, provided $L$ has dimension at least 25, then $G$…

For an integer $s\geq1$ and a graph $\Gamma$, a path $(u_0, u_1, \ldots, u_{s})$ composed of vertices of $\Gamma$ is called an {\em $s$-geodesic} if it is a shortest path between $u_0$ and $u_s$. We say that $\Gamma$ is {\em $s$-geodesic…

Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(G)$ of $G$ is either a connected graph of diameter at most four, or…

Let $G$ be a nontrivial transitive permutation group on a finite set $\Omega$. An element of $G$ is said to be a derangement if it has no fixed points on $\Omega$. From the orbit counting lemma, it follows that $G$ contains a derangement,…

Braman [B08] described a construction where third-order tensors are exactly the set of linear transformations acting on the set of matrices with vectors as scalars. This extends the familiar notion that matrices form the set of all linear…

Let $G$ be a collineation group of a thick finite generalised hexagon or generalised octagon $\Gamma$. If $G$ acts primitively on the points of $\Gamma$, then a recent result of Bamberg et al. shows that $G$ must be an almost simple group…