Lisa Sauermann

activity

20172026

most citedEssentially tight bounds for rainbow cycles in proper edge-colourings

3 citations · 7 across the 17 of their papers we have counts for

collaborators

Showing math.COShow all

24 papers · 1 filter

math.CO2026

Poset dimension and maximum comparability degree

Carla Groenland, Richard Montgomery, Rajko Nenadov +1

In 1986, Füredi and Kahn showed that the dimension $dim (P)$ of any finite poset $P$ satisfies $dim (P) = O (d lo g^{2} d)$ , where $d$ is the maximum degree of the comparability graph…

math.CO2026

Permanents of random matrices over finite fields

Zach Hunter, Matthew Kwan, Lisa Sauermann

Fix a finite field $F_{q}$ and let $A \in F_{q}^{n \times n}$ be a uniformly random $n \times n$ matrix over $F_{q}$ . The asymptotic distribution of the determinant…

math.CO2026

On Graham's rearrangement conjecture

Huy Tuan Pham, Lisa Sauermann

Graham conjectured in 1971 that for any prime $p$ , any subset $S \subseteq Z_{p} ∖ {0}$ admits an ordering $s_{1}, s_{2}, \dots, s_{∣ S ∣}$ where all partial sums $s_1, s_1+s…

math.CO2025

Disproof of the Odd Hadwiger Conjecture

Marcus Kühn, Lisa Sauermann, Raphael Steiner +1

We prove that there exist graphs which do not contain $K_{t}$ as an odd minor and whose chromatic number is at least $(\frac{3}{2} - o (1)) t$ . This disproves, in a strong form, the odd Had…

math.CO2025

Asymptotically-tight packing and covering with transversal bases in Rota's basis conjecture

Richard Montgomery, Lisa Sauermann

In 1989, Rota conjectured that, given any $n$ bases $B_{1}, \dots, B_{n}$ of a vector space of dimension $n$ , or more generally a matroid of rank $n$ , it is possible to rearrange these i…

math.CO2025

Algebraic aspects of the polynomial Littlewood-Offord problem

Zhihan Jin, Matthew Kwan, Lisa Sauermann +1

Consider a degree- $d$ polynomial $f (ξ_{1}, \dots, ξ_{n})$ of independent Rademacher random variables $ξ_{1}, \dots, ξ_{n}$ . To what extent can $f (ξ_{1}, \dots, ξ_{n})$ concentrate on a single point?…