Algebraic Combinatorics Seminar
Title: Asymptotic Distribution of Parameters in Random Maps
Speaker: | Julien Courtiel |
Affiliation: | Universite de Caen in France |
Room: | MC 6486 |
Abstract: A rooted map is a connected graph
Title: Asymptotic Distribution of Parameters in Random Maps
Speaker: | Julien Courtiel |
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 Waterloo |
Room: | MC 6486 |
Abstract: I will survey Alon's survey of the combinatorial nullstellensatz.
Title: Representability of Matroids
Speaker: | Rutger Campbell |
Affiliation: | University of Waterloo |
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 Waterloo |
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).
Title: Asymptotics of the principal of specializations of Schubert polynomials
Speaker: | Alejandro Morales |
Affiliation: | University of Massachusetts Amherst |
Room: | MC 6486 |
Abstract: Schubert polynomials were introduced by Lascoux and Sch\"utzenberger in 1982 to study Schubert varieties.
Title: Graph Reconstruction
Speaker: | Cathy Wang |
Affiliation: | University of Waterloo |
Room: | MC 6486 |
Abstract: The graph reconstruction conjecture by Kelly and Ulam states that all graphs on at least three vertices are determined by their one-vertex deleted subgraphs, up to isomorphism.
Title: Finding Independent Transversals Efficiently
Speaker: | Alessandra Graf |
Affiliation: | University of Waterloo |
Room: | MC 5479 |
Abstract: Let G be a graph whose vertex set is partitioned into classes V1,..., Vm. An independent transversal of G with respect to (V1,...,Vm) is an independent set {v1,...,vm} in G such that vi is in Vi for each i.
Title: Miniconference on combinatorial structures in perturbative QFT 2: transforms and graph counting
Speakers: |
various |
Title: Combinatorics in Particle Interactions
Speaker: | Freddy Cachazo |
Affiliation: | Perimeter Institute |
Room: | MC 5501 |
Abstract:
The main approach for testing physical theories of particles is via scattering experiments. The traditional approach for computing theoretical predictions uses Feynman diagrams.
Title: A single pass bijection between certain quarter plane lattice walks and certain Motzkin-like paths.
Speaker: | Karen Yeats |
Affiliation: | University of Waterloo |
Room: | MC 6486 |
Abstract: A p-tandem quarter plane walk is a walk starting at the origin and remaining in the first quadrant