How much about sieves and zeta functions can we steal from number theory
Timothy Chow
Tellabs Research Center
November 6,
4:15pm
refreshments at 3:45pm
2338
ABSTRACT

The asymptotic enumeration of Latin squares is still an open problem. Part
of the difficulty is that if one writes down an inclusionexclusion
expression for the desired quantity, the error term quickly swamps the main
term. Several numbertheoretic problems suffer from the same difficulty,
and number theorists have devised some clever methods of circumventing it,
using both sieve methods and zeta functions. We show how some of these
methodsSelberg's lambdasystems in particularcarry over readily to
many combinatorial settings.

Speaker's Contact Info: tchow(atsign)alum.mit.edu
Return to seminar home page
Page loaded on October 14, 1998 at 10:15 AM.

Copyright © 199899, Sara C. Billey.
All rights reserved.

