Ilias Kotsireas, Wilfrid Laurier University

Abstract

Subtitle: Eliahou Theory and application to enumerating Legendre Pairs
 

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 .

Link to video: https://vimeo.com/767030516

Presented Via Zoom: https://rutgers.zoom.us/j/94346444480

Password: 6564120420

For further information see: https://sites.math.rutgers.edu/~zeilberg/expmath/