Founded 2003 by Drew Sills and Doron Zeilberger.
Former co-organizers: Drew Sills (2003-2007), Moa ApaGodu (2005-2006), Lara Pudwell (2006-2008), Andrew Baxter (2008-2011), Brian Nakamura (2011-2013), Edinah Gnang (2011-2013), Matthew Russell (2013-2016), Nathan Fox (2016-2017), Bryan Ek (2017-2018), Mingjia Yang (2018-2020), Yonah Biers-Ariel (2018-2020), Robert Dougherty-Bliss (2020-2024), Stoyan Dimitrov (2023-2025)
Current co-organizers:
Doron Zeilberger (doronzeil {at} gmail [dot] com)
Aurora Hiveley (aurora.hiveley {at} scarletmail [dot] rutgers [dot] edu)
Lucy Martinez (lm1154 {at} scarletmail [dot] rutgers [dot] edu)
Archive of Previous Speakers and Talks You can find links to videos of some of these talks as well. Currently, our videos are being posted to our Vimeo page. Previously, we had videos posted on our YouTube page.
Date: Thu., April 9, 2026, 5:00pm (Eastern Time)
Zoom Link [password: The 20th Catalan number, alias (40)!/(20!*21!), alias 6564120420 ]
Speaker: Eugene Zima, Wilfrid Laurier University and SCG (UWaterloo)
Title: Sparse and scalable Residue Number Systems from polynomial point of view
Abstract: Residue number systems (RNS) based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study families of sparse moduli exhibiting scalable modular inverses that enable the acceleration of all aspects of modular arithmetic: conversion to RNS, intra-RNS operations, and reconstruction from modular images.
Our unified approach is to represent moduli as the evaluations of sparse polynomials at powers of 2. Two moduli can be checked for scalability by evaluating a single polynomial resultant. If the polynomials are suitable, one can generate sets of moduli of arbitrary length with closed-form modular inverses. We also discuss different strategies to evaluate scalable moduli to further eliminate RNS overhead.
We show that this approach is universal by using it to test well-known sets of moduli for scalability.
This is joint work with Robert Dougherty-Bliss and Natalya Ter-Saakov.
Date: Thu., April 16, 2026, 5:00pm (Eastern Time)
Zoom Link [password: The 20th Catalan number, alias (40)!/(20!*21!), alias 6564120420 ]
Speaker: Jay Pantone,Marquette University
Title: Computational and Experimental Methods in Permutation Patterns
Abstract: For most of its existence, a hallmark of permutation patterns research has been the use of computers. Our research is regularly made possible by the ability to write a simple script to generate permutations with some certain property, helping us to discover an interesting theorem; or to open up Sage, or Maple, or Mathematica and perform some large generating function calculation; or to use one of the several existing large permutation patterns software libraries to test some intriguing conjectures.
The quest to understand permutation classes has led to the import of computational methods from other areas into the field of permutation patterns, as well as the development of a number of new techniques. Some of these methods produce rigorous results, assuming the correctness of the software implementation. Others are experimental in the sense that their output should be considered conjectural. The popularity of permutation patterns has even led to some of these computational techniques making the jump to other areas of combinatorics. This talk will survey a collection of these methods, including some developed by myself and my collaborators.
Date: Thu., April 23, 2026, 5:00pm (Eastern Time)
Zoom Link [password: The 20th Catalan number, alias (40)!/(20!*21!), alias 6564120420 ]
Speaker:
Alex Kontorovich, Rutgers University
Title: Use of Computers in Mathematical Research
Abstract: We'll discuss new uses of technology, including Lean and AI, to aid the research mathematician
Date: Thu., April 30, 2026, 5:00pm (Eastern Time)
Zoom Link [password: The 20th Catalan number, alias (40)!/(20!*21!), alias 6564120420 ]
Speaker: Paul Levrie, KU Leuven, Belgium
Title: On the mathematical legacy of Guillera
Abstract: In this seminar, we will provide a brief introduction to the early history of series with sums of 1/π and 1/π2, we meet Ramanujan, and discuss the role played by the recently deceased Jesus Guillera in this story. We derive closed-form expressions for values of generalized hypergeometric functions that elegantly combine Ramanujan's series and Guillera's series, as well as others that combine Guillera's series with the series with sum 1/π4. For this we use Zeilberger's algorithm. A side result of the method used is a new (?) series for the constant G/π3, that Jesus Guillera probably would have liked, G being Catalan's constant.
[Joint work with John Campbell]
Date: Thu., May 7, 2026, 5:00pm (Eastern Time)
Zoom Link [password: The 20th Catalan number, alias (40)!/(20!*21!), alias 6564120420 ]
Speaker: Sergei Suslov, Arizona State University
Title: One century of the wave mechanics discovery by Louis de Broglie, Werner Heisenberg, Erwin Schrodinger, and Paul A.M. Dirac
Abstract: Historical development of major ideas of quantum physics - the so-called two quantum revolutions (1924-28) - will be outlined from a modern mathematical perspective. Connection of old quantum mechanics by Bohr and Sommerfeld with transuranium elements will be presented.
[See also this interesting article]