Related papers: $\wedge$-transitive digraphs preserving a cartesia…
These notes follow my articles [1, 6], and give some new important details. We propose here a new combinatorial method of encoding of measure spaces with measure preserving transformations, (or groups of transformations) in order to give…
Many "good" topologies for interconnection networks are based on line digraphs of regular digraphs. These digraphs support unitary matrices. We propose the property "being the digraph of a unitary matrix" as additional criterion for 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…
In this work, we explore edge direction, transitivity, and connectedness of Cayley graphs of gyrogroups. More specifically, we find conditions for a Cayley graph of a gyrogroup to be undirected, transitive, and connected. We also show a…
This paper presents a characterization of edge-transitive graphs which are four regular and have girth four. This class consists of four infinite families plus four exceptional graphs.
According to the O'Nan--Scott Theorem, a finite primitive permutation group either preserves a structure of one of three types (affine space, Cartesian lattice, or diagonal semilattice), or is almost simple. However, diagonal groups are a…
This paper is to accompany the Census of Edge-Transitive Tetravalent Graphs, available at jan.ucc.nau.edu/~swilson/C4FullSite/index.html, which is a collection of all known edge-transitive graphs of valence 4 up to 512 vertices. The Census…
These lecture notes are on automorphism groups of Cayley graphs and their applications to optimal fault-tolerance of some interconnection networks. We first give an introduction to automorphisms of graphs and an introduction to Cayley…
We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij-S\"oderberg theory. That is, given a Betti diagram, we determine if it is possible to decompose it into the Betti diagrams of complete…
This expository article is an introduction to logarithmic Gromov--Witten (GW) theory. We discuss how to study the GW theory of a smooth projective variety via simple normal crossings degenerations. We survey several approaches to…
We analyse the normal quotient structure of several infinite families of finite connected edge-transitive, four-valent oriented graphs. These families were singled out by Marusic and others to illustrate various different internal…
In this paper, we introduce a method for finding all edge-transitive graphs of small order, using faithful representations of transitive permutation groups of small degree, and we explain how we used this method to find all edge-transitive…
A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not its arc set. In this paper, we study all tetravalent half-arc-transitive graphs of order $12p$.
We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…
This article is an expository account of the theory of twisted commutative algebras, which simply put, can be thought of as a theory for handling commutative algebras with large groups of linear symmetries. Examples include the coordinate…
This paper is an exploration of the faithful transitive permutation representations of the orientation-preserving automorphisms groups of highly symmetric toroidal maps and hypermaps. The main theorems of this paper give a list of all…
We prove new general results on sumsets of sets having Szemer\'edi--Trotter type. This family includes convex sets, sets with small multiplicative doubling, images of sets under convex/concave maps and others.
We review the nearly complete classification project for finite distance-transitive graphs and compile a list of all known graphs. Interestingly, we find that those graphs with diameter larger than 4, apart from a small finite number of…
We describe two similar but independently-coded computations used to construct a complete catalogue of the transitive groups of degree less than $48$, thereby verifying, unifying and extending the catalogues previously available. From this…
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…