arXiv subjects

Eric Swartz

Publications and source records attributed to Eric Swartz.

35 records · Page 2Linked to original sources

arXiv2020

Graphs that contain multiply transitive matchings

Let $Γ$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(Γ)$ that fixes the matching $\mathcal{M}$ setwise allows the edges of $\mathcal{M}$ to be permuted in any fashion. A matching $\mathcal{M}$ is \textit{2-transitive} if the setwise stabilizer of $\mathcal{M}$ in $\text{Aut}(Γ)$ can map any ordered pair of distinct edges of $\mathcal{M}$ to any other ordered pair of distinct edges of $\mathcal{M}$. We provide constructions of graphs with a permutable matching; we show that, if $Γ$ is an arc-transitive graph that contains a permutable $m$-matching for $m \ge 4$, then the degree of $Γ$ is at least $m$; and, when $m$ is sufficiently large, we characterize the locally primitive, arc-transitive graphs of degree $m$ that contain a permutable $m$-matching. Finally, we classify the graphs that have a $2$-transitive perfect matching and also classify graphs that have a permutable perfect matching.

math.CO↗

arXiv2020

A classification of finite locally 2-transitive generalized quadrangles

Ostrom and Wagner (1959) proved that if the automorphism group $G$ of a finite projective plane $π$ acts $2$-transitively on the points of $π$, then $π$ is isomorphic to the Desarguesian projective plane and $G$ is isomorphic to $\mathrm{PΓL}(3,q)$ (for some prime-power $q$). In the more general case of a finite rank $2$ irreducible spherical building, also known as a \emph{generalized polygon}, the theorem of Fong and Seitz (1973) gave a classification of the \emph{Moufang} examples. A conjecture of Kantor, made in print in 1991, says that there are only two non-classical examples of flag-transitive generalized quadrangles up to duality. Recently, the authors made progress toward this conjecture by classifying those finite generalized quadrangles which have an automorphism group $G$ acting transitively on antiflags. In this paper, we take this classification much further by weakening the hypothesis to $G$ being transitive on ordered pairs of collinear points and ordered pairs of concurrent lines.

math.GR↗

arXiv2020

On the number of reachable pairs in a digraph

A pair $(u, v)$ of (not necessarily distinct) vertices in a directed graph $D$ is called a reachable pair if there exists a directed path from $u$ to $v$. We define the weight of $D$ to be the number of reachable pairs of $D$, which equals the sum of the number of vertices in $D$ and the number of directed edges in the transitive closure of $D$. In this paper, we study the set $W(n)$ of possible weights of directed graphs on $n$ labeled vertices. We prove that $W(n)$ can be determined recursively and describe the integers in the set. Moreover, if $b(n) \geqslant n$ is the least integer for which there is no digraph on $n$ vertices with exactly $b(n)+1$ reachable pairs, we determine $b(n)$ exactly through a simple recursive formula and find an explicit function $g(n)$ such that $|b(n)-g(n)| < 2n$ for all $n \geqslant 3$. Using these results, we are able to approximate $|W(n)|$ -- which is quadratic in $n$ -- with an explicit function that is within $30n$ of $|W(n)|$ for all $n \geqslant 3$, thus answering a question of Rao. Since the weight of a directed graph on $n$ vertices corresponds to the number of elements in a preorder on an $n$ element set and the number of containments among the minimal open sets of a topology on an $n$ point space, our theorems are applicable to preorders and topologies.

math.CO↗

arXiv2019

Homomorphisms of matrix algebras and constructions of Butson-Hadamard matrices

An $n \times n$ matrix $H$ is Butson-Hadamard if its entries are $k^{\text{th}}$ roots of unity and it satisfies $HH^* = nI_n$. Write $BH(n, k)$ for the set of such matrices. Suppose that $k = p^αq^β$ where $p$ and $q$ are primes and $α\geq 1$. A recent result of {Ö}stergård and Paavola uses a matrix $H \in BH(n,pk)$ to construct $H' \in BH(pn, k)$. We simplify the proof of this result and remove the restriction on the number of prime divisors of $k$. More precisely, we prove that if $k = mt$, and each prime divisor of $k$ divides $t$, then we can construct a matrix $H' \in BH(mn, t)$ from any $H \in BH(n,k)$.

math.CO↗

arXiv2019

Spectra of Hadamard matrices

A Butson Hadamard matrix $H$ has entries in the kth roots of unity, and satisfies the matrix equation $HH^{\ast} = nI_{n}$. We write $\mathrm{BH}(n, k)$ for the set of such matrices. A complete morphism of Butson matrices is a map $\mathrm{BH}(n, k) \rightarrow \mathrm{BH}(m, \ell)$. In this paper, we develop a technique for controlling the spectra of certain Hadamard matrices. For each integer $t$, we construct a real Hadamard matrix $H_{t}$ of order $n_{t} = 2^{2^{t-1}-1}$ such that the minimal polynomial of $\frac{1}{\sqrt{n_{t}}}H_{t}$ is the cyclotomic polynomial $Φ_{2^{t+1}}(x)$. Such matrices yield new examples of complete morphisms \[ \mathrm{BH}(n, 2^{t}) \rightarrow \mathrm{BH}(2^{2^{t-1}-1}n, 2)\,, \] for each $t \geq 2$, generalising a well-known result of Turyn.

math.CO↗

arXiv2018

On generalized quadrangles with a point regular group of automorphisms

A generalized quadrangle is a point-line incidence geometry such that any two points lie on at most one line and, given a line $\ell$ and a point $P$ not incident with $\ell$, there is a unique point of $\ell$ collinear with $P$. We study the structure of groups acting regularly on the point set of a generalized quadrangle. In particular, we provide a characterization of the generalized quadrangles with a group of automorphisms acting regularly on both the point set and the line set and show that such a thick generalized quadrangle does not admit a polarity. Moreover, we prove that a group $G$ acting regularly on the point set of a generalized quadrangle of order $(u^2, u^3)$ or $(s,s)$, where $s$ is odd and $s+1$ is coprime to $3$, cannot have any nonabelian minimal normal subgroups.

math.CO↗

arXiv2018

On integers that are covering numbers of groups

The covering number of a group $G$, denoted by $σ(G)$, is the size of a minimal collection of proper subgroups of $G$ whose union is $G$. We investigate which integers are covering numbers of groups. We determine which integers $129$ or smaller are covering numbers, and we determine precisely or bound the covering number of every primitive monolithic group with a degree of primitivity at most $129$ by introducing effective new computational techniques. Furthermore, we prove that, if $\mathscr{F}_1$ is the family of finite groups $G$ such that all proper quotients of $G$ are solvable, then $\mathbb{N}-\{σ(G):G\in \mathscr{F}_1\}$ is infinite, which provides further evidence that infinitely many integers are not covering numbers. Finally, we prove that every integer of the form $(q^m-1)/(q-1)$, where $m\neq3$ and $q$ is a prime power, is a covering number, generalizing a result of Cohn.

math.GR↗

arXiv2018

Transitive PSL(2,11)-invariant k-arcs in PG(4,q)

A \textit{k}-arc in the projective space ${\rm PG}(n,q)$ is a set of $k$ projective points such that no subcollection of $n+1$ points is contained in a hyperplane. In this paper, we construct new $60$-arcs and $110$-arcs in ${\rm PG}(4,q)$ that do not arise from rational or elliptic curves. We introduce computational methods that, when given a set $\mathcal{P}$ of projective points in the projective space of dimension $n$ over an algebraic number field $\mathcal{Q}(ξ)$, determines a complete list of primes $p$ for which the reduction modulo $p$ of $\mathcal{P}$ to the projective space ${\rm PG}(n,p^h)$ may fail to be a $k$-arc. Using these methods, we prove that there are infinitely many primes $p$ such that ${\rm PG}(4,p)$ contains a ${\rm PSL}(2,11)$-invariant $110$-arc, where ${\rm PSL}(2,11)$ is given in one of its natural irreducible representations as a subgroup of ${\rm PGL}(5,p)$. Similarly, we show that there exist ${\rm PSL}(2,11)$-invariant $110$-arcs in ${\rm PG}(4,p^2)$ and ${\rm PSL}(2,11)$-invariant $60$-arcs in ${\rm PG}(4,p)$ for infinitely many primes $p$.

math.CO↗

arXiv2018

On prime order automorphisms of generalized quadrangles

In this paper, we study prime order automorphisms of generalized quadrangles. We show that, if $\mathcal{Q}$ is a thick generalized quadrangle of order $(s,t)$, where $s > t$ and $s+1$ is prime, and $\mathcal{Q}$ has an automorphism of order $s+1$, then \[ s \left\lceil \left\lceil \frac{t^2}{s+1}\right\rceil\left(\frac{s+1}{t} \right) \right\rceil \le t(s+t),\] with a similar inequality holding in the dual case when $t > s$, $t+1$ is prime, and $\mathcal{Q}$ is a thick generalized quadrangle of order $(s,t)$ with an automorphism of order $t+1$. In particular, if $s+1$ is prime and if there exists a natural number $n$ such that \[ \frac{t^2}{n+1} + t \le s + 1 < \frac{t^2}{n},\] then a thick generalized quadrangle $\mathcal{Q}$ cannot have an automorphism of order $s+1$, and hence the automorphism group of $\mathcal{Q}$ cannot be transitive on points. These results apply to numerous potential orders for which it is still unknown whether or not generalized quadrangles exist, showing that any examples would necessarily be somewhat asymmetric. Finally, we are able to use the theory we have built up about prime order automorphisms of generalized quadrangles to show that the automorphism group of a potential generalized quadrangle of order $(4,12)$ must necessarily be intransitive on both points and lines.

math.CO↗

arXiv2017

Improved User-Private Information Retrieval via Finite Geometry

In a User-Private Information Retrieval (UPIR) scheme, a set of users collaborate to retrieve files from a database without revealing to observers which participant in the scheme requested the file. Protocols have been proposed based on pairwise balanced designs and symmetric designs. Wepropose a new class of UPIR schemes based on generalised quadrangles (GQ). We prove that while the privacy of users in the previously proposed schemes could be compromised by a single user, the new GQ-UPIR schemes proposed in this paper maintain privacy with high probability even when up to $O(n^{1/4 - ε})$ users collude, where $n$ is the total number of users in the scheme.

cs.IT↗

arXiv2016

The circular altitude of a graph

In this paper we investigate a parameter of graphs, called the circular altitude, introduced by Peter Cameron. We show that the circular altitude provides a lower bound on the circular chromatic number, and hence on the chromatic number, of a graph and investigate this parameter for the iterated Mycielskian of certain graphs.

math.CO↗

arXiv2016

On the covering number of symmetric groups of even degree

If a group $G$ is the union of proper subgroups $H_1, \dots, H_k$, we say that the collection $\{H_1, \dots H_k \}$ is a cover of $G$, and the size of a minimal cover (supposing one exists) is the covering number of $G$, denoted $σ(G)$. Maróti showed that $σ(S_n) = 2^{n-1}$ for $n$ odd and sufficiently large, and he also gave asymptotic bounds for $n$ even. In this paper, we determine the exact value of $σ(S_n)$ when $n$ is divisible by $6$.

math.GR↗

arXiv2015

A note on relative hemisystems of Hermitian generalised quadrangles

In this paper we introduce a set of sufficient criteria for the construction of relative hemisystems of the Hermitian space $\mathrm{H}(3,q^2)$, unifying all known infinite families. We use these conditions to provide new proofs of the existence of the known infinite families of relative hemisystems. Reproving these results has allowed us to find new relative hemisystems closely related to an infinite family of Cossidente's, and develop techniques that are likely to be useful in finding relative hemisystems in future.

math.CO↗

arXiv2015

A classification of finite antiflag-transitive generalized quadrangles

A generalized quadrangle is a point-line incidence geometry $\mathcal{Q}$ such that: (i) any two points lie on at most one line, and (ii) given a line $\ell$ and a point $P$ not incident with $\ell$, there is a unique point of $\ell$ collinear with $P$. The finite Moufang generalized quadrangles were classified by Fong and Seitz (1973), and we study a larger class of generalized quadrangles: the \emph{antiflag-transitive} quadrangles. An antiflag of a generalized quadrangle is a non-incident point-line pair $(P, \ell)$, and we say that the generalized quadrangle $\mathcal{Q}$ is antiflag-transitive if the group of collineations is transitive on the set of all antiflags. We prove that if a finite thick generalized quadrangle $\mathcal{Q}$ is antiflag-transitive, then $\mathcal{Q}$ is either a classical generalized quadrangle or is the unique generalized quadrangle of order $(3,5)$ or its dual.

math.CO↗

arXiv2015

On $2$-arc-transitive graphs of order $kp^n$

We show that there exist functions $c$ and $g$ such that, if $k$, $n$ and $d$ are positive integers with $d> g(n)$ and $Γ$ is a $d$-valent $2$-arc-transitive graph of order $kp^n$ with $p$ a prime, then $p\leqslant kc(d)$. In other words, there are only finitely many $d$-valent 2-arc-transitive graphs of order $kp^n$ with $d>g(n)$ and $p$ prime. This generalises a recent result of Conder, Li and Potočnik.

math.CO↗

arXiv2014

On the Covering Number of Small Symmetric Groups and Some Sporadic Simple Groups

A set of proper subgroups is a covering for a group if its union is the whole group. The minimal number of subgroups needed to cover $G$ is called the covering number of $G$, denoted by $σ(G)$. Determining $σ(G)$ is an open problem for many non-solvable groups. For symmetric groups $S_n$, Maróti determined $σ(S_n)$ for odd $n$ with the exception of $n=9$ and gave estimates for $n$ even. In this paper we determine $σ(S_n)$ for $n = 8$, $9$, $10$ and $12$. In addition we find the covering number for the Mathieu group $M_{12}$ and improve an estimate given by Holmes for the Janko group $J_1$.

math.GR↗

arXiv2014

AS-configurations and skew-translation generalised quadrangles

The only known skew-translation generalised quadrangles (STGQ) having order $(q,q)$, with $q$ even, are translation generalised quadrangles. Equivalently, the only known groups $G$ of order $q^3$, $q$ even, admitting an Ahrens-Szekeres (AS-)configuration are elementary abelian. In this paper we prove results in the theory of STGQ giving (i) new structural information for a group $G$ admitting an AS-configuration, (ii) a classification of the STGQ of order $(8,8)$, and (iii) a classification of the STGQ of order $(q,q)$ for odd $q$ (using work of Ghinelli and Yoshiara).

math.GR↗