Joint hosted by DIMACS and the Rutgers Math Department.
Thursday, May 27, 2010
9:00 - 9:30 Registration and Breakfast
9:30 - 10:15 How to lose as little as possible
Herb Wilf, University of Penn
10:15 - 11:00 Tangent and Secant q-Calculus and (t,q)-Calculus
Dominique Foata, University of Strasbourg, France
11:00 - 11:15 coffee break
11:15 - 12:00 Some problems for Doron and his pet, Shalosh B. Ekhad
Richard Askey, University of Wisconsin
12:00 - 1:00 lunch
1:00 - 1:20 Trudging through the 2-Large Conjecture
Aaron Robertson, Colgate University
1:20 - 1:40 The Combinatorialization of Linear Recurrences
Art Benjamin, Harvey Mudd College
1:40 - 2:00 Teaching Shalosh to sort by reversals
Vince Vatter, Dartmouth College
2:00 - 2:45 Ask Not What Doron Zeilberger Can Do For You, Ask What You Can Do For Doron Zeilberger
Aviezri Fraenkel, Weizmann Institute of Science, Israel
2:45 - 3:05 Skew diagrams and ordered trees
Melkamu Zeleke, William Paterson University
3:05 - 3:20 coffee
3:20 - 3:40 Two binomial coefficient conjectures
Eric Rowland, Tulane University
3:40 - 4:00 Extensions of Rowland's Prime-Generating Sequence
Dennis Hou, Rutgers University
4:00 - 4:45 The ABZ of Symbolic Computation in Combinatorics
Peter Paule, Johannes Kepler University Linz, Austria
4:45 - 5:05 Proof of George Andrews' and David Robbins' $q$-TSPP Conjecture
Christoph Koutschan, Tulane University
5:05 - 5:25 Experimental techniques applied to convergence of rational difference equations
Emilie Hogan, Rutgers University
5:25 - 6:10 The negative q-binomial coefficient
Dennis Stanton, University of Minnesota
6:20 Dinner at the Hill Center, Room 703
Friday, May 28, 2010
8:30 - 9:00 Registration and Breakfast
9:00 - 9:45 False Theta Functions, Mock Theta Functions, and Orthogonal Polynomials
George Andrews, Penn State University
9:45 - 10:05 Experiments with Exponential Sums over the Binary Field
Luis Medina, University of Puerto Rico
10:05 - 10:20 Pattern avoidance and alternating sign matrices
Arvind Ayyer, Institut de Physique Theorique, France
10:20 - 10:35 coffee break
10:35 - 11:20 Some recursive formulas for Selberg-type integrals
Toufik Mansour, University of Haifa, Israel
11:25 - 11:40 Modular Decomposition and Graph Reconstruction
Robert Brignall, University of Bristol, UK
11:40 - 12:00 On the number of non-overlapping permutations
Miklos Bona, University of Florida
12:00 - 1:00 lunch
1:00 - 1:20 All I Really Need To Know, I Learned From Dr. Z.
Andrew Sills, Georgia Southern University
1:20 - 1:40 On joint distribution of adjacencies, descents
and some Mahonian statistics
Alexander Burstein, Howard University
1:40 - 2:25 Zeilberger meets Jones and Thurston
Stavros Garoufalidis, Georgia Tech
2:25 - 2:45 A New Algorithm on Multi-Hypergeometic
Summations and its q-Analog
Xinyu Sun, Xavier University of Louisiana
2:45 - 3:00 coffee break
3:00 - 3:45 Some problems coming from the evaluation of integrals
Victor Moll, Tulane University
3:45 - 4:05 Mahler's measure and the WZ algorithm
Mat Rogers
4:05 - 4:25 Patterns Avoidance in Self-Avoiding Walks
Shanzhen Gao, Florida Atlantic University
4:25 - 4:45 Descent sets of cyclic permutations
Sergi Elizalde, Dartmouth College
4:45 - 5:30 The Joys of Mathematics with Doron
David Bressoud, Macalester College
Previous: Participation
Next: Registration
Workshop Index
DIMACS Homepage