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:20260422T215104Z
UID:CUNY_Combo/1
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CUNY_Combo/1
 /"> A variant of the Erdös-Rényi random graph process</a>\nby Pawel Pral
 at (Ryerson University) as part of New York combinatorics seminar\n\nLectu
 re held in 4422\, CUNY Graduate Center.\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/CUNY_Combo/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Pawel Pralat (Ryerson University)
DTSTART:20200417T154500Z
DTEND:20200417T164500Z
DTSTAMP:20260422T215104Z
UID:CUNY_Combo/2
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CUNY_Combo/2
 /">A variant of the Erdös-Rényi random graph process</a>\nby Pawel Prala
 t (Ryerson University) as part of New York combinatorics seminar\n\nLectur
 e held in 4422\, CUNY Graduate Center.\n\nAbstract\nWe consider a natural 
 variant of the Erdös-Rényi inspired by the combinatorial data fusion pro
 blem that itself is connected to a number of important problems in graph t
 heory. We will show that a phase transition occurs when the number of spec
 ial vertices is roughly $n^{1/3}$\, where $n$ is the number of vertices. T
 his is joint work with Adam Logan and Mike Molloy\n
LOCATION:https://researchseminars.org/talk/CUNY_Combo/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Laura Silverstein (Brooklyn College\, CUNY)
DTSTART:20200424T154500Z
DTEND:20200424T164500Z
DTSTAMP:20260422T215104Z
UID:CUNY_Combo/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CUNY_Combo/3
 /">Ehrhart tensor polynomials</a>\nby Laura Silverstein (Brooklyn College\
 , CUNY) as part of New York combinatorics seminar\n\nLecture held in 4422\
 , CUNY Graduate Center.\n\nAbstract\nAn extension of the Ehrhart polynomia
 l to tensor valuations on lattice polytopes is introduced. In particular\,
  we initiate the study of the Ehrhart tensor polynomial\, its coefficients
 \, and its coefficients in a certain binomial basis - an extension of the 
 $h^*$-polynomial. We will concentrate on the matrix case providing compari
 sons to classical Ehrhart theory. The reciprocity results of Ehrhart and M
 acDonald are extended\, a Pick-type theorem is given\, as is a result anal
 agous to Stanley's nonnegativity. This is joint work with Monika Ludwig (T
 U Wien) and\, separately\, with Soren Berg (Fit Analytics) and Katharina J
 ochemko (KTH Stockholm).\n
LOCATION:https://researchseminars.org/talk/CUNY_Combo/3/
END:VEVENT
BEGIN:VEVENT
SUMMARY:J. B. Nation (University of Hawaii)
DTSTART:20200515T154500Z
DTEND:20200515T164500Z
DTSTAMP:20260422T215104Z
UID:CUNY_Combo/4
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CUNY_Combo/4
 /">A simple semidistributive lattice</a>\nby J. B. Nation (University of H
 awaii) as part of New York combinatorics seminar\n\nLecture held in 4422\,
  CUNY Graduate Center.\n\nAbstract\nThere is no finite simple semidistribu
 tive lattice. Is there an infinite one? The answer is yes\, and the talk w
 ill focus on why you might care (the role of semidistributivity in lattice
 s). This is joint work with Ralph Freese.\n
LOCATION:https://researchseminars.org/talk/CUNY_Combo/4/
END:VEVENT
END:VCALENDAR