BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Neil Sloane (OEIS Foundation)
DTSTART:20200910T210000Z
DTEND:20200910T215000Z
DTSTAMP:20260404T110644Z
UID:ExpMath/1
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/ExpMa
 th/1/">Conant's Gasket\, Recaman Variations\, the Enots Wolley Sequence\, 
 and Stained Glass Windows</a>\nby Neil Sloane (OEIS Foundation) as part of
  Experimental Mathematics Seminar\n\n\nAbstract\nA half-dozen lovely new s
 equences from the On-Line Encyclopedia of Integer Sequences\, with brillia
 nt illustrations and many open problems.\n
LOCATION:https://stable.researchseminars.org/talk/ExpMath/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Manuel Kauers (Johannes Kepler University\, Linz)
DTSTART:20200917T210000Z
DTEND:20200917T215000Z
DTSTAMP:20260404T110644Z
UID:ExpMath/2
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/ExpMa
 th/2/">Making Many More Matrix Multiplication Methods</a>\nby Manuel Kauer
 s (Johannes Kepler University\, Linz) as part of Experimental Mathematics 
 Seminar\n\n\nAbstract\nIt is known since the 1970s that no more than 23 mu
 ltiplications are required for computing the product of two 3 3-matrices. 
 It is not known whether this can also be done with fewer multiplications. 
 However\, there are several mutually inequivalent ways of doing the job wi
 th 23 multiplications. We extend this list considerably by providing more 
 than 13 000 new and mutually inequivalent schemes for multiplying 3 3-matr
 ices using 23 multiplications. This is joint work with Marijn Heule and Ma
 rtina Seidl.\n
LOCATION:https://stable.researchseminars.org/talk/ExpMath/2/
END:VEVENT
END:VCALENDAR