### Gábor Tardos, Extremal theory of 0-1 matrices

Room B332 IBS (기초과학연구원)We say that a 0-1 matrix A contains another such matrix (pattern) P if P can be obtained from a submatrix of A by possibly changing a few 1 entries …

Skip to content
##

###
Gábor Tardos, Extremal theory of 0-1 matrices

Room B332
IBS (기초과학연구원)
##

###
Mathias Schacht, Canonical colourings in random graphs

Room B332
IBS (기초과학연구원)
###
Kyeongsik Nam (남경식), Random walks on percolation

Room B332
IBS (기초과학연구원)
###
Colin Geniet, Permutations, patterns, and twin-width

Room B332
IBS (기초과학연구원)
###
Felix Christian Clemen, Triangles in the Plane

Room B332
IBS (기초과학연구원)
##

###
Michał Pilipczuk, TBA

Room B332
IBS (기초과학연구원)
###
Karim Adiprasito, Ehrhart theory revisited: Algebraic aspects, unimodality and more

Room B332
IBS (기초과학연구원)
##

###
Johannes Carmesin, TBA

Room B332
IBS (기초과학연구원)

Loading view.

We say that a 0-1 matrix A contains another such matrix (pattern) P if P can be obtained from a submatrix of A by possibly changing a few 1 entries …

Rödl and Ruciński established Ramsey's theorem for random graphs. In particular, for fixed integers $r$, $\ell\geq 2$ they showed that $n^{-\frac{2}{\ell+1}}$ is a threshold for the Ramsey property that every …

In general, random walks on fractal graphs are expected to exhibit anomalous behaviors, for example heat kernel is significantly different from that in the case of lattices. Alexander and Orbach …

This talk will first introduce combinatorics on permutations and patterns, presenting the basic notions and some fundamental results: the Marcus-Tardos theorem which bounds the density of matrices avoiding a given …

A classical problem in combinatorial geometry, posed by Erdős in 1946, asks to determine the maximum number of unit segments in a set of $n$ points in the plane. Since …

Ehrhart theory is the study of lattice polytopes, specifically aimed at understanding how many lattice points are inside dilates of a given lattice polytope, and the study has a wide …