Combinatorics seminar
Combinatorics Seminar  Fall 2018
When: Tuesday 1pm2pm.
Where: Goldsmith 300.
Organizers: Olivier Bernardi and Duncan Levear
The Combinatorics Seminar is an introductory seminar for combinatorics. The talk should be accesible to first year graduate students.

September 18
Speaker: Ira Gessel (Brandeis)
Title: Good Will Hunting’s Problem: Counting Homeomorphically Irreducible Trees
Abstract:
In the movie Good Will Hunting, Professor Lambeau says, "My colleagues and I have conferred, and there is a problem on the board right now that took us more than two years to prove. Let this be said: the gauntlet has been thrown down. But the faculty have answered, and answered with vigor.”
The problem that “took them two years to prove” is to draw all (unlabeled) homeomorphically irreducible trees with 10 vertices. (A homeomorphically irreducible tree is one with no vertices of degree 2.) In fact, this problem would be reasonable as a homework problem for an undergraduate combinatorics class. Much more interesting is the problem of counting homeomorphically trees with n vertices for all n, which was solved by Harary and Prins in 1959. I will describe the solution to this problem, which involves some interesting ideas of enumerative combinatorics.
This talk should be comprehensible to a general mathematical audience.

October 2
Speaker: Sanjay Ramassamy (Ecole Normale Superieur de Paris)
Title: Extensions of partial cyclic orders, boustrophedons and polytopes
Abstract:
While the enumeration of linear extensions of a given poset is a
wellstudied question, its cyclic counterpart (enumerating extensions to
total cyclic orders of a given partial cyclic order) has been subject to
very little investigation. In this talk I will introduce some classes of
partial cyclic orders for which this enumeration problem is tractable.
Some cases require the use of a multidimensional version of the
classical boustrophedon construction (a.k.a SeidelEntringerArnold
triangle). The integers arising from these enumerative questions also
appear as the normalized volumes of certain polytopes.
This is partly joint work with Arvind Ayyer (Indian Institute of
Science) and Matthieu JosuatVergès (Laboratoire d'Informatique Gaspard
Monge / CNRS).

October 9
Speaker: Hongfu Liu (Brandeis)
Title:From Consensus Clustering to Kmeans Clustering
Abstract:
Consensus clustering aims to find a single partition which agrees as much as possible with existing basic partitions, which emerges as a promising solution to find cluster structures from heterogeneous data. It has been widely recognized that consensus clustering is effective to generate robust clustering results, detect bizarre clusters, handle noise, outliers and sample variations, and integrate solutions from multiple distributed sources of data or attributes. Different from the traditional clustering methods, which directly conducts the data matrix, the input of consensus clustering is the set of various diverse basic partitions. Therefore, consensus clustering is a fusion problem in essence, rather than a traditional clustering problem. In this talk, I will introduce the category of consensus clustering, illustrate the Kmeansbased Consensus Clustering (KCC), which exactly transforms the consensus clustering problem into a (weighted) Kmeans clustering problem with theoretical supports, talk about some key impact factors of consensus clustering, extend KCC to Fuzzy Cmeans Consensus Clustering. Moreover, this talk also includes how to employ consensus clustering for heterogeneous, multiview, incomplete and big data clustering. Derived from consensus clustering, a partition level constraint is proposed as the new side information for semisupervised clustering. Along this line, several interesting application based on the partition level constraint, such as feature selection, domain adaptation, gene stratification are involved to demonstrate the extensibility of consensus clustering. Some codes are available for practical use.

October 16
Speaker: Alejandro Morales (UMass Amherst)
Title: Analogues of factorization problems of permutations in other groups
Abstract:
The study of factorizations in the symmetric group is related to important objects in combinatorics including graphs embedded on surfaces (maps), noncrossing partitions, and symmetric functions. We consider analogues in the finite general linear group and some complex reflections groups of certain factorization problems of permutations first studied by Jackson, Goupil, Schaeffer, Vassilieva and Bernardi. Instead of counting factorizations of a long cycle given the number of cycles of each factor we count factorizations of regular elliptic elements and Coxeter elements given the fixed space dimension of each factor. We show with a characterbased approach that, as with permutations, the generating function counting these factorizations has nice coefficients after an appropriate change of basis.
This is joint work with Joel Lewis.

October 23
Speaker: John Wilmes (Brandeis)
Title: Automorphisms of primitive coherent configurations
Abstract:
Coherent configurations are highly regular colorings of complete digraphs. In joint work with Xiaorui Sun, we address the problem of classifying those "primitive" coherent configurations (PCCs) with the largest automorphism groups. We show that only the Johnson and Hamming schemes have more than exp(\tilde{O}(n^{1/3})) automorphisms (where n is the number of vertices and the tilde hides polylogarithmic factors). As a corollary, we give an elementary proof of a classification of primitive permutation groups of degree n and order greater than exp(\tilde{O}(n^{1/3})); this corollary was previously known only through the classification of finite simple groups. A crucial element of our proof is the discovery of asymptotically uniform clique geometries in PCCs.

October 30
Speaker: Tamas Kalman (Tokyo Institute of Technology)
Title: Ribbon structures and dissections of root polytopes
Abstract: The product of two simplices can be triangulated using `noncrossing trees.' I will (explain and) generalize this fact: the root polytope of an arbitrary bipartite graph has a dissection by a simple class of spanning trees derived from a ribbon structure. Moreover, the dissection comes with a natural shelling order. If time permits, I will explain how this can be used to give new definitions to a certain polynomial invariant of hypergraphs, in a way analogous to how Bernardi reformulated the Tutte polynomial. This is joint work with Lilla T\'othm\'er\'esz.

November 6
Speaker: Eric Hanson (Brandeis)
Title: TBD
Abstract:
TBD

November 13
Speaker: Jiaje Zheng (Brandeis)
Title: TBD
Abstract:
TBD

November 20
Speaker: Duncan Levear (Brandeis)
Title: TBD
Abstract:
TBD

November 27
Speaker: Olivier Bernardi (Brandeis)
Title: TBD
Abstract:
TBD

December 4
Speaker: Konstantin Matveev (Brandeis)
Title: TBD
Abstract:
TBD

December 11
Speaker: Melissa ShermannBennett (Harvard)
Title: TBD
Abstract:
TBD
Here are some indications for reaching Brandeis, and the math department.
Previous semesters:
Spring 2018,
Fall 2017,
Spring 2017,
Fall 2016,
Spring 2016,
Fall 2015,
Spring 2015,
Fall 2014,
Spring 2014,
Fall 2013.