Search

A partial linear space is a pair $(\mathcal{P},\mathcal{L})$ where $\mathcal{P}$ is a non-empty set of points and $\mathcal{L}$ is a collection of subsets of $\mathcal{P}$ called lines such that any two distinct points are contained in at most one line, and every line contains at least two points. A partial linear space is proper when it is not a linear space or a graph. A group of automorphisms $G$ of a proper partial linear space acts transitively on ordered pairs of distinct collinear points and ordered pairs of distinct non-collinear points precisely when $G$ is transitive of rank 3 on points. In this paper, we classify the finite proper partial linear spaces that admit rank 3 affine primitive automorphism groups, except for certain families of small groups, including subgroups of $A\Gamma L_1(q)$. Up to these exceptions, this completes the classification of the finite proper partial linear spaces admitting rank 3 primitive automorphism groups. We also provide a more detailed version of the classification of the rank 3 affine primitive permutation groups, which may be of independent interest., Comment: In this version, we have removed the assumption $V\leq H$ from 18.1 (old 13.2) and we have a new elementary proof of 10.10 (old 13.1). We have also reorganised some of the sections and made minor revisions throughout. 69 pages, 1 figure

Recent experiments show that both natural and artificial microswimmers in narrow channel-like geometries will self-organise to form steady, directed flows. This suggests that networks of flowing active matter could function as novel autonomous microfluidic devices. However, little is known about how information propagates through these far-from-equilibrium systems. Through a mathematical analogy with spin-ice vertex models, we inves tigate here the input-output characteristics of generic incompressible active flow networks (AFNs). Our analysis shows that information transport through an AFN is inherently different from conventional pressure or voltage driven networks. Active flows on hexagonal arrays preserve input information over longer distances than their passive counterparts and are highly sensitive to bulk topological defects, whose presence can be inferred from marginal input-output distributions alone. This sensitivity further allows controlled permutations on parallel inputs, revealing an unexpected link between active matter and group theory that can guide new microfluidic mixing strategies facilitated by active matter and aid the design of generic autonomous information transport networks., National Science Foundation (U.S.) (Grant CBET-1510768)

Given a finite group $G$ and a faithful irreducible $FG$-module $V$ where $F$ has prime order, does $G$ have a regular orbit on $V$? This problem is equivalent to determining which primitive permutation groups of affine type have a base of size 2. In this paper, we classify the pairs $(G,V)$ for which $G$ has a regular orbit on $V$ where $G$ is a covering group of a symmetric or alternating group and $V$ is a faithful irreducible $FG$-module such that the order of $F$ is prime and divides the order of $G$., 26 pages

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such non-equilibrium networks. Here we connect concepts from lattice field theory, graph theory, and transition rate theory to understand how topology controls dynamics in a generic model for actively driven flow on a network. Our combined theoretical and numerical analysis identifies symmetry-based rules that make it possible to classify and predict the selection statistics of complex flow cycles from the network topology. The conceptual framework developed here is applicable to a broad class of non-biological far-from-equilibrium networks, including actively controlled information flows, and establishes a new correspondence between active flow networks and generalized ice-type models., 7 pages, 4 figures; SI text available at article on pnas.org

We classify finite primitive permutation groups having a suborbit of length 5. As a corollary, we obtain a classification of finite vertex-primitive graphs of valency 5. In the process, we also classify finite almost simple groups that have a maximal subgroup isomorphic to Alt ( 5 ) or Sym ( 5 ) .

For a subgroup $L$ of the symmetric group $S_\ell$, we determine the minimal base size of $GL_d(q)\wr L$ acting on $V_d(q)^\ell$ as an imprimitive linear group. This is achieved by computing the number of orbits of $GL_d(q)$ on spanning $m$-tuples, which turns out to be the number of $d$-dimensional subspaces of $V_m(q)$. We then use these results to prove that for certain families of subgroups $L$, the affine groups whose stabilisers are large subgroups of $GL_d(q)\wr L$ satisfy a conjecture of Pyber concerning bases., 8 pages

In Bachmann's Aufbau der Geometrie aus dem Spiegelungsbegriff (1959), it was shown that a finite metric plane is a Desarguesian affine plane of odd order equipped with a perpendicularity relation on lines, and conversely. Sherk (1967) generalised this result to characterise the finite affine planes of odd order by removing the 'three reflections axioms' from a metric plane. We show that one can obtain a larger class of natural finite geometries, the so-called Bruck nets of even degree, by weakening Sherk's axioms to allow non-collinear points., We have removed the condition from our main theorem that there is a constant number of lines on any point. Instead, we have replaced it with the much weaker condition that there is a line all of whose points are thick (incident with more than 2 lines)

For an integer $n\geq 2$, the triangular graph has vertex set the $2$-subsets of $\{1,\ldots,n\}$ and edge set the pairs of $2$-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every $2$-path lies in a unique quadrangle. We refine this result and provide a characterisation of connected locally triangular graphs as halved graphs of normal quotients of $n$-cubes. To do so, we study a parameter that generalises the concept of minimum distance for a binary linear code to arbitrary automorphism groups of the $n$-cube., 9 pages

Locally triangular graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every $2$-arc lies in a unique quadrangle. A graph $\Gamma$ is locally rank 3 if there exists $G\leq \mathrm{Aut}(\Gamma)$ such that for each vertex $u$, the permutation group induced by the vertex stabiliser $G_u$ on the neighbourhood $\Gamma(u)$ is transitive of rank 3. One natural place to seek locally rank 3 graphs is among the locally triangular graphs, where every induced neighbourhood graph is isomorphic to a triangular graph $T_n$. This is because the graph $T_n$, which has vertex set the $2$-subsets of $\{1,\ldots,n\}$ and edge set the pairs of $2$-subsets intersecting at one point, admits a rank 3 group of automorphisms. In this paper, we classify the locally $4$-homogeneous rectagraphs under some additional structural assumptions. We then use this result to classify the connected locally triangular graphs that are also locally rank 3., Comment: 21 pages

Given a finite group $G$ and a faithful irreducible $FG$-module $V$ where $F$ has prime order, does $G$ have a regular orbit on $V$? This problem is equivalent to determining which primitive permutation groups of affine type have a base of size 2. Let $G$ be a covering group of an almost simple group whose socle $T$ is sporadic, and let $V$ be a faithful irreducible $FG$-module where $F$ has prime order dividing $|G|$. We classify the pairs $(G,V)$ for which $G$ has no regular orbit on $V$, and determine the minimal base size of $G$ in its action on $V$. To obtain this classification, for each non-trivial $g\in G/Z(G)$, we compute the minimal number of $T$-conjugates of $g$ generating $\langle T,g\rangle$., 17 pages, shortened proof plus new result (Theorem 1.3)

A base B for a finite permutation group G acting on a set X is a subset of X with the property that only the identity of G can fix every point of B. We prove that a primitive diagonal group G has a base of size 2 unless the top group of G is the alternating or symmetric group acting naturally, in which case a tight bound for the minimal base size of G is given. This bound also satisfies a well-known conjecture of Pyber. Moreover, we prove that if the top group of G does not contain the alternating group, then the proportion of pairs of points that are bases for G tends to 1 as |G| tends to infinity. A similar result for the case when the degree of the top group is fixed is given., Comment: 24 pages