Related papers: Skew Hadamard difference sets from cyclotomic stro…
We initiate the study of Hamiltonian cycles up to symmetries of the underlying graph. Our focus lies on the extremal case of Hamiltonian-transitive graphs, i.e., Hamiltonian graphs where, for every pair of Hamiltonian cycles, there is a…
Generalizing the polynomial web category, we introduce a diagrammatic $\Bbbk$-linear monoidal category, the affine web category, for any commutative ring $\Bbbk$. Integral bases consisting of elementary diagrams are obtained for the affine…
Signed difference sets have interesting applications in communications and coding theory. A $(v,k,\lambda)$-difference set in a finite group $G$ of order $v$ is a subset $D$ of $G$ with $k$ distinct elements such that the expressions…
We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label…
Let $G$ be a finite nonabelian group, and let $\psi:G\to G$ be a homomorphism with abelian image. We show how $\psi$ gives rise to two Hopf-Galois structures on a Galois extension $L/K$ with Galois group (isomorphic to) $G$; one of these…
In this expository paper, we present a motivated construction of large graphs not containing a given complete bipartite subgraph. The key insight is that the algebraic constructions yield very non-smooth probability distributions.
A class of skew derivations on complex Noetherian generalized down-up algebras $L=L(f,r,s,\gamma)$ is constructed.
In this paper, we introduce a magneto-spectral invariant for finite graphs. This invariant vanishes on trees and is maximized by complete graphs. We compute this invariant for cycles, complete graphs, wheel graphs, hypercubes, complete…
In earlier papers, we showed a decomposition of the arcs of 2-diregular digraphs (2-dds) and used it to prove some conditions for these graphs to be non-Hamiltonian; we then extended this decomposition to a larger class of digraphs and used…
We give a new characterization of skew Hadamard matrices of size $n$ in terms of the data of the spectra of tournaments of size $n-2$.
We construct an explicit isomorphism between blocks of cyclotomic Hecke algebras and (sign-modified) Khovanov-Lauda algebras in type A. These isomorphisms connect the categorification conjecture of Khovanov and Lauda to Ariki's…
Pseudorandom binary sequences with optimal balance and autocorrelation have many applications in stream cipher, communication, coding theory, etc. It is known that binary sequences with three-level autocorrelation should have an almost…
Skew braces are intensively studied owing to their wide ranging connections and applications. We generalize the definition of a skew brace to give a new algebraic object, which we term a skew bracoid. Our construction involves two groups…
In this paper, we examine the structure of vertex- and edge-transitive strongly regular graphs, using normal quotient reduction. We show that the irreducible graphs in this family have quasiprimitive automorphism groups, and prove (using…
In this note, we provide several constructions of Deza Cayley graphs over groups having a generalized dihedral subgroup. These constructions are based on a usage of (relative) difference sets.
When we consider a finite abelian group acting linearly on a polynomial ring, we can find monomial generators for the subring of invariants. By Noether's degree bound and Hilbert's finiteness theorem, we know that there are finitely many…
Motivated by the theory of graph limits, we introduce and study the convergence and limits of linear representations of finite groups over finite fields. The limit objects are infinite dimensional representations of free groups in…
We explicitly construct new subgroups of the mapping class groups of an uncountable collection of infinite-type surfaces, including, but not limited to, free groups, Baumslag-Solitar groups, mapping class groups of other surfaces, and a…
We consider lattices generated by finite Abelian groups. We prove that such a lattice is strongly eutactic, which means the normalized minimal vectors of the lattice form a spherical 2-design, if and only if the group is of odd order or if…
A set of graphs are called cospectral if their adjacency matrices have the same characteristic polynomial. In this paper we introduce a simple method for constructing infinite families of cospectral regular graphs. The construction is valid…