Future students

Title: Parameterized Approximation Algorithms for Steiner Network Problems 

Abstract:

Two standard approaches to handle NP-hard optimization problems are to develop approximation and parameterized algorithms.

Title: Counting biased cliques

Abstract: A biased graph is a pair consisting of an undirected graph G,

Title: Asymptotics of the principal of specializations of Schubert polynomials

Abstract: Schubert polynomials were introduced by Lascoux and Sch\"utzenberger in 1982 to study Schubert varieties.

Title: Miniconference on combinatorial structures in perturbative QFT 2: transforms and graph counting

Title: Combinatorics in Particle Interactions

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: Graph Reconstruction

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

Abstract: Let G be a graph whose vertex set is partitioned into classes V₁,..., V_m. An independent transversal of G with respect to (V_1,...,V_m) is an independent set {v_1,...,v_m} in G such that v_i is in V_i for each i.

Title: The number theory of equiangular lines

Abstract:

It is easy to prove that there can exist at most d² equiangular complex lines in C^d. 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: The Combinatorial Nullstellensatz 

Abstract: I will survey Alon's survey of the combinatorial nullstellensatz.

Title: Representability of Matroids

Abstract: I will go over some negative results regarding characterizations for the class of representable