Title: An elementary approach to the quasipolynomiality of the Kronecker coefficients
Title:Â The combinatorics of Standard Young tableaux of bounded height
| Speaker: | ²Ñ²¹°ù²Ô¾±Ìý²Ñ¾±²õ³ó²Ô²¹ |
| Affiliation: | Simon Fraser University |
| Room: | MC 5501 |
Abstract:
Standard Young tableaux are a classic object of mathematics, appearing in problems from representation theory to bijective combinatorics.
Title:Â LWE part 3: The relation with BDD
| Speaker: | Luis Ruiz |
| Affiliation: | University of À¶Ý®ÊÓƵ |
| Room: | MC 6486 |
Abstract:Â The last piece of the puzzling reduction
Title:Â The Number 6 Hash Function Collision
| Speaker: | Chris Godsil |
| Affiliation: | University of À¶Ý®ÊÓƵ |
| Room: | MC 6486 |
Abstract:Â If V is a vector space of dimension d over the eld GF(q), we have all sorts of families of
Title:Â Coloring Graphs of Bounded Maximum Degree with Small Clique Number
| Speaker: | Tom Kelly |
| Affiliation: | University of À¶Ý®ÊÓƵ |
| Room: | MC 5479 |
Abstract: Greedy coloring yields an upper bound on the chromatic number $\chi$ of $\Delta+1$Â for graphs of maximum degree at most $\Delta$, which is tight for cliques.Â
Title:Â Large matroids: asymptotic enumeration
| Speaker: | Jorn van der Pol |
| Affiliation: | University of À¶Ý®ÊÓƵ |
| Room: | MC 5501 |
Abstract:
How many matroids are there on a ground set of a given size? Although the question is a very basic one, we only know the answer up to a constant factor in the exponent.
Title:Â Asymptotic Distribution of Parameters in Random Maps
| Speaker: | ´³³Ü±ô¾±±ð²ÔÌý°ä´Ç³Ü°ù³Ù¾±±ð±ô |
| Affiliation: | Universite de Caen in France |
| Room: | MC 6486 |
Abstract: A rooted map is a connected graph
Title:Â The Combinatorial NullstellensatzÂ
| Speaker: | Maxwell Levit |
| Affiliation: | University of À¶Ý®ÊÓƵ |
| Room: | MC 6486 |
Abstract:Â I will survey Alon's survey of the combinatorial nullstellensatz.
Title:Â Representability of Matroids
| Speaker: | Rutger Campbell |
| Affiliation: |  University of À¶Ý®ÊÓƵ |
| Room: | MC 5479 |
Abstract:Â I will go over some negative results regarding characterizations for the class of representable
Title:Â The number theory of equiangular lines
| Speaker: | Jon Yard |
| Affiliation: | University of À¶Ý®ÊÓƵ |
| Room: | MC 5501 |
Abstract:
It is easy to prove that there can exist at most d2 equiangular complex lines in Cd. Configurations saturating this bound are known by other names: maximal equiangular tight frames, minimal complex projective 2-designs and symmetric informationally complete positive operator-valued measures (SIC-POVMs).