Current students

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

 Abstract: After having defined the supersingular isogeny graph, in this second talk

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: All Graphs are Beautiful

Abstract: In this talk I will show that all graphs are beautiful. The proof is by induction on g

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.