Previous talks Home People Research Areas Talk Schedule Abstracts of talks UCSD seminars


Talks in the CSUSM Math Colloquium: Academic Year 2005-2006


Fall Semester 2005

Organized by Radhika Ramamurthi
date Room speaker title (click for an abstract)
Sept. 6 SCI2 306 Gina Sanders Star-colorings of outerplanar bipartite graphs
Oct. 11 SCI2 306 Joshua Lovelace The theory behind a card game: It-DAH-gan
Nov. 29 SCI2 306 Heydar Zahedani An invitation to J*-algebras




Spring Semester 2006

Organized by Radhika Ramamurthi
date Room speaker title (click for an abstract)
May 2 Sci2 306 Wayne Aitken The Local_Global Principle in Number Theory:
From Lagrange to the Clay Millenium Prize, Part 2 of 2.
Apr. 25 Sci2 306 Wayne Aitken The Local_Global Principle in Number Theory:
From Lagrange to the Clay Millenium Prize, Part 1 of 2.
Apr. 18 Sci2 306 Mai Orloff Error Estimates for Linear Systems
Thesis Proposal presentation
Apr. 11 Sci2 306 Andrew Detzel Fixed Point Theorems in Metric Spaces
Apr. 4 Sci2 302
ROOM CHANGE!!!
Robert Juergens Mathematical and Computational Issues in Geographic Projections
A Math Club sponsored talk
Mar. 21 SCI2 306 Heydar Zahedani Caratheodory's definition of the derivative
Feb. 21 SCI2 306 Douglas Haessig An introduction to Number Theory from a p-adic point of view.
Feb. 14 SCI2 306 Tejinder Neelon The combinatorics of higher order chain rules
Feb. 7 SCI2 306 Mary Stewart Finite Simple Groups and tests for non-simplicity
Thesis Proposal presentation

Jan. 31 SCI2 306 Marshall Whittlesey Goursat's Theorem and its proof


Abstracts from Fall 2005

An invitation to J*-algebras. by Heydar Zahedani, CSUSM Math.
A J*-algebra is a closed complex subspace A of the space of all bounded linear transformations from one Hilbert space to another such that aa*a belongs to A whenever a belongs to A. J*-algebras were introduced by L. Harris and was shown that the open unit ball of J*-algebras are bounded symmetric homogeneous domains and that many holomorphic properties of these domains can be expressed in terms of the algebraic properties of the associated J*-algebras. Harris also established an algebraic theory for J*- algebras in analogy to that of C*-algebras. We show that many results of C*-algebras can be generalized to that of J*-algebras

The theory behind a card game: It-DAH-gan by Joshua Lovelace, CSUSM Math.
Many people ask the question of math students, "How are you ever going to use that in your life?" The Purpose of this talk is to give a real-life example of how mathematics can be applied to the real world in a very exciting way; more specifically to the entertainment and gaming industry! Most games of interest, in fact, depend on probability theory at some level. During this talk I will cover what makes a game "fun" as well as basic probability concepts. I will then discuss the ideas behind the creation of the card game It-DAH-gan, and how mathematical principles were used in the structuring of the deck as well as the rules. This talk should be very appealing to all math students including undergraduate math-majors as well as potential math majors. You can find the game on-line.

Star-colorings of outerplanar bipartite graphs by Gina Sanders, CSUSM Math & Palomar College.
Graph coloring is one of the most active research areas in graph theory. A proper coloring of a graph G is a coloring of the vertices so that no edge is monochromatic. A refinement of such a coloring is to additionally require that the graph has no 2-colored path on 4 vertices as a subgraph -- this refinement is called a star-coloring of G or an apathic coloring of G. This talk is a repeat of the thesis defense presentation held in summer. The result presented establishes that the star-chromatic number of outerplane bipartite graphs is at most 5. This result is shown to be sharp by the construction of a outerplane bipartite graph that requires 5 colors. This is joint work with thesis advisor, Dr. Ramamurthi.


Abstracts from Spring 2006

The Local_Global Principle in Number Theory: From Lagrange to the Clay Millenium Prize, a 2-part talk by Wayne Aitken, CSUSM Math
The topic will be covered in two talks. In the first talk I will discuss Lagrange's classic descent method for solving quadratic Diophantine equations, and recent methods that improve it. Then I will discuss Legendre's theorem, and Hasse's interpretation of this theorem as a "Local-Global Principle".
After this talk, you will know how to find integer solutions to equations such as a x^2 + b y^2 = c z^2 if they exist, and be able to tell when such solutions do not exist. (I am excluding x=y=z=0 as a solution since it is really boring).
In the second part, I will discuss how the Local-Global Principle fails. Counter-examples give us elements of a group called the Tate-Shaferevich group. I will discuss how this group is still very mysterious to number theorists and how the finiteness of this group is related to a famous conjecture: The Birch and Swinnerton-Dyer Conjecture. This conjecture is one of the seven millennium prizes: if you solve it the Clay foundation will give you a million dollars. This talk might not tell you exactly how to get a million dollars (that is up to you), but it will show you some interesting counter-examples.

Error Estimates for Linear Systems by Mai Orloff, CSUSM Math

The traditional condition number K(A) of a Matrix A is defined as the product of the norm of A and the norm of the inverse of A. It is used to determine how accurately one can solve linear systems of equations Ax = b. Due to potential problems with K(A), other condition numbers defined by Skeel, by Chandrasekaran and Ipsen, and by Yang Cao and Linda Petzold are discussed. This presentation will concentrate on Yang Cao and Linda Petzold's definition and their method of estimating their condition number. Their estimate is based on adjoint equation in combination with small sample statistical theory. This method is claimed to be easy to implement and inexpensive to compute.

Fixed Point Theorems in Metric Spaces by Andrew Detzel, CSUSM Math

Suppose X is a complete metric space M with metric d. We say a sequence xj of elements in M is a contractive sequence provided there is a constant 0
Mathematical and Computational Issues in Geographic Projections by Rob Juergens, Environmental Systems Research Institute

Outside of money considerations, 70% of all government decisions is based on geographic data. And maps (and GPS type data) is increasingly being used by almost everyone, as well as by practically every government agency, from the city level up to the international level. However, the drawing of accurate and useful maps, which involves depicting a spherical surface on a flat plane, is extremely difficult to do. This talk will explore the issues involved in projecting map surfaces, from a historical, mathematical, and computational perspective. Although a knowledge of trigonometry and/or geometry would aid the listener, it is not necessary for understanding the concepts being discussed.

Goursat's Theorem and its proof by Marshall Whittlesey
A function f(z) of a complex variable z is said to be differentiable at z if the limit of [f(z+h)-f(z)]/h as h approaches 0 exists. If this limit exists and equals L, we write that f '(z)=L. This is much the same as the definition for a function of a real variable - the only serious difference being that h is a complex number converging to zero.
In calculus, students learn that a function of a real variable can be differentiable, but there may not exist a second derivative. In this talk we will discus Goursat's remarkable theorem (proven in 1900) that if f '(z) exists in some open domain, then f '(z) is continuous in z. Earlier work of Cauchy then shows that f must be differentiable infinitely many times.

Finite Simple Groups and tests for non-simplicity by Mary Stewart
A simple group G is a nontrivial group that has only the group G and the group {e} as normal subgroups. In this talk, we will mention some examples of finite simple groups and discuss the Classification Theorem, which classifies all such groups. We will also provide some interesting examples for proving certain groups are not simple, based on results and tools of group theory.

The Combinatorics of higher order chain rules by Tejinder Neelon
Suppose y = f(x) and w=g(y) are two functions with sufficient number of derivatives. The chain rule states that (g o f)'(x) = g'(f(x)).f'(x). What is the formula for the nth derivative of the composition g o f in terms of the derivatives of g anf f? The well known answer is the Faa Di Bruno formula. The Faa di Bruno formula can be understood from many different points of view. We will focus on three different versions: the set-partition version, Riordan's Bell polynomial version, and the determinant version. We will also show that the proof becomes quite straight-forward if we consider the analogous formula for power series.

An introduction to Number Theory from a p-adic point of view. by Douglas Haessig, Mathematics Department, UC Irvine
Many number theorists are interested in the solution sets of multivariable polynomial equations. For example, Fermat's last theorem asks about integer solutions of the polynomial equation xn + yn = zn. In this talk, we will see how the solution set of a quadratic equation depends on the domain of the variables. This will lead us into defining the "p-adic numbers," and as an application of these p-adic numbers, we finish with a discussion on counting the number of solutions to a famous cubic equation using d ifferential equations! The talk will be accessible to all math students.

Caratheodory's definition of the derivative by Heydar Zahedani,
Mathematics Department, CSUSM

The function f, defined on the interval U, is said to be differentiable at the point a in U if there exits a function g that is continuous at x=a and satisfies the relation: f(x)-f (a) = g(x) (x-a) for all x in U.
Constantin Caratheodory (1873-1950) gave this formulation of the derivative for complex-valued functions in his last textbook. We show that how Caratheodory's characterization of differentiability simplifies the proofs of the basic differentiability theorems for real-valued functions of one variable, in particular the proof of the Chain Rule. We also consider the extension to functions of several variables and discuss some of the advantages it has over Frechet's characterization of differentiability.