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:
Thursday, June 23, 2022 11:30 am - 11:30 am EDT (GMT -04:00)

Cryptography Reading Group - Raghvendra Rohit

Title: On the Security of the NIST lightweight Finalist Ascon

Speaker: Raghvendra Rohit
Affiliation: Technology Institute in Abu Dhabi
Zoom: Please contact Jesse Elliott for zoom link

Abstract: 

The ongoing NIST lightweight cryptographic standardization project for the selection of ciphers which are suitable for constrained environments is in the final stage. The authenticated encryption algorithm Ascon, designed by Dobrauing et al., is one out of the 10 finalists. Ascon is also one of the winners of the CAESAR competition in the lightweight applications category.

Monday, June 27, 2022 11:30 am - 11:30 am EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Karen Meagher

Title: A Brief Introduction to World of Erd\H{o}s-Ko-Rado Theorems

Speaker: Karen Meagher
Affiliation: University of Regina
Zoom: Please contact Sabrina Lato for Zoom link

Abstract:   The Erd\H{o}s-Ko-Rado (EKR) theorem is a famous result that is one of the cornerstones of extremal set theory. This theorem answers the question "What is the largest family of intersecting sets, of a fixed size, from a base set?"

Thursday, June 30, 2022 1:00 pm - 1:00 pm EDT (GMT -04:00)

Seminar - Thomas McConville

Title: Determinantal formulas with major indices

Speaker: Thomas McConville
Affiliation: Kennesaw State
Room: MC 5483

Abstract: Krattenthaler and Thibon discovered a beautiful formula for the determinant of the matrix indexed by permutations whose entries are q^maj( u*v^{-1} ), where “maj” is the major index. Previous proofs of this identity have applied the theory of nonsymmetric functions or the representation theory of the Tits algebra to determine the eigenvalues of the matrix.

Monday, July 4, 2022 11:30 am - 11:30 am EDT (GMT -04:00)

Algebraic Graph Theory Seminar - Dheer Noal

Title: Spectral Turan Problems on trees and even cycles

Speaker: Dheer Noal
Affiliation: University of Delaware
Zoom: Please contact Sabrina Lato for Zoom link

Abstract:  In this talk, we discuss some recent progress with the spectral analogue of a few Turán problems: Instead of maximizing the number of edges, our objective is to maximize the spectral radius of the adjacency matrices of graphs not containing some subgraphs.

Tuesday, July 5, 2022 2:30 pm - 2:30 pm EDT (GMT -04:00)

Graph and Matroids Seminar - Sepehr Hajebi

Title: Bounded treewidth in hereditary graph classes

Speaker: Sepehr Hajebi
Affiliation: University of Waterloo
Location: MC 5417

Abstract: A highlight of the superb graph minors project of Robertson and Seymour is their so-called Grid Theorem: a minor-closed class of graphs has bounded treewidth if and only it does not contain all planar graphs. Which induced-subgraph-closed graph classes have bounded treewidth?

Thursday, July 7, 2022 1:00 pm - 1:00 pm EDT (GMT -04:00)

Algebraic Combinatorics Seminar - Emily Gunawan

Title: Box-ball systems, RSK, and Motzkin paths 

Speaker: Emily Gunawan
Affiliation: University of Oklahoma
Location: MC 5479, please contact Olya Mandelshtam for Zoom link.

Abstract:  A box-ball system (BBS) is a discrete dynamical system whose dynamics come from the balls jumping according to certain rules. A permutation on n objects gives a BBS state by assigning its one-line notation to n consecutive boxes. After a finite number of steps, a box-ball system will reach a steady state. From any steady state, we can construct a tableau called the soliton decomposition of the box-ball system.

Friday, July 8, 2022 1:00 pm - 1:00 pm EDT (GMT -04:00)

Combinatorial Optimization Reading Group - Ricardo Fukasawa POSTPONED

Title: Stochastic Optimization

Speaker: Ricardo Fukasawa
Affiliation: University of Waterloo
Location: MC 6029

Abstract: While deterministic optimization problems are very useful in practice, often times the assumption that all data is known in advance does not hold true. One possible way to relax this assumption is to assume that the data depends on random variables. This assumption leads to stochastic optimization problems.

Tuesday, July 12, 2022 2:30 pm - 2:30 pm EDT (GMT -04:00)

Graph and Matroids Seminar - Hidde Koert

Title: The k-independence number of graph products

Speaker: Hidde Koerts
Affiliation: University of Waterloo
Location: MC 5417

Abstract: The k-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than k, generalizing the standard independence number. In this talk, I will discuss well-known sharp bounds on the independence number of graph products, and extend some of these bounds to the k-independence number. Specifically, we will cover the Cartesian, tensor, strong, and lexicographic products.

Joint work with Aida Abiad.