Smith forms for adjacency matrices of circulant graphs

We calculate the Smith normal form of the adjacency matrix of each of the following graphs or their complements (or both): complete graph, cycle graph, square of the cycle, power graph of the cycle, distance matrix graph of cycle, Andrásfai graph, Doob graph, cocktail party graph, crown graph, prism graph, Möbius ladder. The proofs operate by finding the abelianization of a cyclically presented group whose relation matrix is column equivalent to the required adjacency matrix

Unimodular integer circulants associated with trinomials

The n � n circulant matrix associated with the polynomial [image removed] (with d < n) is the one with first row (a0 ? ad 0 ? 0). The problem as to when such circulants are unimodular arises in the theory of cyclically presented groups and leads to the following question, previously studied by Odoni and Cremona: when is Res(f(t), tn-1) = �1? We give a complete answer to this question for trinomials f(t) = tm � tk � 1. Our main result was conjectured by the author in an earlier paper and (with two exceptions) implies the classification of the finite Cavicchioli?Hegenbarth?Repov? generalized Fibonacci groups, thus giving an almost complete answer to a question of Bardakov and Vesnin

Fibonacci type semigroups

We study "Fibonacci type" groups and semigroups. By establishing asphericity of their presentations we show that many of the groups are infinite. We combine this with Adjan graph techniques and the classification of the finite Fibonacci semigroups (in terms of the finite Fibonacci groups) to extend it to the Fibonacci type semigroups

Portable random number generators

Computers are deterministic devices, and a computer-generated random number is a contradiction in terms. As a result, computer-generated pseudorandom numbers are fraught with peril for the unwary. We summarize much that is known about the most well-known pseudorandom number generators: congruential generators. We also provide machine-independent programs to implement the generators in any language that has 32-bit signed integers-for example C, C++, and FORTRAN. Based on an extensive search, we provide parameter values better than those previously available.Programming (Mathematics) ; Computers

Learning from Our Conflicts

This devotional address was given to the BYU student body on June 27, 2006

Isomorphism theorems for classes of cyclically presented groups

We consider two multi-parameter classes of cyclically presented groups, introduced by Cavicchioli, Repov s, and Spaggiari, that contain many previously considered families of cyclically presented groups of interest both for their algebraic and for their topological properties. Building on results of Bardakov and Vesnin, O'Brien and the previously named authors, we prove theorems that establish isomorphisms of groups within these families