Related papers: Conway groupoids, regular two-graphs and supersimp…
Motivated by the study of a certain family of classical geometric problems we investigate the existence of multiplicative connections on proper Lie groupoids. We show that one can always deform a given connection which is only approximately…
We give a general construction leading to different non-isomorphic families $\Gamma_{n,q}(\K)$ of connected $q$-regular semisymmetric graphs of order $2q^{n+1}$ embedded in $\PG(n+1,q)$, for a prime power $q=p^h$, using the linear…
We show that double cosets of the infinite symmetric group with respect to some special subgroups admit natural structures of semigroups. We interpret elements of such semigroups in combinatorial terms (chips, colored graphs,…
Using cyclotomic classes of order twelve for certain finite fields, we construct an infinite family of almost difference sets and normally regular graphs applying the theory of cyclotomy. We show that in each of these fields neither the…
Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…
Applying a method of Godsil and McKay \cite{GM} to some graphs related to the symplectic graph, a series of new infinite families of strongly regular graphs with parameters…
Frucht showed that, for any finite group $G$, there exists a cubic graph such that its automorphism group is isomorphic to $G$. For groups generated by two elements we simplify his construction to a graph with fewer nodes. In the general…
We determine all factorisations $X=AB$, where $X$ is a finite almost simple group and $A,B$ are core-free subgroups such that $A\cap B$ is cyclic or dihedral. As a main application, we classify the graphs $\Gamma$ admitting an almost simple…
Topological drawings are representations of graphs in the plane, where vertices are represented by points, and edges by simple curves connecting the points. A drawing is simple if two edges intersect at most in a single point, either at a…
This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…
Given an integer $k\ge3$ and a group $G$ of odd order, if there exists a $2$-$(v,k,1)$-design and if $v$ is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to $G$. A weaker result is proved…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
Let $\Gamma$ be a {Conway 99-graph}, that is, a strongly regular graph with parameters $(99,14,1,2)$. In Makhnev and Minakova (On automorphisms of strongly regular graphs with parameters $\lambda =1$, $\mu= 2$, Discrete Math.\ Appl.\ 14 (2)…
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…
To a set $\mathcal{B}$ of 4-subsets of a set $\Omega$ of size $n$ we introduce an invariant called the `hole stabilizer' which generalises a construction of Conway, Elkies and Martin of the Mathieu group $M_{12}$ based on Loyd's…
In this paper we construct two groupoids from morphisms of groupoids, with one from a categorical viewpoint and the other from a geometric viewpoint. We show that for each pair of groupoids, the two kinds of groupoids of morphisms are…
Let $G$ be a group. The intersection graph $\Gamma(G)$ of $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two…
Let $G$ be a permutation group on a set $\Omega$. A subset of $\Omega$ is a base for $G$ if its pointwise stabiliser in $G$ is trivial. In this paper we introduce and study an associated graph $\Sigma(G)$, which we call the Saxl graph of…
The use of double groupoids and their associated double Lie algebroids and characteristic distributions is proposed for the description and analysis of continuous media that carry two different constitutive or geometric structures. Various…
It is shown that the supersymmetry-preserving automorphisms of any non-linear sigma-model on K3 generate a subgroup of the Conway group Co_1. This is the stringy generalisation of the classical theorem, due to Mukai and Kondo, showing that…