Related papers: Perfect 1-factorisations of $K_{16}$

This work is a continuation of Automorphisms of $K$-groups I, P. Flavell, preprint. The main object of study is a finite $K$-group $G$ that admits an elementary abelian group $A$ acting coprimely. For certain group theoretic properties…

Examples of (strongly continuous) one-parameter groups of automorphisms of UHF C*-algebras are given. One example has the property that the infinitesimal generator does not have a union of finite-dimensional subalgebras as a core. (This…

By making use of our generalization of Barrucand and Cohn's theory of principal factorizations in pure cubic fields $\mathbb{Q}(\sqrt[3]{D})$ and their Galois closures $\mathbb{Q}(\zeta_3,\sqrt[3]{D})$ with 3 possible types to pure quintic…

In his survey "Beyond graph energy: Norms of graphs and matrices" (2016), Nikiforov proposed two problems concerning characterizing the graphs that attain equality in a lower bound and in a upper bound for the energy of a graph,…

In this paper we compute the automorphism group of the curves $\mathcal{X}_{a,b,n,s}$ and $\mathcal{Y}_{n,s}$ introduced in Tafazolian et al. in 2016 as new examples of maximal curves which cannot be covered by the Hermitian curve. They…

A graph is one-regular if its automorphism group acts regularly on the set of its arcs. In this paper, $4$-valent one-regular graphs of order $5p^2$, where $p$ is a prime, are classified

We address the question of whether it may be worthwhile to convert certain, now classical, NP-complete problems to one of a smaller number of kernel NP-complete problems. In particular, we show that Karp's classical set of 21 NP-complete…

In this paper we extend the construction of Giudici, Morgan and Zhou [arXiv:2110.07896] to give the first known examples of nonregular, $2$-closed permutation groups of rank greater than $4$ that are not the automorphism group of any…

A $1-$factorization of a complete graph on $2n$ vertices is said to be $G-$regular if it posseses an automorphism group $G$ acting sharply transitively on the vertex-set. The problem of determining which groups can realize such a situation…

We present an algebraic characterization of perfect graphs, i.e., graphs for which the clique number and the chromatic number coincide for every induced subgraph. We show that a graph is perfect if and only if certain nonnegative…

We classify the symplectic automorphism groups for cubic fourfolds. The main inputs are the global Torelli theorem for cubic fourfolds and the classification of the fixed-point sublattices of the Leech lattice. Among the highlights of our…

Let $G$ be a graph of even order and let $K_{G}$ be the complete graph on the same vertex set of $G$. A pairing of a graph $G$ is a perfect matching of the graph $K_{G}$. A graph $G$ has the Pairing-Hamiltonian property (for short, the…

We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…

We show that there is no (75,32,10,16) strongly regular graph. The result is obtained by a mix of algebraic and computational approaches. The main idea is to build large enough induced structure and apply the star complement technique. Our…

Results of the computation of the automorphism groups for the groups of orders $16p$ and $16p^{2}$ are given. In some cases it has not been possible to give as complete a set of results as was done previously for the case of groups of order…

A graph is said to be {\em vertex-transitive non-Cayley} if its full automorphism group acts transitively on its vertices and contains no subgroups acting regularly on its vertices. In this paper, a complete classification of cubic…

The structure of binary self-dual codes invariant under the action of a cyclic group of order $pq$ for odd primes $p\neq q$ is considered. As an application we prove the nonexistence of an extremal self-dual $[96, 48, 20]$ code with an…

The computer calculations in arXiv:0808.0284 to classify sharp polynomials with nonegative coefficients constant on the line $x+y=1$ have been extended to degrees 19 and 21. In degree 19 a surprisingly large number of 13 sharp polynomials…

We construct a family of $(2,n)$-almost Grassmannian structures of regularity $C^1$, each admitting a one-parameter group of strongly essential automorphisms, and each not flat on any neighborhood of the higher-order fixed point. This shows…

The existence of a connected 12-regular $\{K_4,K_{2,2,2}\}$-ultrahomogeneous graph $G$ is established, (i.e. each isomorphism between two copies of $K_4$ or $K_{2,2,2}$ in $G$ extends to an automorphism of $G$), with the 42 ordered lines of…