BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Pawel Pralat (Ryerson University)
DTSTART:20200410T154500Z
DTEND:20200410T164500Z
DTSTAMP:20260404T094555Z
UID:CUNY_Combo/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CUNY_
 Combo/1/"> A variant of the Erdös-Rényi random graph process</a>\nby Paw
 el Pralat (Ryerson University) as part of New York combinatorics seminar\n
 \nLecture held in 4422\, CUNY Graduate Center.\nAbstract: TBA\n
LOCATION:https://stable.researchseminars.org/talk/CUNY_Combo/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pawel Pralat (Ryerson University)
DTSTART:20200417T154500Z
DTEND:20200417T164500Z
DTSTAMP:20260404T094555Z
UID:CUNY_Combo/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CUNY_
 Combo/2/">A variant of the Erdös-Rényi random graph process</a>\nby Pawe
 l Pralat (Ryerson University) as part of New York combinatorics seminar\n\
 nLecture held in 4422\, CUNY Graduate Center.\n\nAbstract\nWe consider a n
 atural variant of the Erdös-Rényi inspired by the combinatorial data fus
 ion problem that itself is connected to a number of important problems in 
 graph theory. We will show that a phase transition occurs when the number 
 of special vertices is roughly $n^{1/3}$\, where $n$ is the number of vert
 ices. This is joint work with Adam Logan and Mike Molloy\n
LOCATION:https://stable.researchseminars.org/talk/CUNY_Combo/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Laura Silverstein (Brooklyn College\, CUNY)
DTSTART:20200424T154500Z
DTEND:20200424T164500Z
DTSTAMP:20260404T094555Z
UID:CUNY_Combo/3
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CUNY_
 Combo/3/">Ehrhart tensor polynomials</a>\nby Laura Silverstein (Brooklyn C
 ollege\, CUNY) as part of New York combinatorics seminar\n\nLecture held i
 n 4422\, CUNY Graduate Center.\n\nAbstract\nAn extension of the Ehrhart po
 lynomial to tensor valuations on lattice polytopes is introduced. In parti
 cular\, we initiate the study of the Ehrhart tensor polynomial\, its coeff
 icients\, and its coefficients in a certain binomial basis - an extension 
 of the $h^*$-polynomial. We will concentrate on the matrix case providing 
 comparisons to classical Ehrhart theory. The reciprocity results of Ehrhar
 t and MacDonald are extended\, a Pick-type theorem is given\, as is a resu
 lt analagous to Stanley's nonnegativity. This is joint work with Monika Lu
 dwig (TU Wien) and\, separately\, with Soren Berg (Fit Analytics) and Kath
 arina Jochemko (KTH Stockholm).\n
LOCATION:https://stable.researchseminars.org/talk/CUNY_Combo/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:J. B. Nation (University of Hawaii)
DTSTART:20200515T154500Z
DTEND:20200515T164500Z
DTSTAMP:20260404T094555Z
UID:CUNY_Combo/4
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CUNY_
 Combo/4/">A simple semidistributive lattice</a>\nby J. B. Nation (Universi
 ty of Hawaii) as part of New York combinatorics seminar\n\nLecture held in
  4422\, CUNY Graduate Center.\n\nAbstract\nThere is no finite simple semid
 istributive lattice. Is there an infinite one? The answer is yes\, and the
  talk will focus on why you might care (the role of semidistributivity in 
 lattices). This is joint work with Ralph Freese.\n
LOCATION:https://stable.researchseminars.org/talk/CUNY_Combo/4/
END:VEVENT
END:VCALENDAR