Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Friday, January 21, 2022 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium - Manuel Kauers

Title: Guessing with little data

Speaker: Manuel Kauers
Affiliation: Johannes Kepler University
Zoom: Please email Emma Watson

Abstract:

A popular and powerful technique in experimental mathematics takes as input the first few terms of an infinite sequence and returns plausible candidates for recurrence equations that the sequence may satisfy. In a way, the search for such candidates is a generalization of polynomial interpolation. For polynomial interpolation, it is well known and easy to see that d+1 sample points are needed in order to recover a polynomial of degree d. Similarly, it turns out that (r+1)*(d+2) consecutive terms of a sequence are needed in order to detect a linear recurrence of order r with polynomial coefficients of degree at most d.

Monday, January 24, 2022 11:30 am - 11:30 am EST (GMT -05:00)

Algebraic Graph Theory Seminar - Erika Pirnes

Title: Minimal relations for an algebra inspired by algebraic graph theory

Speaker: Erika Pirnes
Affiliation: University of Wisconsin-Madison
Zoom: Contact Sabrina Lato

Abstract:

The balanced algebra has two generators, R and L, and its defining relations are that any pair of balanced words commutes. For example, RL and LR are balanced (contain the same number of both generators), so in the balanced algebra, (RL)(LR)=(LR)(RL).

Tuesday, January 25, 2022 3:00 pm - 3:00 pm EST (GMT -05:00)

Graphs and Matroids Seminar - Archontia Giannopoulou

Title: A Matching Theoretic Flat Wall Theorem

Speaker: Archontia Giannopoulou
Affiliation: University of Athens
Zoom: http://matroidunion.org/?page_id=2477 or please email Shayla Redlin

Abstract:

One of the key theorems in Graph Minors is the Flat Wall Theorem which asserts the existence of a large wall under certain conditions. In this talk, we discuss about graphs with perfect matchings and their relationship with digraphs. Our main focus is on a matching theoretic analogue of the Flat Wall Theorem for bipartite graphs excluding a fixed matching minor.

Thursday, January 27, 2022 11:30 am - 11:30 am EST (GMT -05:00)

Cryptography Reading Group - Pravek Sharma

Title: Random Self-reducibility of Ideal-SVP via Arakelov Random Walks

Speaker: Pravek Sharma
Affiliation: University of Waterloo
Zoom: Please email Jesse Elliott

Abstract:

Fixing a number field, the space of all ideal lattices, up to isometry, is naturally an Abelian group, called the *Arakelov class group*. This fact, well known to number theorists, has so far not been explicitly used in the literature on lattice-based cryptography. Remarkably, the Arakelov class group is a combination of two groups that have already led to significant cryptanalytic advances: the class group and the unit torus.

Thursday, January 27, 2022 1:00 pm - 1:00 pm EST (GMT -05:00)

Algebraic Combinatorics Seminar - Sean Griffin

Title: Springer fibers and the Delta Conjecture at t=0

Speaker: Sean Griffin
Affiliation: UC Davis
Zoom: Please email Olya Mandelshtam

Abstract:

Springer fibers are a family of varieties that have remarkable connections to combinatorics and representation theory. Springer used them to geometrically construct all of the irreducible representations of the symmetric group (Specht modules). Moreover, they give a geometric meaning to Hall-Littlewood symmetric functions.

Friday, January 28, 2022 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium - Jens Vygen

Title: Traveling Salesman Problems: Approximation Algorithms and Black-Box Reductions

Speaker: Jens Vygen
Affiliation: University of Bonn
Zoom: Please email Emma Watson

Abstract:

We survey the recent progress on approximation algorithms and integrality ratios for variants of the traveling salesman problem, with a focus on black-box reductions from one problem to another. In particular, we explain recent results for the Path TSP and the Capacitated Vehicle Routing Problem, which are joint works with Vera Traub and Rico Zenklusen and with Jannis Blauth and Vera Traub.

Monday, January 31, 2022 11:30 am - 11:30 am EST (GMT -05:00)

Algebraic Graph Theory Seminar - Steve Butler

Title: Hadamard diagonalizable graphs of small order

Speaker: Steve Butler
Affiliation: Iowa State University
Zoom: Contact Sabrina Lato

Abstract:

A graph whose Laplacian matrix has a full set of eigenvectors with entries in {1,-1} is said to be Hadamard diagonalizable (i.e. there exists a Hadamard matrix which diagonalizes the Laplacian matrix). We demonstrate that the only diagonalizable graphs on n=8k+4 vertices are K_n and K_{n/2,n/2}.

Tuesday, February 1, 2022 3:00 pm - 3:00 pm EST (GMT -05:00)

Graphs and Matroids Seminar - Matthew Coulson

Title: Strong components of the directed configuration model

Speaker: Matthew Coulson
Affiliation: University of Waterloo
Zoom: http://matroidunion.org/?page_id=2477 or please email Shayla Redlin

Abstract:

We study the behaviour of the largest components of the directed configuration model in the barely subcritical regime. We show that with high probability all strongly connected components in this regime are either cycles or isolated vertices and give an asymptotic distribution of the size of the kth largest cycle. This gives a configuration model analogue of a result of Luczak and Seierstad for the binomial random digraph.

Thursday, February 3, 2022 1:00 pm - 1:00 pm EST (GMT -05:00)

Algebraic Combinatorics Seminar - Colin Defant

Title: Semidistrim Lattices

Speaker: Colin Defant
Affiliation: Princeton University
Zoom: Please email Olya Mandelshtam

Abstract:

This talk will introduce semidistrim lattices, which generalize semidistributive lattices and trim lattices; these two families, in turn, generalize distributive lattices. We will discuss structural, topological, and dynamical properties of semidistrim lattices. In particular, we will see how one can define a certain bijective operator on a semidistrim lattice called rowmotion; this definition unifies the definition that Barnard gave for semidistributive lattices and the definition that Thomas and Williams gave for trim lattices.

Friday, February 4, 2022 3:30 pm - 3:30 pm EST (GMT -05:00)

Tutte Colloquium - David Jao

Title: The Problem Landscape of SIDH

Speaker: David Jao
Affiliation: University of Waterloo
Zoom: Please email Emma Watson

Abstract:

The Supersingular Isogeny Diffie-Hellman protocol (SIDH) has recently been the subject of increased attention in the cryptography community. Conjecturally quantum-resistant, SIDH has the feature that it shares the same data flow as ordinary Diffie-Hellman: two parties exchange a pair of public keys, each generated from a private key, and combine them to form a shared secret.