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)
Current co-organizers:
Doron Zeilberger (doronzeil {at} gmail [dot] com)
Robert Dougherty-Bliss (robert {dot} w {dot} bliss {at} gmail [dot] com)
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: Sept. 29, 2022, 5:00pm (Eastern Time)
Zoom Link [password: The 20th Catalan number, alias (40)!/(20!*21!), alias 6564120420 ]
Speaker:
Alexey Ovchinnikov, CUNY and Queen College
Title: Parameter estimation in discrete-time systems
Abstract:The parameter identifiability problem for a dynamical system is to determine whether the parameters of the system can be found from a given subset of variables of the system. Verifying whether the parameters are indentifiable is a necessary first step before trying to estimate the values of the parameters. We will discuss these problems in the context of discrete-time systems with exponential functions.
Title: Sorting probability for Young diagrams
Abstract: Can you always find two elements x,y of a partially ordered set, such that, the probability that x is ordered before y when the poset is ordered randomly, is between 1/3 and 2/3? This is the celebrated 1/3-2/3 Conjecture, which has been called "one of the most intriguing problems in the combinatorial theory of posets". We will explore this conjecture for posets that arise from (skew-shaped) Young diagrams, where total orderings of these posets correspond to standard Young tableaux. We will show that these probabilities are arbitrarily close to 1/2, by using random walk estimates and the state-of-the-art hook-length formulas of Naruse. This is a joint work with Igor Pak and Greta Panova. This talk is aimed at a general audience.
Title: Enumerative combinatorics and coding theory
Subtitle: Eliahou Theory and application to enumerating Legendre Pairs
Abstract: In his seminal 1994 paper entitled "Enumerative combinatorics and coding theory", Shalom Eliahou proposes a theory/method to enumerate the values of a polynomial in n variables with non-negative integer coefficients, assumed on {-1,+1}^n. The method builds an associated binary linear code whose enumeration of certain weight suffices to answer the question. We shall present Eliahou's theory, as well as its application to the problem of enumerating Legendre pairs. For background in Legendre pairs, please consult the ICECA 2022 talk .
Title: The Arithmetic-Periodicity of the game CUT
Abstract: tbd
Title: tbd
Abstract: tbd
Title: tbd
Abstract: tbd
Title: tbd
Abstract: tbd