比利时vs摩洛哥足彩
,
university of california san diego
****************************
combinatorics seminar (math 269)
sam spiro
sidorenko hypergraphs and random tur\'an numbers
abstract:
let $\mathrm{ex}(g_{n,p}^r,f)$ denote the maximum number of edges in an $f$-free subgraph of the random $r$-uniform hypergraph $g_{n,p}^r$. following recent work of conlon, lee, and sidorenko, we prove non-trivial lower bounds on $\mathrm{ex}(g_{n,p}^r,f)$ whenever $f$ is not sidorenko. this connection between sidorenko's conjecture and random tur\'an problems gives new lower bounds on $\mathrm{ex}(g_{n,p}^r,f)$ whenever $f$ is not sidorenko, and further allows us to bound how ``far'' from sidorenko an $r$-graph $f$ is whenever upper bounds for $\mathrm{ex}(g_{n,p}^r,f)$ are known. this is joint work with jiaxi nie.
host: brendon rhoades
january 9, 2024
2:00 pm
apm 7321
****************************