Is 2,394,129,303,223,424,108,132,089 Prime?

Speaker: 

Alexander Abatzoglou

Institution: 

UC Irvine

Time: 

Wednesday, March 3, 2010 - 5:00pm

Location: 

RH 440R

Primality testing and finding large prime numbers has significant applications to cryptography. In this talk I will discuss a deterministic, polynomial time algorithm for determining if an integer is prime developed by Agrawal, Kayal, and Saxena. Here polynomial time means that there exists constants c,d such that the number of operations to determine if the given integer is prime is less than c log^d(n) where n is the number we are testing for primality.

Stein's Method for the Lightbulb Process (Larry Goldstein and Haimeng Zhang)

Speaker: 

Professor Larry goldstein

Institution: 

USC

Time: 

Tuesday, March 2, 2010 - 11:00am

Location: 

RH 306

In the so called light bulb process of Rao, Rao and Zhang (2007), on days r =
1, . . . , n, out of n light bulbs, all initially off, exactly r bulbs, selected uniformly and
independent of the past, have their status changed from off to on or vice versa. With
X the number of bulbs on at the terminal time n, an even integer and = n/2, σ2 =
varX, we have
sup
∈R 􏰐
􏰐
P ( X −
σ ≤ z ) − P (Z ≤ z )
􏰐􏰐 ≤
n
2σ2 ∆0 + 1.64
n
σ3 +
2
σ
where Z is a
N (0, 1) random variable and
∆0
≤
1
2√n +
1
2n + e−
n/2
, for n
≥ 4,
yielding a bound of order O(n−1/2 ) as n
→ ∞.
The results are shown using a version of Steins method for bounded, monotone
size bias couplings. The argument for even n depends on the construction of a variable
X s on the same space as X which has the X size bias distribution, that is, which
satisfies
E[X g(X )] = E[g(X s )], for all bounded continuous g
and for which there exists a B
≥ 0, in this case, B = 2, such that X ≤ X
s
≤ X + B
almost surely. The argument for odd n is similar to that for n even, but one first
couples X closely to V , a symmetrized version of X, for which a size bias coupling of
V to V s can proceed as in the even case.

Variables Separated Equations and Finite Simple Groups

Speaker: 

Professor Mike Fried

Institution: 

Montana State U-Billings, Emeritus UCI

Time: 

Tuesday, April 6, 2010 - 2:00pm

Location: 

RH 306

Variables Separated Equations and Finite Simple Groups: Davenport's
problem is to figure out the nature of two polynomials over a number
field having the same ranges on almost all residue class fields of the
number field. Solving this problem initiated the monodromy method.
That included two new tools: the B(ranch)C(ycle)L(emma) and the
Hurwitz monodromy group. By walking through Davenport's problem with
hindsight, variables separated equations let us simplify lessons on
using these tools. We attend to these general questions:
1. What allows us to produce branch cycles, and what was their effect
on the Genus 0 Problem (of Guralnick/Thompson)?
2. What is in the kernel of the Chow motive map, and how much is it
captured by using (algebraic) covers?
3. What groups arise in 'nature' (a 'la a paper by R. Solomon)?
Each phrase addresses formulating problems based on equations. We seem
to need explicit algebraic equations. Yet why, and how much do we lose/
gain in using more easily manipulated surrogates for them? To make
this clear we consider the difference in the result for Davenport's
Problem and that for its formulation over finite fields, using a
technique of R. Abhyankar.

Rigidity for local holomorphic isometries between the ball and the product of balls

Speaker: 

Professor Yuan Yuan

Institution: 

Rutgers University

Time: 

Tuesday, March 16, 2010 - 4:00pm

Location: 

RH 306

I will talk about the rigidity for a local holomorphic isometric embedding
from ${\BB}^n$ into ${\BB}^{N_1} \times\cdots \times{\BB}^{N_m}$ with
respect to the normalized Bergman metrics. Each component of the map is a
multi-valued holomorphic map between complex Euclidean spaces by Mok's
algebraic extension theorem. By using the method of the holomorphic
continuation and analyzing real analytic subvarieties carefully, we show
that a component is either a constant map or a proper holomorphic map
between balls. Hence the total geodesy of non-constant components follows
from a linearity criterion of Huang. In fact, the rigidity is derived in a
more general setting for a local holomorphic conformal embedding. This is
a joint work with Y. Zhang.

Measures of maximal entropy for some robustly transitive diffeomorphisms

Speaker: 

Todd Fisher

Institution: 

Brigham Young University

Time: 

Friday, May 21, 2010 - 2:00pm

Location: 

RH 440R

Dynamical entropies are measures of the complexity of orbit structures. The topological entropy considers all the orbits, whereas the measure theoretic entropy focuses on those ``relevant" to a given invariant probability measure. The variational principle says that the topological entropy of a continuous self-map of a compact metrizable space is the supremum of the measure theoretic entropy over the set of invariant probability measures for the map.

A well known fact is that every transitive hyperbolic (Anosov) diffeomorphism has a unique invariant probability measure whose entropy equals the topological entropy. We analyze a class of deformations of Anosov diffeomorphisms containing many of the known nonhyperbolic robustly transitive diffeomorphisms. We show that these $C0$-small, but $C1$-macroscopic, deformations leave all the high entropy dynamics of the Anosov system unchanged, and that there is a partial conjugacy identifying all invariant probability measures with entropy close to the maximum for the deformation with those of the original Anosov system.

Additionally, we show that these results apply to a class of nonpartially hyperbolic, robustly transitive diffeomorphisms described by Bonatti and Viana and a class originally described by Mane. In fact these methods apply to several classes of systems which are similarly derived from Anosov, i.e., produced by an isotopy from an Anosov system.

The Combinatorics of Automorphic Forms

Speaker: 

Assistant Professor Benjamin Brubaker

Institution: 

MIT

Time: 

Thursday, February 25, 2010 - 4:00pm

Location: 

RH 306

Fourier coefficients of automorphic forms are the building blocks for automorphic L-functions. While these coefficients are often quite mysterious, there is one family of automorphic forms whose Fourier coefficients do have an explicit and rather uniform description -- Eisenstein series. In fact, Langlands' initial study of Eisenstein series' coefficients in the 1960's led him to make conjectures about equalities of L-functions which inform much of modern number theory. I'll discuss two new explicit descriptions for Fourier coefficients of Eisenstein series which hold in great generality and hint at undiscovered connections among automorphic forms, representation theory, and physics. One description makes use of Kashiwara crystal graphs and the other uses the 6-vertex model in statistical mechanics. Both objects possess beautiful combinatorial structure that deserves to be more widely known, though we do not assume familiarity with either and all concepts mentioned above will be defined over the course of the talk.

30 Years of Calderon's Problem

Speaker: 

Walker Family Endowed Professor of Mathematics Gunther Uhlmann

Institution: 

University of Washington

Time: 

Tuesday, March 2, 2010 - 4:00pm

Location: 

RH 306

In 1980 A. P. Calderon wrote a short paper entitled "On an inverse boundary value problem". In this seminal contribution he initiated the mathematical study of the following inverse problem: Can one determine the electrical conductivity of a medium by making current and voltage measurements at the boundary of the medium? There has been substantial progress in understanding this inverse problem in the last 30 years or so. In this lecture we will survey some of the most important developments.

Pythagorean Triples and Elliptic Curves: A Synthesis of Algebra and Geometry

Speaker: 

Barry Smith

Institution: 

UC Irvine

Time: 

Wednesday, February 24, 2010 - 5:00pm

Location: 

RH 440R

We examine methods to produce triples of integers which are the sides of a right triangle (i.e., (3,4,5), (5,12,13), or (8,15,17)). Multiplication of complex numbers will make an appearance, the first example of the interplay between algebra and geometry. We will then learn about elliptic curves, which provide a similar, but much more intricate, synthesis of algebra and geometry. Elliptic curves are a current area of intense research in mathematics and computer science, playing a central role in modern cryptology and in the recent proof of Fermat's Last Theorem.

Pages

Subscribe to UCI Mathematics RSS