ICE-TCS Lectures Series - Sergey Kitaev - Enumeration of (2+2) - free posets by the number of minimal elements and other statistics
The next ICE-TCS talk will be delivered on Friday, 16 October, by Sergey Kitaev (Reykjavik University). The talk, entitled Enumeration of (2+2)-free posets by the number of minimal elements and other statistics, will be held in room K5 at Reykjavík University (Kringlan 1) from 14:00 till 15:00.
Further information about forthcoming ICE- TCS events may be found on the ICE-TCS news page
Abstract
A poset is (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. In a recent paper, Bousquet-Melou et al. found,using so called ascent sequences, the generating function for the number of (2+2)-free posets. We extend this result by finding a multi-variable generating function for (2+2)-free posets when four statistics are taken into account, one of which is the number of minimal elements in a poset.
This is joint work with Jeff Remmel.
