Вы находитесь на странице: 1из 4

Notes form Steven T Doughrty s Web Page

I prefer ...
y y y y y y y y y y y y y y

Plato to Aristotle Augustine to Aquinas Icons to Western Religious Art Lao Tzu to Confucius Algebra to Analysis Euler to Gauss Pure Mathematics to Applied Mathematics Leibniz to Newton Mozart to Bach Tolstoy to Dostoevsky Michaelangelo to DaVinci War and Peace to Anna Karenina Puccini to Wagner Sherlock Holmes to M. Poirot

I think that
y y y

Mathematics is discovered and not created. the iconoclasts were absolutely wrong. it is far better to be a vegetarian than a carnivore.

Interests of Steven Dougherty


I am very interested in the Byzantine Catholic Church and in the Roman Catholic Church. I also direct a choir that sings for Byzantine and Roman liturgies and I am a cantor for Saint Mary's Byzantine Catholic Church in Taylor, PA.

I am also interested in the following:


y y y y y y y

A capella music Singing Slavonic Prostopinije Playing the guitar, mandolin, mandola, ruan, and piano. Iconography Christian Liturgy Vegetarianism The Writings of Leo Tolstoy, Thomas Merton and others

Notes form Steven T Doughrty s Web Page


France, Korea, Italy, Japan and Russia, and their cultures. Cycling Gardening Playing Racquetball

y y y y

1. Codes over Rings Initially codes were studied over the binary field and then over finite fields in general. Following the understanding that certain families of codes were the images of line codes over Z4 codes over rings started to be studied. Codes are now studied over a variety of rings with numerous interesting questions arising from their study. 2. Self-Dual Codes Self-Dual codes are codes that are equal to their orthogonal. They have interesting connections to unimodular lattices and symmetric designs. One of the most fascinating aspects of their study is the use of invariant theory to determine all possible weight enumerators for self-dual codes over a given ring. 3. MDR and MDS Codes MDR and MDS codes are codes meeting the algebraic and combinatorial generalizations of the Singleton bound. They have numerous applications to finite geometry.

Notes form Steven T Doughrty s Web Page

4. Weight Enumerators and MacWilliams Relations Weight enumerators are polynomials which describe the weight distribution of the vectors in a code. The weight enumerator for the orthogonal can be determined by using the MacWilliams relations. These relations apply for codes over Frobenius rings. 5. Latin Squares and Nets Latin squares were first defined by Euler in his landmark 1782 paper. Most of the fundamental questions involving mutually orthogonal latin squares remain open centuries after they were first posed. Nets are the geometric equivalent of a self of mutually orthogonal Latin squares. 6. Finite projective planes Finite affine and projective planes are designs that satisfy the classical axioms of finite geometry. Fundamental questions about their existence remain open. 7. Combinatorial Game Theory My coauthors and I have defined combinatorial games on the finite planes and on Japanese ladders. These games can be found on my publication page. 8. Japanese Ladders and the Braid Group

Notes form Steven T Doughrty s Web Page

Japanese ladders are a visual way of representing permutations. They are related to the braid group which is group which arises in topology and relates to knot theory.

Вам также может понравиться