The Combinatorics Seminar [Department of Mathematics and Statistics, Binghamton University]

This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong.
====== The Combinatorics Seminar ======

===== FALL 2008 =====

[[http://www.anybrowser.org/campaign/|Best Viewed With Any Browser]]

[[http://www.math.binghamton.edu/dept/directions.html|Directions to the department.]]

Organizers: [[delucchi/|Emanuele Delucchi]], and [[zaslav/|Thomas Zaslavsky]].

The usual day, time, and place are:

**Tuesdays, 1:15 - 2:15**, in

Room **LN-2205**,

with coffee, tea, and cookies at 3:45 in the Anderson Room, LN-2207.

Some meetings will be at other times, e.g., when joint with other seminars.


----

This semester we will have several talks on **non-crossing partitions**. Here is the link to a [[nc-partitions-bibliography.2008.html|short bibliography]], including papers that will be presented. Here are links to a [[nc-partitions.mr1.pdf|first list]] and [[nc-partitions.mr2.pdf|second list]] of relevant papers with reviews (there is overlap with the short bibliography).

<HTML><ul></HTML>
<HTML><li></HTML>**Tuesday, September 2**\\
Organizational Meeting (all should come)\\
+ chat with\\
//Speaker//: Thomas Zaslavsky (Binghamton)\\
//Title//: [[abstract.200809zas|Fun at Summer Conferences]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, September 9**\\
//Speaker//: Emanuele Delucchi (Binghamton)\\
//Title//: [[abstract.200809del|Finite Reflection Groups, Non-Crossing Partitions, and a Theorem of Deligne]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, September 16**\\
//Speaker//: Thomas Zaslavsky (Binghamton)\\
//Title//: [[abstract.200809zasa|Quasigroups via Graphs]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, September 23**\\
//Speaker//: Ed Swartz (Cornell)\\
//Title//: [[abstract.200809swa|Three Complexes]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, September 30**\\
Holiday; no meeting.<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, October 7**\\
//Speaker//: Thomas Zaslavsky (Binghamton)\\
//Title//: [[abstract.200810zas|Tutte Functions of Matroids]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, October 14**\\
//Speaker//: Garry Bowlin (Binghamton)\\
//Title//: [[abstract.200810bow|Non-Crossing Partitions, I]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, October 21**\\
//Speaker//: Garry Bowlin (Binghamton)\\
//Title//: [[abstract.200810bow|Non-Crossing Partitions, II]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Wednesday, October 29 (Special day)**\\
//Speaker//: Laura Anderson (Binghamton)\\
//Title//: [[abstract.200810and|Representation of Matroids by Homotopy Spheres]]\\
//Time//: 2:20 - 3:20 **(Special time)**\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, November 4**\\
//No meeting today – Election day.//<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, November 11**\\
//Speaker//: Nate Reff (Binghamton)\\
//Title//: [[abstract.200811ref|The Lattice of Non-Crossing Partitions]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Thursday, November 13 ([[../colloquia/|Colloquium]])**\\
//Speaker//: Joanna Ellis-Monaghan (St. Michael's College)\\
//Title//: [[abstract.200811ellc|The Tutte Polynomial and Potts Model in Statistical Mechanics]]\\
//Time//: 4:30 - 5:30\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Friday, November 14 (Special day)**\\
//Speaker//: Joanna Ellis-Monaghan (St. Michael's College)\\
//Title//: [[abstract.200811ells|Multivariable Tutte and Transition Polynomials]]\\
//Time//: 2:20 - 3:20 **(Special time)**\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, November 18**\\
//Speaker//: Jackie Kaminski (Binghamton)\\
//Title//: [[abstract.200811kam|Regular Non-Crossing Partitions]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML>**Tuesday, November 25 (joint with the [[../AlgebraSem/index.html|Algebra Seminar]])**\\
//Speaker//: Thomas Zaslavsky (Binghamton)\\
//Title//: [[abstract.200811zas|Graphic Matrices Over a Group]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></li></HTML>
<HTML><li></HTML><HTML><p></HTML>**Tuesday, December 2 (joint with the [[../AlgebraSem/index.html|Algebra Seminar]])**\\
//Speaker//: Simon Joyce (Binghamton)\\
//Title//: [[abstract.200812joy|The Symmetric Group and Non-Crossing Partitions]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></p></HTML>
<HTML><p></HTML>I will define a poset relation on the symmetric group S<sub>n</sub>, which gives a natural order-preserving function from S<sub>n</sub> to the lattice of partitions. If we restrict our attention to elements in S<sub>n</sub> under a particular n-cycle, we have a lattice which is isomorphic to the lattice of non-crossing partitions. If time permits I'll talk about some of the implications. This work is based on a paper by Thomas Brady.<HTML></p></HTML><HTML></li></HTML>
<HTML><li></HTML><HTML><p></HTML>**Tuesday, December 9**\\
//Speaker//: Lucas Rusnak (Binghamton)\\
//Title//: [[abstract.200812rus|A Multidirected Hypergraph Representation of Matrices with 0, 1, −1 Entries, Part I]]\\
//Time//: 1:15 - 2:15\\
//Room//: LN-2205<HTML></p></HTML>
<HTML><p></HTML>A multi-directed hypergraph is a combinatorial representation of {0, +1, −1}-matrices that extends the concepts of signed graphs to hypergraphic analogs. I will discuss their discovery and development from hypergraphic matrices and the problems in extending the signed-graphic treatment of the classification of column dependencies.<HTML></p></HTML><HTML></li></HTML>
<HTML><li></HTML><HTML><p></HTML>**Tuesday, December 16**\\
//Speaker//: Lucas Rusnak (Binghamton)\\
//Title//: [[abstract.200812rus|A Multidirected Hypergraph Representation of Matrices with 0, 1, −1 Entries, Part II]]\\
//Time//: 2:50 - 3:50 **(Special time)**\\
//Room//: SW-231 **(Special room)**<HTML></p></HTML>
<HTML><p></HTML>A multi-directed hypergraph is a combinatorial representation of {0, +1, −1}-matrices that extends the concepts of signed graphs to hypergraphic analogs. I will discuss their discovery and development from hypergraphic matrices and the problems in extending the signed-graphic treatment of the classification of column dependencies.<HTML></p></HTML><HTML></li></HTML><HTML></ul></HTML>


----

Past Semesters: [[s08|Spring 2008]] | [[f07|Fall 2007]] | [[s07|Spring 2007]] | [[f06|Fall 2006]] | [[s06|Spring 2006]] | [[f05|Fall 2005]] | [[s05|Spring 2005]] | [[f04|Fall 2004]] | [[s04|Spring 2004]] | [[f03|Fall 2003]] | [[s03|Spring 2003]] | [[f02|Fall 2002]] | [[s02|Spring 2002]] | [[f01|Fall 2001]] | [[s01|Spring 2001]] | [[f00|Fall 2000]] | [[s00|Spring 2000]] | [[f99|Fall 1999]] | [[s99|Spring 1999]] | [[f98|Fall 1998]]


----

[[http://www.math.binghamton.edu/|Departmental home page]].


----