2017
Oct
23

# HD-Combinatorics: Nati Linial, "High-dimensional permutations"

2:00pm to 4:00pm

## Location:

Israel Institute for Advanced Studies (Feldman building, Givat Ram), Eilat Hall

This is a survey talk about one of the main parts of what we call high-dimensional combinatorics. We start by equating a permutation with a permutation matrix. Namely, an nxn array of zeros and ones where every line (=row or column) contains exactly one 1. In general, a d-dimensional permutation is an array [n]x[n]x....x[n] (d+1 factors) of zeros and ones in which every line (now there are d+1 types of lines) contains exactly one 1. Many questions suggest themselves, some of which we have already solved, but many others are still wide opne. Here are a few examples: