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:20201101T010000
RDATE:20210314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20211107T010000
RDATE:20220313T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20221106T010000
RDATE:20230312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20231105T010000
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
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:20201027T170000
RDATE:20201101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20210314T030000
RDATE:20211107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20220313T030000
RDATE:20221106T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20230312T030000
RDATE:20231105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
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:ea78703eb9919c80219000610c318352
CATEGORIES:Experimental Mathematics Seminar
CREATED:20211007T113747
SUMMARY:Accelerating hypergeometric indefinite summation
LOCATION:Zoom 
DESCRIPTION:Abstract: One well-known longstanding problem with Gosperâ€™s algorithm is 
 that its running time depends at least linearly on the dispersion of the ra
 tional certificate of the summand, and this last can be exponentially large
  in the bit size of the summand. This makes summation problems for hypergeo
 metric terms with large dispersion values effectively intractable. We show 
 that for summable terms this dependency is not essential (can be removed). 
 The structure of polynomial solutions to the Gospe key equation is analyzed
 . A method for rapid extractionsof simple high-degree factors of the soluti
 on is given. Resulting modified Gosper's algorithm is presented. This resul
 t is based on very simple and well-known facts, properties, and lazy evalua
 tion rules of factorial polynomials. Experimental Maple implementation conf
 irms practical acceleration in computing of indefinite sums and rational no
 rmal forms of hypergeometric terms.\n
X-ALT-DESC;FMTTYPE=text/html:<p><em style="color: #000000; font-family: 'Times New Roman'; font-size: me
 dium; background-color: inherit;">Abstract</em>: One well-known longstandin
 g problem with Gosperâ€™s algorithm is that its running time depends at lea
 st linearly on the dispersion of the rational certificate of the summand, a
 nd this last can be exponentially large in the bit size of the summand. Thi
 s makes summation problems for hypergeometric terms with large dispersion v
 alues effectively intractable. We show that for summable terms this depende
 ncy is not essential (can be removed). The structure of polynomial solution
 s to the Gospe key equation is analyzed. A method for rapid extractionsof s
 imple high-degree factors of the solution is given. Resulting modified Gosp
 er's algorithm is presented. This result is based on very simple and well-k
 nown facts, properties, and lazy evaluation rules of factorial polynomials.
  Experimental Maple implementation confirms practical acceleration in compu
 ting of indefinite sums and rational normal forms of hypergeometric terms.<
 /p>
CONTACT:Eugene Zima, Wilfrid Laurier University
X-EXTRAINFO: Zoom Link https://rutgers.zoom.us/j/94346444480 [password: The 20th Catala
 n number, alias (40)!/(20!*21!), alias 6564120420 ]
DTSTAMP:20260828T185346
DTSTART;TZID=America/New_York:20211028T170000
DTEND;TZID=America/New_York:20211028T180000
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR