October 1, 2020
10:20AM - 11:15AM
Zoom link to be announced
Add to Calendar
2020-10-01 10:20:00
2020-10-01 11:15:00
Combinatorics Seminar - Peter Winkler
Title: Permutation Pattern Densities
Speaker: Peter Winkler - Dartmouth
Abstract: The “pattern density” of a permutation pi in a permutation sigma is the fraction of subsequences of sigma (written in one-line form) that are ordered like pi. For example, the density of the pattern “12” in sigma is the number of pairs i < j with sigma(i) < sigma(j), divided by n choose 2.
What does a typical permutation look like that has one or more pattern densities fixed? To help answer this we employ limit objects called “permutons,” together with a variational principle that identifies the permuton that best represents a given class of permutations.
Joint work with Rick Kenyon, Dan Kral’ and Charles Radin, and (later) with Chris Coscia and Martin Tassy.
Zoom link to be announced
OSU ASC Drupal 8
ascwebservices@osu.edu
America/New_York
public
Date Range
Add to Calendar
2020-10-01 10:20:00
2020-10-01 11:15:00
Combinatorics Seminar - Peter Winkler
Title: Permutation Pattern Densities
Speaker: Peter Winkler - Dartmouth
Abstract: The “pattern density” of a permutation pi in a permutation sigma is the fraction of subsequences of sigma (written in one-line form) that are ordered like pi. For example, the density of the pattern “12” in sigma is the number of pairs i < j with sigma(i) < sigma(j), divided by n choose 2.
What does a typical permutation look like that has one or more pattern densities fixed? To help answer this we employ limit objects called “permutons,” together with a variational principle that identifies the permuton that best represents a given class of permutations.
Joint work with Rick Kenyon, Dan Kral’ and Charles Radin, and (later) with Chris Coscia and Martin Tassy.
Zoom link to be announced
Department of Mathematics
math@osu.edu
America/New_York
public
Title: Permutation Pattern Densities
Speaker: Peter Winkler - Dartmouth
Abstract: The “pattern density” of a permutation pi in a permutation sigma is the fraction of subsequences of sigma (written in one-line form) that are ordered like pi. For example, the density of the pattern “12” in sigma is the number of pairs i < j with sigma(i) < sigma(j), divided by n choose 2.
What does a typical permutation look like that has one or more pattern densities fixed? To help answer this we employ limit objects called “permutons,” together with a variational principle that identifies the permuton that best represents a given class of permutations.
Joint work with Rick Kenyon, Dan Kral’ and Charles Radin, and (later) with Chris Coscia and Martin Tassy.
