Events

Title:‘Coloring 3-colorable graphs with o(n^1⁄5) colors’ by Kawarabayashi and Thorup

Abstract: Much attention has been devoted to nding polynomial time algorithms for coloring three-
colorable graphs with the fewest possible colors.

Title: The rank of random matrices over finite fields

Abstract:

We determine the rank of a random matrix over a finite field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes.

Title: Circle graphs are quadratically x-bounded

Abstract: A circle graph $G$ is an intersection graph of a set of chords on a circle.

Title: Quantum Walks, State Transfer, and Entanglement

Abstract: Quantum walks are the quantum analogues of classical random walks and can be used to model quantum computations.

Title: Coloring 3-colorable graphs with o(n^1/5) colors

Abstract: This is the second part of the seminar on recent results obtained by Kawarabayashi and Thorup

Title: Applications of the entropy method: Counting proper colorings of a regular graph

Abstract: Following Section 6 of Galvin's notes on Entropy and Counting, we will explore Galvin and Tetali’s tight upper bound

Title: Bounding Dedekind numbers with entropy

Abstract: The Dedekind numbers (sequence A000372 in the OEIS)

Title: Cyclic flat approach to matroid base polytopes

Abstract: Ardila, Benedetti and Doker realised matroid polytopes as generalized permutohedra, and using the work of Postnikov,

Title: Difference-of-SOS and Difference-of-Convex-SOS Decomposition Techniques for Polynomials

Abstract:

We are interested in polynomial decomposition techniques for reformulating any multivariate polynomial into difference-of-sums-of-squares (DSOS) and difference-of-convex-sums-of-squares (DCSOS) polynomials.

Title: Fixed-parameter tractability with respect to tree-widt

Abstract: Courcelle’s Theorem says that a very general class of decision problems on graphs is FPT with