For more information about this meeting, contact Matthew Katz, James Sellers, George Andrews.
|Title:||Communal Partitions of Integers|
|Speaker:||Darren Glass, Gettysburg|
|There is a well-known formula due to Andrews that counts the number of incongruent triangles with integer sides and a fixed perimeter, which is equivalent to counting the number of triples such that no single entry is more than half the sum of all three. In this talk, we consider the analogous question counting the number of k-tuples of nonnegative integers none of which is more than 1/(k-1) of the sum of all k integers. We give an explicit function for the generating function which counts these k-tuples in the case where they are ordered, unordered, or partially ordered. Finally, we discuss the application to algebraic geometry which motivated this question.|
Room Reservation Information
|Date:||03 / 20 / 2012|
|Time:||11:15am - 12:05pm|