Jordan D. Webster - ResearchGate
Jordan D. Webster currently works at the Department of Mathematics, Mid Michigan College. Jordan does research in Combinatorics.
Jordan Webster - Mid Michigan College
Jordan Webster; Jordan Webster. Full-Time Faculty - Mathematics Arts & Sciences . Contact Info. [email protected]. Phone: (989) 386-6622 x245. HA 251. Back to Directory. YouTube Icon Facebook Icon Twitter Icon LinkedIn Icon ...
Jordan Webster - Rate My Professors
Jordan Webster is a professor in the Mathematics department at Mid Michigan Community College-Mount Pleasant - see what their students are saying about them or leave a rating yourself.
1.1 Systems of linear equations and augmented matrices
Jordan D. Webster explains the connections between systems of linear equatons and matrices. We talk about elementary row operations and using the operations ...
On nonsingular regular magic squares of odd order☆
Sep 15, 2012 · Using centroskew matrices, we provide a necessary and sufficient condition for a regular magic square to be nonsingular. Using latin squares and circulant matrices we describe a method of construction of nonsingular regular magic squares of …
A construction of regular magic squares of odd order
Sep 15, 2014 · Using circulant matrices we describe a construction of regular classical magic squares that are nonsingular for all odd orders. A similar construction is given that produces regular classical magic squares that are singular for odd composite orders. This paper is an extension of [3]. 1. Introduction.
Reversible and DRAD di erence sets via tiling structures. Di erence sets with parameters (4m2;2m2m;m m) are known as Hadamard (or Menon) di erence sets. In this talk, we will use rational idempotents in the group ring to develop a theory of tiles.
Reversible and DRAD difference sets in - Webster - 2012 - Journal …
Jordan D. Webster [email protected] Department of Mathematics, Mid Michigan Community College, Michigan 48625. Search for more papers by this author
Jordan D. Webster - dblp
Jordan D. Webster: Using rational idempotents to show Turyn's bound is sharp. Des. Codes Cryptogr.
Jordan D Webster - Home - ACM Digital Library
Jordan D Webster; Jordan D Webster. Skip slideshow. Most frequent co-Author ...