How much about sieves and zeta functions can we steal from number theory
Tellabs Research Center
refreshments at 3:45pm
The asymptotic enumeration of Latin squares is still an open problem. Part
of the difficulty is that if one writes down an inclusion-exclusion
expression for the desired quantity, the error term quickly swamps the main
term. Several number-theoretic 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
methods---Selberg's lambda-systems in particular---carry over readily to
many combinatorial settings.
Speaker's Contact Info: tchow(at-sign)alum.mit.edu
Return to seminar home page
Page loaded on October 14, 1998 at 10:15 AM.
Copyright © 1998-99, Sara C. Billey.
All rights reserved.