Monday, April 9, 2007

DE AND APPLIED/COMPUTATIONAL MATH SEMINAR
TIME: 3:35 p.m. - 4:25 p.m.
ROOM: Ayres Hall 309A
SPEAKER: Carrie Diaz Eaton and Andreas Aristotelous (title TBA)
TITLE: "Modeling the genetic effects of mutualistic interactions"

Wednesday, April 11, 2007

ANALYSIS SEMINAR
TIME: 3:35p.m.-4:25p.m.
ROOM: Ayres Hall 309A
SPEAKER: Dr. Michael Frazier, Mathematics Department Head
TITLE: Introduction to Littlewood-Paley Theory, 3
ABSTRACT: We use the Shannon sampling formula developed last time to give another example (besides the Haar functions) of orthonormal wavelets, the Shannon wavelets. Then we return to the phi-transform and discuss some of its applications, especially to Calderon-Zygmund operations.

Thursday, April 12, 2007

TIME: 10:10 a.m – 11:00 a.m.
ROOM: 309A Ayres Hall
SPEAKER: Professor Ilie Grigorescu, University of Miami
TITLE: Velocity bounds for TASEP with disorder
ABSTRACT: We estimate the asymptotic distribution of the fluctuations from the mean of the velocity of a tagged particle performing totally asymmetric simple exclusion (TASEP) on the integer lattice with random i.i.d. jump rates. The fluctuations are investigated in the subcritical case on a non-Gaussian scale. This is joint work with Min Kang and Timo Seppäläinen.

JUNIOR COLLOQUIUM
TIME: 3:30 p.m.
ROOM: 214 Ayres Hall
SPEAKER: Dr. Scott Chapman, Trinity University
TITLE: What is a Block Monoid?
ABSTRACT: A basic algebra course focuses on the construction of new and different algebraic objects. From our basic set of integers (denoted Z) the cyclic groups Z_n are constructed and eventually endowed with a ring structure. Given a ring R, new extension rings, such as the ring of polynomials over R (denoted R[X]), are developed.

The purpose of this talk is to introduce a new and interesting algebraic structure based on the theory of finite abelian groups. A set M with a binary operation * which satisfies all the group axioms with the exception of element inverses is known as a monoid. If G is a finite abelian group, we shall show how the set of all finite sequences of elements from G which sum to 0 form a monoid. This monoid, denoted B(G), is known as the block monoid over G. The study of block monoids has led to the investigation of two elusive combinatorial constants, known as the Davenport constant and the cross number. We shall discuss these constants and apply them to describe the factorization properties of B(G).

The Junior Colloquium is aimed primarily at undergraduate students, but all are most welcome to attend.

Pizza will be served immediately before the talk.

Friday, April 13, 2007

COLLOQUIUM

TIME: 3:35 - 4:25 p.m.
ROOM: 214 Ayres Hall
SPEAKER: Michael Jury, University of Florida
TITLE: "Function theory vs. Operator theory on the unit ball in n
ABSTRACT: It is well-known that many classical results in one complex variable do not carry over to the multivariable setting. We will consider two of these (the Nevanlinna-Pick interpolation theorem and the Littlewood subordination principle) that have attracted attention from operator theorists, and see what operator theory has to say about them. Along the way we will give a new (Operator-theoretic) proof of a version of the Littlewood subordination principle which admits a (restricted) generalization to the unit ball in n.