May 2022

Friday, April 29, 2022 — 3:00 PM to Sunday, May 1, 2022 — 6:00 PM EDT to Sun, 05/01/2022 - 18:00

DataFest 2022 registration is now OPEN!

Register online now!

All members of your team must register.

Monday, May 9, 2022 — 11:30 to 11:30 AM EDT

Title: Polynomials, rank and cap sets

Speaker:

Péter Pál Pach

Affiliation:

Budapest University of Technology

Zoom: Contact Sabrina Lato for link

Abstract:

In this talk we will look at a variant of the polynomial method which was first used to prove that sets avoiding 3-term arithmetic progressions in groups like Z_4^n and F_q^n are exponentially small (compared to the size of the group). We will discuss lower and upper bounds for the size of the extremal subsets.  We will also mention some further applications of the method, for instance, the solution of the Erdős–Szemerédi theorem sunflower conjecture.

Tuesday, May 10, 2022 — 3:00 PM EDT

Title: Connectivity functions and connectivity intertwining

Speaker: Jim Geelen Affiliation: University of Waterloo Room: MC 5417

Abstract:

Connectivity functions provide a nice way of unifying matroid connectivity with various notions of connectivity in graphs. I will present some new and old open problems.

Thursday, May 12, 2022 — 1:00 PM EDT

Title:  A vertex model for LLT polynomials and k-tilings of the Aztec diamond

Speaker: Andrew Gitlin Affiliation: UC Berkeley Room/Zoom: MC5479 or for Zoom link contact Logan Crew or Olya Mandelshtam

Abstract:

We describe a Yang-Baxter integrable colored vertex model, from which we construct a class of partition functions that equal the LLT polynomials of Lascoux, Leclerc, and Thibon. Using the vertex model formalism, we can prove many properties of these polynomials.

Friday, May 13, 2022 — 8:30 AM to Saturday, May 14, 2022 — 5:00 PM EDT to Sat, 05/14/2022 - 17:00

The Ontario Combinatorics Workshop is a meeting for researchers working in combinatorics from Ontario and surrounding areas to gather and share their latest research developments. The objective of this meeting is to have an atmosphere conducive to research discussion and collaboration. The setting of the meeting is informal to provide a friendly environment for students and post-doctoral fellows to present their results, to exchange ideas, and to gain exposure to various topics in combinatorics. It is also a place where students and faculties meet, which may foster future collaborations. 

Registration

To register, click here.

Friday, May 13, 2022 — 3:30 PM EDT

Title: Radical Sylvester-Gallai theorem for cubics - and beyond

Speaker: Rafael Oliveira Affiliation: University of Waterloo Location: MC 5501 or please contact Emma Watson for Zoom link

Abstract:

In 1893, Sylvester asked a basic question in combinatorial geometry: given a finite set of distinct points $v_1, \ldots, v_m \in \R^N$ such that the line defined by any pair of distinct points $v_i, v_j$ contains a third point $v_k$ in the set, must all points in the set be collinear?

Thursday, May 19, 2022 — 1:00 PM EDT

Title: P-partition power sums

Speaker: Victor Wang Affiliation: University of British Columbia Room/Zoom: MC5479 or for Zoom link contact Logan Crew or Olya Mandelshtam

Abstract:

The Hopf algebra of symmetric functions is spanned by several important bases, including by power sum symmetric functions, which encode the class values of the characters of the symmetric group under the Frobenius characteristic map.

Tuesday, May 24, 2022 — 9:00 AM to Friday, May 27, 2022 — 4:30 PM EDT to Fri, 05/27/2022 - 16:30

A celebration of Goulden and Jackson's combined 90 years of insight and inspiration that have shaped the fields of algebraic and combinatorial enumeration.

 

Registration

To register, click here.

Tuesday, May 24, 2022 — 3:00 PM EDT

Title: On Donuts and Quasigraphic matroids

Speaker: Peter Nelson Affiliation: University of Waterloo Room: MC 5417

Abstract:

Quasigraphic matroids are graph-like objects that give a common generalization of lift and frame matroids. Donuts are edible topological surfaces. I will talk about a surprising link between these two types of object, assuming no prior knowledge of quasigraphic matroids or donuts.

Thursday, May 26, 2022 — 11:30 to 11:30 AM EDT

Title: Faster Algorithms for Isogeny Problems using Torsion Point Images. 

Speaker: Dinesh Valluri Affiliation: University of Waterloo Attend: Contact Jesse Elliott

Abstract:

In this talk, we will discuss cryptanalysis of some SIDH-type protocols due to Christophe Petit: https://eprint.iacr.org/2017/571.pdf. While finding isogenies between supersingular elliptic curves remains computationally hard to solve, knowledge of images of specific torsion points by the unknown isogeny helps build faster attacks.

S M T W T F S
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
3
4
  1. 2022 (79)
    1. June (17)
    2. May (10)
    3. April (12)
    4. March (18)
    5. February (10)
    6. January (13)
  2. 2021 (103)
    1. December (3)
    2. November (7)
    3. October (6)
    4. September (12)
    5. August (6)
    6. July (10)
    7. June (12)
    8. May (7)
    9. April (9)
    10. March (13)
    11. February (8)
    12. January (10)
  3. 2020 (119)
  4. 2019 (167)
  5. 2018 (136)
  6. 2017 (103)
  7. 2016 (137)
  8. 2015 (136)
  9. 2014 (88)
  10. 2013 (48)
  11. 2012 (39)
  12. 2011 (36)
  13. 2010 (40)
  14. 2009 (40)
  15. 2008 (39)
  16. 2007 (15)