High-dimensional permutations and discrepancy

23. červenec 2016

Řečníci

O prezentaci

This is part of our ongoing effort to develop what we call "High-dimensional combinatorics". We equate a permutation with its permutation matrix, namely an nxn array of zeros and ones in which every line (row or column) contains exactly one 1. In analogy, a two-dimensional permutation is an nxnxn array of zeros and ones in which every line (row, column or shaft) contains exactly one 1. It is not hard to see that a two-dimensional permutation is synonymous with a Latin square. It should be clear what a d-dimensional permutation is, and those are still very partially understood. We have already made good progress on several aspects of this field. We largely start from a familiar phenomenon in the study of permutations and seek its high dimensional counterparts. Specifically we already have some progress on the following: The enumeration problem Birkhoff von-Neumann theorem and d-stochastic arrays Erdös-Szekeres theorem and monotone sub-sequences Discrepancy phenomena – this will be a major focus of my lecture Random generation Almost everything that I will be presenting is joint work with my ex-student Zur Luria.

Organizátor

Kategorie

O organizátorovi (The Mathematics of Jiří Matoušek )

International Conference on The Mathematics of Jiří Matoušek, Charles University, Prague 2016

Uložení prezentace

Měla by být tato prezentace uložena po dobu 1000 let?

Jak ukládáme prezentace

Pro uložení prezentace do věčného trezoru hlasovalo 0 diváků, což je 0.0 %

Sdílení

Doporučená videa

Prezentace na podobné téma, kategorii nebo přednášejícího

Zajímají Vás podobná videa? Sledujte The Mathematics of Jiří Matoušek