BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20241210T170000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:8027f3fa67edc8309b8391d7cabb097b
CATEGORIES:Experimental Mathematics Seminar
CREATED:20251105T103453
SUMMARY: Guessing with little data
LOCATION:https://rutgers.zoom.us/j/95103383827    password: 6564120420
DESCRIPTION:<p>Automated guessing is a very popular tool in experimental mathematics. G
 iven the first few terms of an infinite sequence, it tries to find a recurr
 ence that the sequence is in some way likely to satisfy. If the sequence un
 der consideration indeed satisfies a recurrence and a sufficient number of 
 initial terms is supplied as input, then the method is bound to find the co
 rrect answer. But sufficiently many initial terms are not always available.
  Together with Christoph Koutschan, we have proposed a variant of the class
 ical method that needs fewer terms and catches some of these cases. We will
  explain the idea behind this variant and present some conjectures that hav
 e been found with the method.</p>
CONTACT: Manuel Kauers,  Johannes  Kepler University,  Linz,  Austria
DTSTAMP:20260826T002624
DTSTART;TZID=America/New_York:20251211T170000
DTEND;TZID=America/New_York:20251211T180000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR