Future students

Title: Online Learning of Quantum States

Abstract:

Suppose we have many copies of an unknown n-qubit state rho. We measure some copies of rho using a known two-outcome measurement E_1, then other copies using a measurement E_2, and so on.

Title: A single pass bijection between certain quarter plane lattice walks and certain Motzkin-like paths.

Abstract: A p-tandem quarter plane walk is a walk starting at the origin and remaining in the first quadrant

Title: On isogeny graphs of supersingular elliptic curves over finite fields

Abstract: In this talk we will present some results on the isogeny graphs of supersingular elliptic curves

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.