WINCOM VIRTUAL COLLOQUIUM
We are pleased to continue this colloquium for the 2020-2021 academic year.
Each week we will be hosting a Zoom seminar by members of this network. If you would like to sign up for the email reminders for this colloquium, please join our email list below. The goal of the colloquium is to encourage community and collaboration within the network and the entire combinatorics community.
You can join this meeting via the Zoom link that will be sent out weekly. You can also find information about our seminar, and many other virtual talks at Combinatorics Lectures Online.
Slides from the talks are available where possible and can be found by clicking on the title of each talk.
SCHEDULE AND SPEAKER LIST
THURSDAY SEPTEMBER 24TH 2PM EDT
Dr. Mei Yin, University of Denver
Interval parking functions
The topic of parking functions has wide applications in probability, combinatorics, group theory, and computer science. One generalization of the classic parking function is the interval parking function, where each car has an interval rather than a single spot of preference. We classify features of interval parking functions, and in particular show that the pseudoreachability order on interval parking functions coincides with the bubble-sort order on the symmetric group. Based on joint work with Emma Colaric, Ryan DeMuse, and Jeremy Martin.
THURSDAY SEPTEMBER 10TH 12NOON EDT
Dr. Carolyn Chun, United States Naval Academy
Inductive tools for graphs (and matroids)
In this talk, we consider inductive tools for graphs (and matroids) that preserve a kind of robustness, called connectivity. In 1966, Tutte proved that every 3-connected graph (or matroid) other than a wheel (or whirl) has a single-edge deletion or contraction that is 3-connected. Seymour extended this result in 1980 to show that, in addition to preserving 3-connectivity, we can preserve a given substructure, namely a 3-connected minor. We present the long-running project joint with James Oxley and Dillon Mayhew to obtain such results for graphs (and matroids) that are internally 4-connected.
THURSDAY 3 SEPTEMBER 2PM EDT
Dr. Relinde Jurrius, Netherlands Defence Academy
Designs, matroids, and their q-analogues
Both designs and matroids are combinatorial objects that can be described as "a finite set and a family of subsets with certain nice properties". I will introduce both objects and explain an old result that tells how to make new designs form a given design by interpreting it as a matroid. The goal of this talk is to give a q-analogue of this result. A q-analogue is roughly what happens when we generalize form finite sets to finite dimensional spaces. The q-analogues of both designs and matroids can thus be described as "a finite space and a family of subspaces with certain nice properties". I will fill in some more details and explain our result on how to make new q-analogues of designs from a given q-analogue of a design, by interpreting it as the q-analogue of a matroid.
This talk is based on joint work with Eimear Byrne, Michela Ceria, Sorina Ionica and Elif Sacikara.
THURSDAY 30 JULY 2PM EDT
Dr. Karin Baur, University of Leeds
Combinatorics of Frieze patterns
THURSDAY 23 JULY 2PM EDT
Dr. Maria Elisa Fernandes, University of Aveiro
Abstract regular polytopes for symmetric and alternating groups
THURSDAY 16 JULY 2PM EDT
Dr. Laura Colmenarejo, University of Massachusetts Amherst
An insertion algorithm for diagram algebras
THURSDAY 9 JULY 2PM EDT
Dr. Abigail Raz, University of Nebraska, Lincoln
Perfect matchings in the random bipartite geometric graph
THURSDAY 2 JULY 2PM EDT
Lina Li, University of Illinois Urbana-Champaign
On the number of Integer colorings with forbidden rainbow sums
THURSDAY 25 JUNE 2PM EDT
Dr. Novi Herawati Bong, University of Delaware
Strong Dimension and Threshold Strong Dimension of Graphs.
THURSDAY 18 JUNE 2PM EDT
Dr. Ellen Veomett, Saint Mary's College of California
The Mathematician and the Mapmaker: Using Mathematics to Combat Gerrymandering
THURSDAY 11 JUNE 2PM EDT
Shannon Odgen, University of Victoria
Total Roman Domination Edge-Supercritical and Edge-Removal-Supercritical Graphs
THURSDAY 4 JUNE 2PM EDT
Dr. Érika Roldán, Technische Universität München
Two Geometric Problems in Extremal Topological Combinatorics
THURSDAY 28 MAY 2PM EDT
Carla Groenland, University of Oxford
Reconstruction from small cards
THURSDAY 21 MAY 2PM EDT
Dr. Sophie Spirkl, Princeton University
THURSDAY 14 MAY 2PM EDT
THURSDAY 7 MAY 2PM EDT
Dr. Ray Karpman, Otterbein University
THURSDAY 30 APRIL 2PM EDT
Dr. Gal Kronenberg, University of Oxford
Extremal problems of long cycles in random graphs
THURSDAY 23 APRIL 2PM EDT
Dr. Natasha Morrison, University of Cambridge
THURSDAY 16 APRIL 3PM EDT
Dr. Eva Czabarka, University of South Carolina
The midrange crossing constant and some of its uses
THURSDAY 9 APRIL 3PM EDT
Dr. Michelle Delcourt, Ryerson University
THURSDAY 2 APRIL 3PM EDT
Dr. Margaret Bayer, University of Kansas
THURSDAY 26 MARCH 3PM EDT
Dr. Ruth Luo, University of California San Diego