À¶Ý®ÊÓƵ

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: Counting biased cliques

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

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

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

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: 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: Hamilton cycles in cubic planar graphs

Abstract:ÌýTait conjectured in 1884 that each cubic planar graph contains a Hamilton cycle. Had the conjecture been true,

Title:ÌýDistributed coloring in planar graphs

Abstract:

We are concerned with efficiently coloring sparse graphs in the distributed setting with as few colors as possible. According to the celebrated Four Color Theorem, planar graphs can be colored with at most 4 colors, and the proof gives a (sequential) quadratic algorithm finding such a coloring.

Title:ÌýMinimization of convex compositions

Abstract:

Numerous optimization tasks can be posed as minimization of a finite convex function composed with a smooth map. Phase retrieval andÌýmatrix factorization problems are commonÌýexamples.