Next meeting: October 4, 2014
Location: High Point University in High Point, North Caroilna
Practical information: The nearest airport is Greensboro/High Point (GSO), 20 minutes drive away. This is also known as the Piedmont Triad Airport. Within 90 minutes drive are both Raleigh-Durham (RDU) Airport and Charlotte (CLT) Airport. A cab from GSO costs about $30 each way. Hotels are about 1.5 to 3 miles from campus. Thus, a car rental may make sense for anyone flying to the meeting.
A block of hotel rooms has been reserved at the Courtyard Marriott High Point (336-882-3600), which is 1.7 miles from campus. The rooms are blocked off under "The TLC" until September 19th. However, if rooms are still available, they will honor our group rate of $119 per night (+tax) after this date. (The room includes two queen beds, wireless internet, and either a hot breakfast sandwich or two continental breakfast items, plus beverage, for 2 adults). There are many other local options including: -High Point Plaza , 1 mile from campus (more downtown). 336-889-8888 -Crestwood Suites, about 2.7 miles from campus (more economical). 336-886-5665.
Organizing Committee: Lindsay Piechnik (chair, High Point), Ed Allen (Wake Forest), Sarah Mason (Wake Forest), Seth Sullivant (NCSU), Laurie Zack (High Point)
Preregistered participants (so far):
Justin Allman, UNC Chapel Hill
Alessandro Arlotto, Duke
Spencer Backman, Georgia Tech
Daniel Bernstein, NCSU
Shankar Bhamidi, UNC Chapel Hill
Zane Blanton, UNC Chapel Hill
Daniel Brake, NCSU
Timothee Bryan, NCSU
Anders Buch, Rutgers
Noah Daleo, NCSU
Lola Davidson, U. Kentucky
Ruth Davidson, NCSU
Anahita Davoudi, University of Central Florida
Elizabeth Gross, NCSU
Ruth Haas, Smith College
Alex Happ, U. Kentucky
Jonathan Hauenstein, NCSU
Patricia Hersh, NCSU
Gabor Hetyei, UNC Charlotte
William Hill, NCSU Computer Science
Wesley Hough, U. Kentucky
Peter Humphries, North Carolina Central University
Garrett Johnson, The Catholic University of America
Stefanos Kechagias, UNC Chapel Hill
Mustafa Khandwawala, UNC Chapel Hill
Christopher Kirkland, NCSU
Florian Kohl, U. Kentucky
David Lax, UNC Chapel Hill
Alan Liddell, NCSU
Colby Long, NCSU
Shu Lu, UNC Chapel Hill
Emily Meehan, NCSU
Ezra Miller, Duke
Michael Mossinghoff, Davidson College
Sarah Nelson, U. Kentucky
Van Vinh Nguyen, Duke
Michael O'Brien, NCSU
Augustine O'Keefe, U. Kentucky
Chris O'Neill, Duke
Daniel Orr, Virginia Tech
Pablo Parrilo, MIT
Gabor Pataki, UNC Chapel Hill
Sasa Pekec, Duke
Lindsay Piechnik, High Point University
Bob Proctor, UNC Chapel Hill
Scott Provan, UNC Chapel Hill
Nathan Reading, NCSU
Richard Rimanyi, UNC Chapel Hill
Radmila Sazdanovic, NCSU
Jenny Shi, UNC Chapel Hill
Michael Singer, NCSU
Sean Skwerer, UNC Chapel Hill
Jack Snoeyink, UNC Chapel Hill
Matthew Stamps, KTH, Sweden
Shaler Stidham, Jr., UNC Chapel Hill
Blair Sullivan, NCSU
Seth Sullivant, NCSU
Eva Tardos, Cornell
Clifford Taylor, U. Kentucky
Hayato Ushijima-Mwesigwa, Clemson
Tzvetalin Vassilev, Nipissing University (Ontario, Canada) and Durham
Jia (Jasmine) Wan, Randolph College
Xuan Wang, UNC Chapel Hill
James Wilson, UNC Chapel Hill
Dongqing Yu, UNC Chapel Hill
Haojin Zhai, UNC Chapel Hill
Talk titles and abstracts (received so far):
Shankar Bhamidi, UNC Chapel Hill
Title: Limited choice and randomness in the evolution of networks.
Abstract: The last few years have seen an explosion in network models describing the evolution of real world networks. In the context of math probability, one aspect which has seen an intense focus is the interplay between randomness and limited choice in the evolution of networks, ranging from the description of the emergence of the giant component, the new phenomenon of ``explosive percolation'' and power of two choices. I will describe ongoing work in understanding such dynamic network models, their connections to classical constructs such as the standard multiplicative coalescent and local weak convergence of random trees.
Anders Buch, Rutgers
Title: Mutations of puzzles and equivariant cohomology of two-step flag varieties
Abstract: I will speak about a mutation algorithm for puzzles that is a three-direction analogue of the classical jeu de taquin algorithm for semistandard tableaux. The main application of this algorithm is a proof of a conjectured formula for the equivariant Schubert structure constants of two-step flag varieties. This formula is positive in the sense of Graham and it generalizes both Knutson and Tao's equivariant puzzle rule for Grassmannians and the cohomological puzzle rule for two-step flag varieties. Thanks to the equivariant version of the `quantum equals classical' theorem, my formula also specializes to a Littlewood-Richardson rule for the equivariant quantum cohomology of Grassmannians.
Pablo Parrilo, MIT
Title: Convex sets, conic matrix factorizations and rank lower bounds
Abstract: In optimization one often represents convex sets in terms of convex cones. Such representations or 'lifts' of a convex set are especially useful if the cone admits efficient algorithms for linear optimization over its affine slices, as in the classical cases of linear and semidefinite programming. Despite the fact that these techniques are widely used, there are many aspects (particularly, existence and efficiency) that are still poorly understood. In this talk we discuss the relationship between conic representations of convex sets, and a special "conic" factorization of an operator associated to the convex set, generalizing earlier results of Yannakakis on polyhedral lifts of polytopes and nonnegative factorizations. When the cones live in a family, our results lead to the definition of the rank of a convex set with respect to this family (e.g., psd rank of a convex set), as well as techniques for lower bounding these ranks. We will provide a gentle introduction to these techniques, emphasizing geometric intuition, open questions as well as recent results. Based on joint work with Joao Gouveia, Hamza Fawzi, James Saunderson and Rekha Thomas.
Eva Tardos, Cornell
Title: Auctions as Games, Learning, and the Price of Anarchy
Abstract: Selfish behavior can often lead to suboptimal outcome for all participants, a phenomenon illustrated by classical examples in game theory, such as the prisoner dilemma. Over the last decade, computer scientists and game theorists have developed good understanding how to quantify the impact of strategic user behavior on overall performance in many different environments, including selfish traffic routing.
In this talk, we will consider online auctions from this perspective. The Internet provides an environment running millions of auctions, an environment where simplicity is more important than perfect efficiency, and where the systems used do not satisfy the usual standards of mechanism design. We'll consider such auctions as games, and we show how to provide robust guarantees for their performance even when players participate in multiple auctions, have valuations that are complex functions of multiple outcomes, and are using learning strategies to deal with an uncertain environment. The talk will assume no previous background in game theory or auctions.
Conference organizing committee: Gabor Pataki (UNC-Chapel Hill), Lindsay Piechnik (High Point University), Scott Provan (UNC-Chapel Hill), Richard Rimanyi (UNC-Chapel Hill), Jack Snoeyink (UNC-Chapel Hill)
Eighth meeting: September 21, 2013 at NCSU.
Speakers: George Andrews (Penn State), Matt Beck (San Francisco State University), Robin Pemantle (University of Pennsylvania), and Victoria Powers (Emory University)
Organizing committee: Michael Singer (NCSU), Carla Savage (NCSU), and Seth Sullivant (NCSU)
Seventh meeting: February 9, 2013 at Wake Forest University.
Speakers: Louis Billera (Cornell), Rod Canfield (University of Georgia), Matthew Kahle (Ohio State University), Michelle Wachs (University of Miami)
Organizing committee: Sarah Mason (chair, Wake Forest University), Ed Allen (Wake Forest University), Alex Fink (NCSU), Patricia Hersh (NCSU)
Sixth meeting: September 22, 2012 at NCSU.
Speakers: Allen Knutson (Cornell), Vin de Silva (Pomona College), Richard Stanley (MIT), Lauren Williams (UC Berkeley).
Organizing committee: Alex Fink (NCSU), Patricia Hersh (NCSU), Carla Savage (NCSU).
Fifth meeting: February 11, 2012 at Duke University.
Speakers: Alex Fink (NCSU), Sergey Fomin (Michigan), Nets Katz (Indiana University), Isabella Novik (University of Washington).
Organizing Committee: Christine Berkesch (Duke), Sonja Mapes (Duke), Ezra Miller (Duke).
Fourth meeting: November 5, 2011 at UNC Chapel Hill.
Speakers: Thomas Lam (Michigan), Jesus De Loera (UC Davis), Ezra Miller (Duke), Doron Zeilberger (Rutgers)
Organizing committee: Prakash Belkale (UNC Chapel Hill), Gabor Pataki (UNC Chapel Hill), Robert Proctor (UNC Chapel Hill), Scott Provan (UNC Chapel Hill), Richard Rimanyi (UNC Chapel Hill).
Third meeting: April 9, 2011 at NC State.
Speakers: Prakash Belkale (UNC Chapel Hill), Vic Reiner (University of Minnesota), John Stembridge (University of Michigan), Stephanie van Willigenburg (UBC).
Organizing committee: Hoda Bidkhori (NCSU), Alex Fink (NCSU), Patricia Hersh (NCSU), Carla Savage (NCSU).
Second meeting: September 25, 2010 at Duke.
Speakers: Alexander Barvinok (University of Michigan), Anne Shiu (Duke), Sami Assaf (MIT), Persi Diaconis (Stanford).
Organizing committee: Patricia Hersh (NCSU), Sonja Mapes (Duke), Ezra Miller (Duke).
First meeting: February 6, 2010 at NC State.
Speakers: Carla Savage (NCSU), Bernd Sturmfels (UC Berkeley), Ed Swartz (Cornell), Laszlo Szekely (University of South Carolina).
Organizing committee: Patricia Hersh (NCSU), Ezra Miller (Duke), Scott Provan (UNC) Nathan Reading (NCSU).