Fast Toric Algorithms Over Local Fields

Speaker: 

Professor Maurice Rojas

Institution: 

Texas A&M University

Time: 

Thursday, April 12, 2012 - 3:00pm

Location: 

RH 440R

We show how to efficiently count exactly the number of solutions of a system of n polynomials in n variables over certain local fields L, for a new class of polynomials systems. The fields we handle include the reals and the p-adic rationals. The polynomial systems amenable to our methods are made up of certain A-discriminant chambers, and our algorithms are the first to attain polynomial-time in this setting. We also discuss connections to Baker's refinement of the abc-Conjecture, Smale's 17th Problem, and tropical geometry. The results presented are, in various combinations, joint with Martin Avendano, Philippe Pebay, Korben Rusek, and David C. Thompson.

Balanced subgroups

Speaker: 

Professor Carl Pomerance

Institution: 

Dartmouth College

Time: 

Thursday, February 9, 2012 - 3:00pm

Location: 

RH 440R

For an integer n > 2, the unit group modulo n has an even number
of elements, with half of them having representatives in (0,n/2)
and the other half having representatives in (n/2,n). It is
"balanced". Say a subgroup H of this unit group is "balanced"
if each coset of H is evenly split between the bottom half and
the top half. Suppose g>1 is a fixed integer. We are concerned with
the distribution of numbers n coprime to g for which the
cyclic subgroup in the unit group mod n is balanced.
This has an application to the statistical study of the rank
of the Legendre curve over function fields. (Joint work with
Douglas Ulmer.)

On the parity conjecture for Selmer groups of modular forms

Speaker: 

Dr. Liang Xiao

Institution: 

University of Chicago

Time: 

Thursday, January 19, 2012 - 2:00pm

Location: 

RH 306

The parity conjecture is a weak version of Birch-Swinnerton-Dyer
Conjecture or more generally, Beilinson-Bloch-Kato Conjecture. It is
conjectured that the vanishing order of the L-function at the central
point has the same parity as the dimension of the Bloch-Kato Selmer
group. I will explain an approach to this conjecture for modular
forms by varying the modular forms in a p-adic family. This is a joint
work with Kiran Kedlaya and Jay Pottharst.

Complexity in coding theory

Speaker: 

Professor Daqing Wan

Institution: 

UCI

Time: 

Thursday, November 3, 2011 - 3:00pm

Location: 

RH 440R

Among the most important complexity problems in
coding theory are the maximun likelihood decoding
and the computation of the minimun distance.
In this talk, we explain a self-contained, quick and
transparent proof of the NP-hardness of these
problems based on the subset sum problem over
finite fields.

On nonvanishing of the central value of the Rankin-Sleberg L-functions

Speaker: 

Professor Dihua Jiang

Institution: 

University of Minnesota

Time: 

Thursday, November 17, 2011 - 3:00pm

Location: 

RH 440R

After introducing the basic theory of automorphic forms and L-functions, we will discuss the characterization
of the nonvanishing of the central value of certain Rankin-Selberg L-functions in terms of periods of automorphic
forms. This is part of the global Gan-Gross-Prasad conjecture, which was first announced in early 1990's by
Gross and Prasad and was reformulated by Gan, Gross and Prasad in 2010. Our results were accummulated in
a series of my three papers (2004, 2005, 2009), joint with Ginzburg and Rallis and a more recent paper (2010)joint with Ginzburg and Soudry.

The two-variable approach to evaluating the derivative of a p-adic L-function

Speaker: 

Ralph Greenberg

Institution: 

University of Washington

Time: 

Thursday, October 20, 2011 - 3:00pm

Location: 

RH 306

The p-adic L-function attached to an elliptic curve with split, multiplicative reduction at the prime p will vanish at s=1. This is an example of what we call a "trivial zero." This talk will outline the way that Glenn Stevens and I proved a formula for the derivative at s=1 for that function.

Rational Points on Varieties

Speaker: 

Christopher Davis

Institution: 

UCI

Time: 

Thursday, June 2, 2011 - 2:00pm

Location: 

RH 306

Finding a point on a variety amounts to finding a solution to a system of
polynomials. Finding a "rational point" on a variety amounts to finding a
solution with coordinates in a fixed base field. (Warning: our base field
will not be the field of rational numbers Q.) We will present some
theorems about when it is possible to find such a rational point. We will
state Tsen's theorem and the Chevalley-Warning Theorem. We will also
state some more recent results of Hassett-Tschinkel and
Graber-Harris-Starr, which rely on the notion of a "rationally connected
variety". This notion is an analogue of the notion of "path
connectedness" in topology.

Pages

Subscribe to RSS - Number Theory