SearcharxivSearch

arXiv subjects

Jacob A. Siehler

Publications and source records attributed to Jacob A. Siehler.

3 recordsLinked to original sources

Some Central Digraphs and their Automorphisms

We define a family of finite directed graphs $G(k,c,w)$ on vertex set ${\mathbb{Z}/k\mathbb{Z}}\times {\mathbb{Z}/k\mathbb{Z}}$, where $w\in{\mathbb{Z}/k\mathbb{Z}}^\times$ has multiplicative order $c$, which divides $k$. We show that each $G(k,c,w)$ is a central digraph (its adjacency matrix squares to the all-ones matrix). We deduce explicit descriptions of the graph automorphism groups for graphs of type $G(k,1,1)$; $G(k,2,-1)$ when $k$ is even; and $G(p^2, p, 1+p)$, when $p$ is prime.

math.CO

Selections Without Adjacency on a Rectangular Grid

Using T(m,n;k) to denote the number of ways to make a selection of k squares from an (m x n) rectangular grid with no two squares in the selection adjacent, we give a formula for T(2,n;k), prove some identities satisfied by these numbers, and show that T(2,n;k) is given by a degree k polynomial in n. We give simple formulas for the first few (most significant) coefficients of the polynomials. We give corresponding results for T(3,n;k) as well. Finally we prove a unimodality theorem which shows, in particular, how to choose k in order to maximize T(2,n;k).

math.CO

Braided Near-group Categories

A near-group category is an additively semisimple category with a product such that all but one of the simple objects is invertible. We classify braided structures on near-group categories, and give explicit numerical formulas for their associativity and commutativity morphisms.

math.QA