Thursday, March 24, 2022

Thursday, March 24, 2022 — 1:00 PM EDT

Title: Sorting probabilities for Young diagrams and beyond

Speaker: Greta Panova Affiliation: University of Southern California Zoom: Contact Logan Crew or Olya Mandelshtam

Abstract:

Sorting probability for a partially ordered set P is defined as the min |Pr[x<y] - Pr[y<x]| going over all pairs of elements x,y in P, where Pr[x<y] is the probability that in a uniformly random linear extension (extension to total order) x appears before y.

The celebrated 1/3-2/3 conjecture states that for every poset the sorting probability is at most 1/3, i.e. there are two elements x and y, such that 1/3\leq Pr[x<y] \leq 2/3.

S M T W T F S
27
28
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
1
2
  1. 2022 (146)
    1. December (4)
    2. November (18)
    3. October (15)
    4. September (11)
    5. August (2)
    6. July (17)
    7. June (17)
    8. May (10)
    9. April (12)
    10. March (18)
    11. February (10)
    12. January (13)
  2. 2021 (103)
    1. December (3)
    2. November (7)
    3. October (6)
    4. September (12)
    5. August (6)
    6. July (10)
    7. June (12)
    8. May (7)
    9. April (9)
    10. March (13)
    11. February (8)
    12. January (10)
  3. 2020 (119)
  4. 2019 (167)
  5. 2018 (136)
  6. 2017 (103)
  7. 2016 (137)
  8. 2015 (136)
  9. 2014 (88)
  10. 2013 (48)
  11. 2012 (39)
  12. 2011 (36)
  13. 2010 (40)
  14. 2009 (40)
  15. 2008 (39)
  16. 2007 (15)