New York Combinatorics Seminar

Sponsored by the Graduate Center's Math Department and Computer Science Department

Fridays 11:45 am - 12:45 am in Room 4419

This seminar covers a wide range of topics in combinatorics and its applications.

The CUNY Graduate Center is located at 365 Fifth Avenue (at the corner of 34th Street), New York. It can be easily reached by subway using the B,D,F,N,Q,R, or 6 train.

Seminar Co-Organizers:
CUNY: Ezra Halleck (City Tech), Sandra Kingan (Brooklyn College), Joseph Malkevitch (York College), Kerry Ojakian (BCC)
Montclair State University: Deepak Bal, Jonathan Cutler
Hofstra University: Kira Adaricheva

Fall 2018 Talks

Sep 7, 2018: Shweta Jain (John Jay College, CUNY)

Title: Role of power centers in a social network

Abstract: Network Science has emerged as a modern multidisciplinary field which finds application in areas as diverse as political science, economics, sociology and biology. As Computer Scientists, we are interested in studying processes executing on complex networks. We model a dynamical system as a complex network where pairs of nodes engage in a two player game such as the Prisoner's Dilemma, Hawk-Dove and the Stag Hunt. The system starts with a random assignment of game strategy and then evolves as players change their strategies using update rules defined in the system. Eventually, the system may reach a steady state or oscillate indefinitely between competing strategies. Our preliminary results show that a steady state is reached when the players observe payoffs after each round and choose to imitate the most successful neighbor in the next round. However, the speed of convergence as well as the point at which convergence happens depends on the type of network. We will present preliminary results and insights in this talk.

Sep 14, 2018: Michael Barrus (University of Rhode Island)

Title: Trends toward the top of the dominance order

Abstract: The dominance order is the partial order on integer partitions arising from majorization. Among the partitions of an even integer, those that are degree sequences of simple graphs form a downward-closed subset of the poset, with the maximal graphic partitions corresponding precisely to the degree sequences of threshold graphs. We show that several properties of degree sequences and their graphs, including forced adjacency relationships, the presence of certain induced subgraphs, and how tightly the Erdos-Gallai inequalities on degree sequences hold, are all related to the degree sequences' location in the dominance order. Popping up along the way are several graph classes that, like the threshold graphs, have degree sequence characterizations and intriguing structural properties.

Oct 26, 2018: Shadisadat Ghaderi (Guttman Community College, CUNY)

Title: TBA

Nov 2, 2018: Moshe Cohen (Vassar College)

Title: TBA

Nov 14, 2018: Mingxian Zhong (Lehman College)

Title: TBA

Nov 30, 2018: Kira Adaricheva (Hofstra University)

Title: TBA

Dec 7, 2018: Eric Rowland (Hofstra University)

Title: TBA


Previous Co-Organizers

Christopher Hanusa (Spring 2011 - Spring 2015)

Previous Speakers

Spring and Summer 2018
Fall 2017
Spring 2017
Fall 2016
Spring 2016
Fall 2015
Spring 2015
Fall 2014
Spring 2014
Fall 2013
Spring 2013
Fall 2012
Spring 2012
Fall 2011
Spring 2011
Previous Talks hosted by Janos Pach