Let A be a random n×n matrix with independent entries, and suppose that the entries are “uniformly anticoncentrated” (for example, A could be a uniformly random n×n matrix with ±1 entries). We prove that the permanent of A is exponentially anticoncentrated, significantly improving previous bounds of Tao and Vu. Our proof also works for the determinant, giving an alternative proof of a classical theorem of Kahn, Komlós and Szemerédi. Joint work with Zach Hunter and Lisa Sauermann.

We present a dynamic data structure that maintains a tree decomposition of width at most 9k+8 of a dynamic graph with treewidth at most k, which is updated by edge insertions and deletions. The amortized update time of our data structure is $2^{O(k)} \log n$, where n is the number of vertices. The data structure also supports maintaining any “dynamic programming scheme” on the tree decomposition, providing, for example, a dynamic version of Courcelle’s theorem with $O_k(\log n)$ amortized update time; the $O_k(⋅)$ notation hides factors that depend on k. This improves upon a result of Korhonen, Majewski, Nadara, Pilipczuk, and Sokołowski [FOCS 2023], who gave a similar data structure but with amortized update time $2^{k^{O(1)}} n^{o(1)}$. Furthermore, our data structure is arguably simpler. Our main novel idea is to maintain a tree decomposition that is “downwards well-linked”, which allows us to implement local rotations and analysis similar to those for splay trees. This talk is based on arXiv:2504.02790.

Given a prime power $q \equiv 1 \pmod 4$, the Paley graph of order $q$ is the graph defined over $\mathbb{F}_q$ (the finite field with $q$ elements), such that two vertices are adjacent if and only if their difference is a square in $\mathbb{F}_q$. In this talk, I will present some recent progress on the clique number of Paley graphs of non-square order, the characterization of maximum cliques in Paley graphs of square order, as well as their extensions to cyclotomic graphs. In particular, I will highlight a new proof of the Van Lint–MacWilliams’ conjecture using ideas from arithmetic combinatorics.

We present a new cryptomorphic definition of orthogonal matroids with coefficients using Grassmann-Plücker functions. The equivalence is motivated by Cayley’s identities expressing principal and almost-principal minors of a skew-symmetric matrix in terms of its pfaffians. As a corollary of the new cryptomorphism, we deduce that each component of the orthogonal Grassmannian is parameterized by certain part of the Plücker coordinates. This is joint work with Changxin Ding.

Since the development of the first randomized polynomial-time algorithm for volume computation by Dyer, Frieze, and Kannan in 1989, convex-body sampling has been a central problem at the intersection of algorithms, geometry, and probability. A major milestone came in 1997, when Kannan, Lovász, and Simonovits analyzed the Ball Walk and formulated the influential KLS conjecture. This was extended to log-concave distributions by Lovász and Vempala in 2006, and further accelerated by Cousins and Vempala in 2015 through warm-start generation techniques. In this talk, I will present a gentle introduction to these milestones and how they have been streamlined and improved in the past few years. The talk is based on joint work with Santosh Vempala.

In [1], Fabianski et. al. developed a simple, yet surprisingly powerful algorithmic framework to develop efficient parameterized graph algorithms. Notably they derive a simple parameterized algorithm for the dominating set problem on a variety of graph classes, including powers of nowhere dense classes and biclique-free classes. These results encompass a wide range of previously known results and often improve the best known running times. Similar results follow for the distance-r variation of dominating set and for independent set. The running time of the algorithm is closely tied to model-theoretic properties, i.e. stability and the Helly property. We build upon these results and develop a similar algorithm which only relies on the strong Helly property and does not need stability. For the dominating set problem, we get a parameterized algorithm that works (additionally to biclique-free classes and powers of nowhere dense classes) weakly gamma-closed classes while being simpler and faster than previously known results. In this talk, we introduce the basic framework, results by Fabianski et. al and connections to other areas. We discuss our new insights and possible research directions. [1] Grzegorz Fabianski, Michal Pilipczuk, Sebastian Siebertz, Szymon Torunczyk: Progressive Algorithms for Domination and Independence. STACS 2019

Boolean function analysis for the hypercube $\{ 0, 1 \}^n$ is a well-developed field and has many famous results such as the FKN Theorem or Nisan-Szegedy Theorem. One easy example is the classification of Boolean degree $1$ functions: If $f$ is a real, $n$-variate affine function which is Boolean on the $n$-dimensional hypercube (that is, $f(x) \in \{ 0, 1 \}$ for $x \in \{ 0, 1 \}^n$), then $f(x) = 0$, $f(x) = 1$, $f(x) = x_i$ or $f(x) = 1 – x_i$. The same classification (essentially) holds if we restrict $\{ 0, 1\}^n$ to elements with Hamming weight $k$ if $n-k, k \geq 2$. If we replace $k$-sets of $\{ 1, \ldots, n \}$ by $k$-spaces in $V(n, q)$, the $n$-dimensional vector space over the field with $q$ elements, then suddenly even the simple question of classifying Boolean degree $1$ functions, here traditionally known as Cameron-Liebler classes, becomes seemingly hard to solve. We will discuss some results on low-degree Boolean functions in the vector space setting. Most notably, we will discuss how vector space Ramsey numbers, so extremal combinatorics, can be utilized in this finite geometrical setting.