Events

Title: Counting subdivergence-free gluing of trees

Abstract:

If we take two rooted trees with the same number of leaves and form a graph by gluing the leaves of one tree to the other, then we say the graph is subdivergence-free if no 2-edge cut have been generated.

Title: The combinatorics of nearest and furthest values

Abstract:

A classical problem asks us to find, for each element $A[i]$ of an array of integers, the position of the nearest smallest element.

Title: Stable marraige with general preferences

Abstract:

This week, we discuss a generalization of the standard stable marriage problem, in which one side has a complete, totally ordered, strict preference list while the other has preferences given in terms of arbitrary binary relations.

Title: Optimization and Cryptography in Generalized Physical Theories 

Abstract:

In this talk, I will discuss three important cryptographic tasks in the quantum and post-quantum world. I will discuss the impossibility of bit-commitment and coin-flipping, and also the possibility of physically unforgeable money in the framework of Generalized Physical Theories (GPTs).

Title: Feynman graphs, ribbon graphs and tensor graphs

Abstract:

In this talk I will define the so-called Feynman graphs, which are a particular class of graphs appearing in quantum field theory.

Title: Continuous Quantum Walks

Abstract:

Continuous quantum walks are of considerable interest in quantum physics and quantum computing.

Title: Upsetting Matrices

Abstract: 

Title: Independence Polynomials and Their Roots

Abstract:

Independence polynomials are generating functions for the number of independent sets of each cardinality in a graph G.

Title: Signings and induced subgraphs of the Hypercube

Abstract:

Just over a month ago, Hao Haung resolved the sensitivity conjecture, a 30 year-old question about the complexity of boolean functions.

Title: Approximation Algorithms for Minimum-Norm Optimization Problems

Abstract:

In many optimization problems, a feasible solution induces a multidimensional cost vector. For example, in k-clustering, opening k facilities induces an assignment-cost vector indexed by the clients; in load-balancing, a schedule induces a load vector across the machines.