À¶Ý®ÊÓƵ

°Õ¾±³Ù±ô±ð:ÌýRobust discrete optimization and network flows (paper by Bertsimas and Sim)

°Õ¾±³Ù±ô±ð:ÌýInterpolating between the characteristic and matching polynomials of a graph

Abstract:

The characteristic polynomial Φ(X, t) of a graph X has two obvious combinatorial connections.

°Õ¾±³Ù±ô±ð:ÌýTransversals in covers of graphs

Abstract:

We study a polynomial with connections to correspondence colouring (also known as DP-colouring) and the Unique Games Conjecture.

Title: Spins Lattices, Graphs and Quantum State Revivals

Abstract:

This talk will describe how certain features of quantum transport along spin chains can be enabled.

Title: An elementary approach to the quasipolynomiality of the Kronecker coefficients

Title: The combinatorics of Standard Young tableaux of bounded height

Abstract:

Standard Young tableaux are a classic object of mathematics, appearing in problems from representation theory to bijective combinatorics.

Title: LWE part 3: The relation with BDD

Abstract: The last piece of the puzzling reduction

Title: The Number 6 Hash Function Collision

Abstract: If V is a vector space of dimension d over the eld GF(q), we have all sorts of families of

Title: Coloring Graphs of Bounded Maximum Degree with Small Clique Number

Abstract: Greedy coloring yields an upper bound on the chromatic number $\chi$ of $\Delta+1$ for graphs of maximum degree at most $\Delta$, which is tight for cliques. 

Title: Large matroids: asymptotic enumeration

Abstract:

How many matroids are there on a ground set of a given size? Although the question is a very basic one, we only know the answer up to a constant factor in the exponent.