themath.mit.edu/conferences/stanley70/site/slides/steingrimsson.pdf · adjacency in a p ermutation...
TRANSCRIPT
![Page 1: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/1.jpg)
The topology of the
permutation pattern poset
Einar Steingrímsson
University of Strath lyde
Work by Jason P. Smith and
joint work with Peter M Namara
and with A. Burstein, V. Jelínek and E. Jelínková
![Page 2: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/2.jpg)
An o urren e of a pattern p in a permutation π is a sub-
sequen e in π whose letters appear in the same order of
size as those in p.
463 is an o urren e of 231 in 416325
1
![Page 3: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/3.jpg)
An o urren e of a pattern p in a permutation π is a sub-
sequen e in π whose letters appear in the same order of
size as those in p.
463 is an o urren e of 231 in 416325
2
![Page 4: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/4.jpg)
An o urren e of a pattern p in a permutation π is a sub-
sequen e in π whose letters appear in the same order of
size as those in p.
463 is an o urren e of 231 in 416325
If π has no o urren e of p then π avoids p.
4173625 avoids 4321
3
![Page 5: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/5.jpg)
An o urren e of a pattern p in a permutation π is a sub-
sequen e in π whose letters appear in the same order of
size as those in p.
463 is an o urren e of 231 in 416325
If π has no o urren e of p then π avoids p.
4173625 avoids 4321
(No de reasing subsequen e of length 4)
4
![Page 6: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/6.jpg)
The set of all permutations forms a poset P
with respe t to pattern ontainment
5
![Page 7: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/7.jpg)
The set of all permutations forms a poset P
with respe t to pattern ontainment
σ 6 τ if σ is a pattern in τ
6
![Page 8: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/8.jpg)
· · · 2314 · · ·
123 132 213 231 312 321
12 21
1
The bottom of the poset P
7
![Page 9: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/9.jpg)
· · · 2314 · · ·
123 132 213 231 312 321
12 21
1
The bottom of the poset PThe bottom of the poset P
2314 ontains
213 as a pattern
8
![Page 10: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/10.jpg)
· · · 2314 · · ·
123 132 213 231 312 321
12 21
1
The interval [12,2314] = {π | 12 6 π 6 2314}
9
![Page 11: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/11.jpg)
· · · 2314 · · ·
123 132 213 231 312 321
12 21
1
The interval [12,2314] = {π | 12 6 π 6 2314}
10
![Page 12: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/12.jpg)
2314
231
3142134224133421
241352315434215 24153 31524421531352435214
352164352146 421635241635342165
3521746
11
![Page 13: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/13.jpg)
The Möbius fun tion of an interval I
•
• • •
• • •
•
The Möbius fun tion on I is de�ned by µ(x, x) = 1 and
∑
x6t6y
µ(x, t) = 0 if x < y
12
![Page 14: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/14.jpg)
Computing µ(•, y) on an interval I
•
• • •
• • •
•
-1
1
2
0
-1 -1 -1
1
•
The Möbius fun tion on I is de�ned by µ(x, x) = 1 and
∑
x6t6y
µ(x, t) = 0 if x < y
13
![Page 15: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/15.jpg)
Computing the Möbius fun tion for the pattern poset
A very short prehistory
14
![Page 16: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/16.jpg)
Computing the Möbius fun tion for the pattern poset
A very short prehistory
Wilf (2002): Should be done
15
![Page 17: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/17.jpg)
Computing the Möbius fun tion for the pattern poset
A very short prehistory
Wilf (2002): Should be done
Wilf (2003): A mess. Don't tou h it.
16
![Page 18: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/18.jpg)
Jason Smith (2014)
A des ent in a permutation is a letter followed by a smaller
one
516792348
17
![Page 19: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/19.jpg)
Jason Smith (2014)
A des ent in a permutation is a letter followed by a smaller
one
516792348
18
![Page 20: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/20.jpg)
Jason Smith (2014)
An adja en y in a permutation is a maximal in reasing se-
quen e of letters adja ent in position and value:
516792348
19
![Page 21: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/21.jpg)
Jason Smith (2014)
An adja en y in a permutation is a maximal in reasing se-
quen e of letters adja ent in position and value:
516792348
20
![Page 22: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/22.jpg)
Jason Smith (2014)
An adja en y in a permutation is a maximal in reasing se-
quen e of letters adja ent in position and value:
516792348
21
![Page 23: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/23.jpg)
Jason Smith (2014)
An adja en y in a permutation is a maximal in reasing se-
quen e of letters adja ent in position and value:
516792348
The tail of an adja en y is all but its �rst letter.
22
![Page 24: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/24.jpg)
Jason Smith (2014)
An adja en y in a permutation is a maximal in reasing se-
quen e of letters adja ent in position and value:
516792348
The tail of an adja en y is all but its �rst letter.
23
![Page 25: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/25.jpg)
Jason Smith (2014)
An adja en y in a permutation is a maximal in reasing se-
quen e of letters adja ent in position and value:
516792348
The tail of an adja en y is all but its �rst letter.
An o urren e of a pattern in a permutation π is normal if
the o urren e ontains all the tails of π.
24
![Page 26: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/26.jpg)
Jason Smith (2014)
An adja en y in a permutation is a maximal in reasing se-
quen e of letters adja ent in position and value:
516792348
516792348
The tail of an adja en y is all but its �rst letter.
An o urren e of a pattern in a permutation π is normal if
the o urren e ontains all the tails of π.
The normal o urren es of 3412 in 516792348:
5734 and 6734
25
![Page 27: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/27.jpg)
Jason Smith (2014)
An adja en y in a permutation is a maximal in reasing se-
quen e of letters adja ent in position and value:
516792348
516792348
The tail of an adja en y is all but its �rst letter.
An o urren e of a pattern in a permutation π is normal if
the o urren e ontains all the tails of π.
The normal o urren es of 3412 in 516792348:
5734 and 6734
26
![Page 28: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/28.jpg)
Jason Smith (2014)
An adja en y in a permutation is a maximal in reasing se-
quen e of letters adja ent in position and value:
516792348
516792348
The tail of an adja en y is all but its �rst letter.
An o urren e of a pattern in a permutation π is normal if
the o urren e ontains all the tails of π.
Theorem: If σ and τ have the same number of des ents,
then
µ(σ, τ) = (−1)|τ |−|σ|N(σ, τ),
where N(σ, τ) is the number of normal o urren es of σ in τ .27
![Page 29: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/29.jpg)
Jason Smith (2014)
Theorem: If σ and τ have the same number of des ents,
then
µ(σ, τ) = (−1)|τ |−|σ|N(σ, τ),
where N(σ, τ) is the number of normal o urren es of σ in τ .28
![Page 30: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/30.jpg)
Jason Smith (2014)
Theorem: If σ and τ have the same number of des ents,
then
µ(σ, τ) = (−1)|τ |−|σ|N(σ, τ),
where N(σ, τ) is the number of normal o urren es of σ in τ .
Therefore,
|µ(σ, τ)| 6 σ(τ),
where σ(τ) is the number of o urren es of σ in τ .
29
![Page 31: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/31.jpg)
Jason Smith (2014)
Theorem: If σ and τ have the same number of des ents,
then
µ(σ, τ) = (−1)|τ |−|σ|N(σ, τ),
where N(σ, τ) is the number of normal o urren es of σ in τ .
Therefore,
|µ(σ, τ)| 6 σ(τ),
where σ(τ) is the number of o urren es of σ in τ .
And, the interval [σ, τ ] is shellable.
30
![Page 32: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/32.jpg)
Jason Smith (2014)
Theorem: If σ and τ have the same number of des ents,
then
µ(σ, τ) = (−1)|τ |−|σ|N(σ, τ),
where N(σ, τ) is the number of normal o urren es of σ in τ .
Therefore,
|µ(σ, τ)| 6 σ(τ),
where σ(τ) is the number of o urren es of σ in τ .
And, the interval [σ, τ ] is shellable.
That is, the order omplex of [σ, τ ] is shellable.
31
![Page 33: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/33.jpg)
P
•
•
•
•
•
•
a
b
d
e
f
Order omplex of P
−→ •
•
•
•
•
•
a
b
d
e
f
32
![Page 34: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/34.jpg)
P
•
•
•
•
•
•
a
b
d
e
f
Order omplex of P
−→ •
•
•
•
•
•
a
b
d
e
f
33
![Page 35: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/35.jpg)
P
•
•
•
•
•
•
•
•
•
•
•
•
a
b
d
e
f
Order omplex of P
−→ •
•
•
•
•
•
a
b
d
e
f
−→•
•
•
•
• •
34
![Page 36: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/36.jpg)
P
•
•
•
•
•
•
•
•
•
•
•
•
−→ •
•
•
•
•
•
a
b
d
e
f
Order omplex of P
−→•
•
•
•
• •
•
•
•
•
P̂
1
-1
10
-1
00
01
-1
1
-1
-1
1
-1
1
35
![Page 37: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/37.jpg)
P
•
•
•
•
•
•
•
•
•
•
•
•
−→ •
•
•
•
•
•
a
b
d
e
f
Order omplex of P
−→•
•
•
•
• •
•
•
•
•
P̂
1
-1
10
-1
00
01
-1
1
-1
-1
1
-1
1
Contra tible
A sphere
36
![Page 38: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/38.jpg)
P
•
•
•
•
•
•
•
•
•
•
•
•
−→ •
•
•
•
•
•
a
b
d
e
f
Order omplex of P
−→•
•
•
•
• •
•
•
•
•
P̂
1
-1
10
-1
00
01
-1
1
-1
-1
1
-1
1
Contra tible
A sphere
The Möbius fun tion equals the redu ed Euler hara teristi
37
![Page 39: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/39.jpg)
•
•
•
•
•
•
•
•
•
•
•
•Shellable omplex
•
•
•
•
•
•
•
•
•
•
•
•
Nonshellable omplex
38
![Page 40: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/40.jpg)
•
•
•
•
•
•
•
•
•
•
•
•Shellable omplex
•
•
•
•
•
•
•
•
•
•
•
•
Nonshellable omplex
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
39
![Page 41: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/41.jpg)
•
•
•
•
•
•
•
•
•
•
•
•Shellable omplex
•
•
•
•
•
•
•
•
•
•
•
•
Nonshellable omplex
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
X
40
![Page 42: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/42.jpg)
•
•
•
•
•
•
•
•
•
•
•
•Shellable omplex
•
•
•
•
•
•
•
•
•
•
•
•
Nonshellable omplex
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
X
41
![Page 43: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/43.jpg)
•
•
•
•
•
•
•
•
•
•
•
•Shellable omplex
•
•
•
•
•
•
•
•
•
•
•
•
Nonshellable omplex
• µ(σ,τ ) equals redu ed Euler hara teristi of ∆((σ,τ ))
•
A shellable omplex is homotopi ally a wedge of spheres.
•
Its redu ed Euler hara teristi is the number of spheres.
•
It has nontrivial homology at most in the top dimension.
42
![Page 44: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/44.jpg)
Jason Smith (2014)
Theorem: If σ and τ have the same number of des ents,
then
µ(σ, τ) = (−1)|τ |−|σ|N(σ, τ),
where N(σ, τ) is the number of normal o urren es of σ in τ .
Therefore,
|µ(σ, τ)| 6 σ(τ),
where σ(τ) is the number of o urren es of σ in τ .
And, the interval [σ, τ ] is shellable.
Proof: Bije t to subword order and use Björner's results
(1988).
43
![Page 45: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/45.jpg)
Jason Smith (2014)
Theorem: If σ and τ have the same number of des ents,
then
µ(σ, τ) = (−1)|τ |−|σ|N(σ, τ),
where N(σ, τ) is the number of normal o urren es of σ in τ .
Therefore,
|µ(σ, τ)| 6 σ(τ),
where σ(τ) is the number of o urren es of σ in τ .
And, the interval [σ, τ ] is shellable.
Theorem: Let π be any permutation with a segment of
three onse utive numbers in de reasing or in reasing order.
Then µ(1,π) = 0.
44
![Page 46: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/46.jpg)
Jason Smith (2014)
Theorem: If σ and τ have the same number of des ents,
then
µ(σ, τ) = (−1)|τ |−|σ|N(σ, τ),
where N(σ, τ) is the number of normal o urren es of σ in τ .
Therefore,
|µ(σ, τ)| 6 σ(τ),
where σ(τ) is the number of o urren es of σ in τ .
And, the interval [σ, τ ] is shellable.
Theorem: Let π be any permutation with a segment of
three onse utive numbers in de reasing or in reasing order.
Then µ(1,π) = 0.
µ(1, 71654823) = 0
45
![Page 47: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/47.jpg)
Jason Smith (2014)
Theorem: If σ and τ have the same number of des ents,
then
µ(σ, τ) = (−1)|τ |−|σ|N(σ, τ),
where N(σ, τ) is the number of normal o urren es of σ in τ .
Therefore,
|µ(σ, τ)| 6 σ(τ),
where σ(τ) is the number of o urren es of σ in τ .
And, the interval [σ, τ ] is shellable.
Theorem: Let π be any permutation with a segment of
three onse utive numbers in de reasing or in reasing order.
Then µ(1,π) = 0.
In fa t, the interval [1,π] is ontra tible.
46
![Page 48: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/48.jpg)
Jason Smith (2014)
Theorem: If σ and τ have the same number of des ents,
then
µ(σ, τ) = (−1)|τ |−|σ|N(σ, τ),
where N(σ, τ) is the number of normal o urren es of σ in τ .
Therefore,
|µ(σ, τ)| 6 σ(τ),
where σ(τ) is the number of o urren es of σ in τ .
And, the interval [σ, τ ] is shellable.
There are results/ onje tures analogous to the above for
the layered and separable permutations.
47
![Page 49: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/49.jpg)
Sagan-Vatter (2005): Möbius fun tion for layered permutations
48
![Page 50: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/50.jpg)
Sagan-Vatter (2005): Möbius fun tion for layered permutations
3 2 1 5 4 6 8 7
49
![Page 51: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/51.jpg)
Sagan-Vatter (2005): Möbius fun tion for layered permutations
3 2 1 5 4 6 8 7
50
![Page 52: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/52.jpg)
Sagan-Vatter (2005): Möbius fun tion for layered permutations
3 2 1 5 4 6 8 7
A layered permutation is a on atenation of de reasing se-
quen es, ea h smaller than the next.
51
![Page 53: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/53.jpg)
Sagan-Vatter (2005): Möbius fun tion for layered permutations
•
•
•
•
•
•
•
•
3 2 1 5 4 6 8 7
A layered permutation is a on atenation of de reasing se-
quen es, ea h smaller than the next.
52
![Page 54: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/54.jpg)
Sagan-Vatter (2005): Möbius fun tion for layered permutations
•
•
•
•
•
•
•
•
3 2 1 5 4 6 8 7
53
![Page 55: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/55.jpg)
Sagan-Vatter (2005): Möbius fun tion for layered permutations
•
•
•
•
•
•
•
•
3 2 1 5 4 6 8 7
(Any subsequen e of a layered permutation is layered)
54
![Page 56: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/56.jpg)
Sagan-Vatter (2005): Möbius fun tion for layered permutations
•
•
•
•
•
•
•
•
3 2 1 5 4 6 8 7
An e�e tive formula, but too long to �t inside these margins . . .
55
![Page 57: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/57.jpg)
Sagan-Vatter (2005): Möbius fun tion for layered permutations
•
•
•
•
•
•
•
•
3 2 1 5 4 6 8 7
An e�e tive formula, but too long to �t inside these margins . . .
(Similar to permutations with �xed number of des ents)
56
![Page 58: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/58.jpg)
Sagan-Vatter (2005): Möbius fun tion for layered permutations
•
•
•
•
•
•
•
•
3 2 1 5 4 6 8 7
A spe ial ase of the separable permutations.
57
![Page 59: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/59.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
58
![Page 60: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/60.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
59
![Page 61: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/61.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
A de omposable permutation
is a dire t sum
42351786 = 42351⊕ 231
60
![Page 62: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/62.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
A de omposable permutation
is a dire t sum
42351786 = 42351⊕ 231A skew-de omposable
permutation is a skew sum
76841325 = 213⊖ 41325
61
![Page 63: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/63.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
62
![Page 64: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/64.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
63
![Page 65: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/65.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
64
![Page 66: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/66.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
65
![Page 67: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/67.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
66
![Page 68: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/68.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
67
![Page 69: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/69.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
68
![Page 70: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/70.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•Separable
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
69
![Page 71: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/71.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•Separable
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
De omposes by skew/dire t
sums into singletons
70
![Page 72: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/72.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•Separable
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
De omposes by skew/dire t
sums into singletons
A permutation is separable if
and only if it avoids the pat-
terns 2413 and 3142.
71
![Page 73: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/73.jpg)
4 2 3 5 1 7 8 6
•
•
•
•
•
•
•
•Separable
A permutation is separable if
it an be generated from 1 by
dire t sums and skew sums.
De omposes by skew/dire t
sums into singletons
A permutation is separable if
and only if it avoids the pat-
terns 2413 and 3142.
2 4 1 3
•
•
•
•
Not separable
72
![Page 74: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/74.jpg)
Burstein, Jelínek, Jelínková, Steingrímsson:
Theorem: If σ and τ are separable permutations, then
µ(σ,τ ) =∑
X∈OP
(�1)parity(X)
where the sum is over unpaired o urren es of σ in τ .
73
![Page 75: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/75.jpg)
Burstein, Jelínek, Jelínková, Steingrímsson:
Theorem: If σ and τ are separable permutations, then
µ(σ,τ ) =∑
X∈OP
(�1)parity(X)
where the sum is over unpaired o urren es of σ in τ .
74
![Page 76: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/76.jpg)
Nan Li −→ L
Bru e Sagan −→ S
75
![Page 77: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/77.jpg)
Nan Li −→ L
Bru e Sagan −→ S
E. Babson, A. Björner, L, V. Welker, J. Shareshian
76
![Page 78: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/78.jpg)
Nan Li −→ L
Bru e Sagan −→ S
77
![Page 79: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/79.jpg)
Nan Li −→ L
Bru e Sagan −→ S
Lou Billera −→ B
78
![Page 80: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/80.jpg)
Nan Li −→ L
Bru e Sagan −→ S
Lou Billera −→ B
Mi helle Wa hs −→ MW
79
![Page 81: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/81.jpg)
Nan Li −→ L
Bru e Sagan −→ S
Lou Billera −→ B
Mi helle Wa hs −→ MW
Peter M Namara −→ M N
80
![Page 82: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/82.jpg)
Nan Li −→ L
Bru e Sagan −→ S
Lou Billera −→ B
Mi helle Wa hs −→ MW
Peter M Namara −→ M N
Abbreviating your last name to a single letter implies every-
body should remember your name.
81
![Page 83: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/83.jpg)
Nan Li −→ L
Bru e Sagan −→ S
Lou Billera −→ B
Mi helle Wa hs −→ MW
Peter M Namara −→ M N
Abbreviating your last name to a single letter implies every-
body should remember your name.
Let's put an end to this immodesty!
82
![Page 84: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/84.jpg)
Nan Li −→ L
Bru e Sagan −→ S
Lou Billera −→ B
Mi helle Wa hs −→ MW
Peter M Namara −→ M N
Abbreviating your last name to a single letter implies every-
body should remember your name.
Let's put an end to this immodesty!
(Unless your name is Central Shipyard, in whi h ase you
may be forgiven)
83
![Page 85: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/85.jpg)
Burstein, Jelínek, Jelínková, Steingrímsson:
Theorem: If σ and τ are separable permutations, then
µ(σ,τ ) =∑
X∈OP
(�1)parity(X)
where the sum is over unpaired o urren es of σ in τ .
84
![Page 86: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/86.jpg)
Burstein, Jelínek, Jelínková, Steingrímsson:
Theorem: If σ and τ are separable permutations, then
µ(σ,τ ) =∑
X∈OP
(�1)parity(X)
where the sum is over unpaired o urren es of σ in τ .
(This omputes µ(σ,τ ) in polynomial time)
85
![Page 87: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/87.jpg)
Burstein, Jelínek, Jelínková, Steingrímsson:
Theorem: If σ and τ are separable permutations, then
µ(σ,τ ) =∑
X∈OP
(�1)parity(X)
where the sum is over unpaired o urren es of σ in τ .
Corollary: If σ and τ are separable then
|µ(σ,τ )| 6 σ(τ )
where σ(τ ) is the number of o urren es of σ in τ .
86
![Page 88: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/88.jpg)
Burstein, Jelínek, Jelínková, Steingrímsson:
Theorem: If σ and τ are separable permutations, then
µ(σ,τ ) =∑
X∈OP
(�1)parity(X)
where the sum is over unpaired o urren es of σ in τ .
Corollary: If σ and τ are separable then
|µ(σ,τ )| 6 σ(τ )
where σ(τ ) is the number of o urren es of σ in τ .
(A generalization of a onje ture of Tenner and Steingríms-
son)
87
![Page 89: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/89.jpg)
Burstein, Jelínek, Jelínková, Steingrímsson:
Theorem: If σ and τ are separable permutations, then
µ(σ,τ ) =∑
X∈OP
(�1)parity(X)
where the sum is over unpaired o urren es of σ in τ .
Corollary: If σ and τ are separable then
|µ(σ,τ )| 6 σ(τ )
where σ(τ ) is the number of o urren es of σ in τ .
µ(135 . . . (2k-1) (2k) . . .42,135 . . . (2n-1) (2n) . . .42) =(n+k−1n−k
)
88
![Page 90: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/90.jpg)
Burstein, Jelínek, Jelínková, Steingrímsson:
Theorem: If σ and τ are separable permutations, then
µ(σ,τ ) =∑
X∈OP
(�1)parity(X)
where the sum is over unpaired o urren es of σ in τ .
Corollary: If σ and τ are separable then
|µ(σ,τ )| 6 σ(τ )
where σ(τ ) is the number of o urren es of σ in τ .
µ(1342, 13578642) =(8/2+4/2−18/2−4/2
)=
(52
)
89
![Page 91: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/91.jpg)
Burstein, Jelínek, Jelínková, Steingrímsson:
Theorem: If σ and τ are separable permutations, then
µ(σ,τ ) =∑
X∈OP
(�1)parity(X)
where the sum is over unpaired o urren es of σ in τ .
Corollary: If σ and τ are separable then
|µ(σ,τ )| 6 σ(τ )
where σ(τ ) is the number of o urren es of σ in τ .
Corollary: If τ is separable, then µ(1, τ) ∈ {0,1,−1}.
90
![Page 92: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/92.jpg)
Burstein, Jelínek, Jelínková, Steingrímsson:
Theorem: If σ and τ are separable permutations, then
µ(σ,τ ) =∑
X∈OP
(�1)parity(X)
where the sum is over unpaired o urren es of σ in τ .
Corollary: If σ and τ are separable then
|µ(σ,τ )| 6 σ(τ )
where σ(τ ) is the number of o urren es of σ in τ .
Corollary: If τ is separable, then µ(1, τ) ∈ {0,1,−1}.
Neither orollary true in general
91
![Page 93: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/93.jpg)
Layered intervals and �xed-des intervals are isomorphi to
two extremes in the Generalized subword order (determined
by a poset P) of Sagan and Vatter.
92
![Page 94: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/94.jpg)
Layered intervals and �xed-des intervals are isomorphi to
two extremes in the Generalized subword order (determined
by a poset P) of Sagan and Vatter.
P anti hain:
1 2 3 4 · · ·• • • • · · ·
1344 6P 113414
1343 66P 113414
93
![Page 95: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/95.jpg)
Layered intervals and �xed-des intervals are isomorphi to
two extremes in the Generalized subword order (determined
by a poset P) of Sagan and Vatter.
P anti hain:
1 2 3 4 · · ·• • • • · · ·
1344 6P 113414
1343 66P 113414
94
![Page 96: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/96.jpg)
Layered intervals and �xed-des intervals are isomorphi to
two extremes in the Generalized subword order (determined
by a poset P) of Sagan and Vatter.
P anti hain:
1 2 3 4 · · ·• • • • · · ·
1344 6P 113414
1343 66P 113414
P hain:
...
• 4
• 3
• 2
• 1
1343 6P 113414
95
![Page 97: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/97.jpg)
Layered intervals and �xed-des intervals are isomorphi to
two extremes in the Generalized subword order (determined
by a poset P) of Sagan and Vatter.
P anti hain:
1 2 3 4 · · ·• • • • · · ·
1344 6P 113414
1343 66P 113414
P hain:
...
• 4
• 3
• 2
• 1
1343 6P 113414 (3 <P 4)
96
![Page 98: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/98.jpg)
Layered intervals and �xed-des intervals are isomorphi to
two extremes in the Generalized subword order (determined
by a poset P) of Sagan and Vatter.
P anti hain:
1 2 3 4 · · ·• • • • · · ·
1344 6P 113414
1343 66P 113414
P hain:
...
• 4
• 3
• 2
• 1
1343 6P 113414
Fixed-des
Layered
97
![Page 99: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/99.jpg)
Layered intervals and �xed-des intervals are isomorphi to
two extremes in the Generalized subword order (determined
by a poset P) of Sagan and Vatter.
P anti hain:
1 2 3 4 · · ·• • • • · · ·
1344 6P 113414
1343 66P 113414
P hain:
...
• 4
• 3
• 2
• 1
1343 6P 113414
Fixed-des
Layered
Is there a family of intervals of permutations interpolating
between these two extremes (that are shellable, or at least
with a tra table Möbius fun tion)?
98
![Page 100: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/100.jpg)
M Namara-Steingrímsson (reformulation of BJJS):
Theorem: Let τ = τ 1 ⊕ · · · ⊕ τ k be �nest de omposition.
Then
µ(σ,τ ) =∑
σ=σ1⊕...⊕σk
∏
mµ(σm,τm) + ǫm
where ǫm =
1, if σm = ∅ and τm−1 = τm
0, else
99
![Page 101: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/101.jpg)
M Namara-Steingrímsson (reformulation of BJJS):
Theorem: Let τ = τ 1 ⊕ · · · ⊕ τ k be �nest de omposition.
Then
µ(σ,τ ) =∑
σ=σ1⊕...⊕σk
∏
mµ(σm,τm) + ǫm
where ǫm =
1, if σm = ∅ and τm−1 = τm
0, else
Corollary: If σ is inde omposable, then µ(σ, τ) = 0 unless
τ = τ1 ⊕ τ2 ⊕ · · · ⊕ τk or τ = τ1 ⊕ τ2 ⊕ · · · ⊕ τk ⊕ 1.
100
![Page 102: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/102.jpg)
M Namara-Steingrímsson (reformulation of BJJS):
Theorem: Let τ = τ 1 ⊕ · · · ⊕ τ k be �nest de omposition.
Then
µ(σ,τ ) =∑
σ=σ1⊕...⊕σk
∏
mµ(σm,τm) + ǫm
where ǫm =
1, if σm = ∅ and τm−1 = τm
0, else
Corollary: If σ is inde omposable, then µ(σ, τ) = 0 unless
τ = τ1 ⊕ τ2 ⊕ · · · ⊕ τk or τ = τ1 ⊕ τ2 ⊕ · · · ⊕ τk ⊕ 1.
Corollary: If σ = σ1 ⊕ σ2 and τ = τ1 ⊕ τ2 are �nest,
τ1, τ2 > 1 and τ1 6= τ2, then µ(σ, τ) = µ(σ1, τ1) · µ(σ2, τ2).
101
![Page 103: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/103.jpg)
M Namara-Steingrímsson (reformulation of BJJS):
Theorem: Let τ = τ 1 ⊕ · · · ⊕ τ k be �nest de omposition.
Then
µ(σ,τ ) =∑
σ=σ1⊕...⊕σk
∏
mµ(σm,τm) + ǫm
where ǫm =
1, if σm = ∅ and τm−1 = τm
0, else
Corollary: If σ is inde omposable, then µ(σ, τ) = 0 unless
τ = τ1 ⊕ τ2 ⊕ · · · ⊕ τk or τ = τ1 ⊕ τ2 ⊕ · · · ⊕ τk ⊕ 1.
Corollary: If σ = σ1 ⊕ σ2 and τ = τ1 ⊕ τ2 are �nest,
τ1, τ2 > 1 and τ1 6= τ2, then µ(σ, τ) = µ(σ1, τ1) · µ(σ2, τ2).
(only sometimes this is be ause [σ, τ ] is a dire t produ t)
102
![Page 104: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/104.jpg)
M Namara-Steingrímsson (reformulation of BJJS):
Theorem: Let τ = τ 1 ⊕ · · · ⊕ τ k be �nest de omposition.
Then
µ(σ,τ ) =∑
σ=σ1⊕...⊕σk
∏
mµ(σm,τm) + ǫm
where ǫm =
1, if σm = ∅ and τm−1 = τm
0, else
103
![Page 105: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/105.jpg)
M Namara-Steingrímsson (reformulation of BJJS):
Theorem: Let τ = τ 1 ⊕ · · · ⊕ τ k be �nest de omposition.
Then
µ(σ,τ ) =∑
σ=σ1⊕...⊕σk
∏
mµ(σm,τm) + ǫm
where ǫm =
1, if σm = ∅ and τm−1 = τm
0, else
This redu es the omputation of the Möbius fun tion to
inde omposable permutations.
104
![Page 106: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/106.jpg)
M Namara-Steingrímsson (reformulation of BJJS):
Theorem: Let τ = τ 1 ⊕ · · · ⊕ τ k be �nest de omposition.
Then
µ(σ,τ ) =∑
σ=σ1⊕...⊕σk
∏
mµ(σm,τm) + ǫm
where ǫm =
1, if σm = ∅ and τm−1 = τm
0, else
This redu es the omputation of the Möbius fun tion to
inde omposable permutations.
Unfortunately, almost all permutations are inde omposable,
and we have no idea how to deal with them in general . . .
105
![Page 107: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/107.jpg)
M Namara-Steingrímsson (reformulation of BJJS):
Theorem: Let τ = τ 1 ⊕ · · · ⊕ τ k be �nest de omposition.
Then
µ(σ,τ ) =∑
σ=σ1⊕...⊕σk
∏
mµ(σm,τm) + ǫm
where ǫm =
1, if σm = ∅ and τm−1 = τm
0, else
This redu es the omputation of the Möbius fun tion to
inde omposable permutations.
Unfortunately, almost all permutations are inde omposable,
and we have no idea how to deal with them in general . . .
X
106
![Page 108: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/108.jpg)
M Namara-Steingrímsson (reformulation of BJJS):
Theorem: Let τ = τ 1 ⊕ · · · ⊕ τ k be �nest de omposition.
Then
µ(σ,τ ) =∑
σ=σ1⊕...⊕σk
∏
mµ(σm,τm) + ǫm
where ǫm =
1, if σm = ∅ and τm−1 = τm
0, else
This redu es the omputation of the Möbius fun tion to
inde omposable permutations.
Unfortunately, almost all permutations are inde omposable,
and we have no idea how to deal with them in general . . .
X
107
![Page 109: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/109.jpg)
An obstru tion to shellability of an interval is having a dis-
onne ted subinterval of rank at least three.
108
![Page 110: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/110.jpg)
An obstru tion to shellability of an interval is having a dis-
onne ted subinterval of rank at least three.
2136547
215436
3216547 2154367 21543761326547
21437658 14327658 21543768 21543876
215438769A dis onne ted interval of rank 3
109
![Page 111: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/111.jpg)
An obstru tion to shellability of an interval is having a dis-
onne ted subinterval of rank at least three.
2136547
215436
3216547 2154367 21543761326547
21437658 14327658 21543768 21543876
215438769A dis onne ted interval of rank 3
110
![Page 112: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/112.jpg)
An obstru tion to shellability of an interval is having a dis-
onne ted subinterval of rank at least three.
111
![Page 113: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/113.jpg)
An obstru tion to shellability of an interval is having a dis-
onne ted subinterval of rank at least three.
Theorem: Almost every interval has a dis onne ted subin-
terval of rank at least three.
112
![Page 114: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/114.jpg)
An obstru tion to shellability of an interval is having a dis-
onne ted subinterval of rank at least three.
Theorem: Almost every interval has a dis onne ted subin-
terval of rank at least three.
Follows from the Stanley-Wilf onje ture:
The number of permutations avoiding any given
pattern p grows only exponentially.
113
![Page 115: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/115.jpg)
An obstru tion to shellability of an interval is having a dis-
onne ted subinterval of rank at least three.
Theorem: Almost every interval has a dis onne ted subin-
terval of rank at least three.
Follows from the Mar us-Tardos theorem:
The number of permutations avoiding any given
pattern p grows only exponentially.
114
![Page 116: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/116.jpg)
An obstru tion to shellability of an interval is having a dis-
onne ted subinterval of rank at least three.
Theorem: Almost every interval has a dis onne ted subin-
terval of rank at least three.
Follows from the Mar us-Tardos theorem:
The number of permutations avoiding any given
pattern p grows only exponentially.
Thus, almost every interval [σ,τ ] (for τ large enough)
ontains the subintervals [π,π⊕π] and [π,π⊖π] for some
π > 1, one of whi h is dis onne ted.
115
![Page 117: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/117.jpg)
M Namara and Steingrímsson:
Theorem: An interval [σ, τ ] of layered permutations is dis-
onne ted if and only if σ and τ di�er by a repeated layer
of size at least 3.
116
![Page 118: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/118.jpg)
M Namara and Steingrímsson:
Theorem: An interval [σ, τ ] of layered permutations is dis-
onne ted if and only if σ and τ di�er by a repeated layer
of size at least 3.
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
2 1 5 4 3 6 2 1 5 4 3 8 7 6 9
117
![Page 119: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/119.jpg)
M Namara and Steingrímsson:
Theorem: An interval [σ, τ ] of layered permutations is dis-
onne ted if and only if σ and τ di�er by a repeated layer
of size at least 3.
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
2 1 5 4 3 6 2 1 5 4 3 8 7 6 9
118
![Page 120: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/120.jpg)
M Namara and Steingrímsson:
Theorem: An interval [σ, τ ] of layered permutations is dis-
onne ted if and only if σ and τ di�er by a repeated layer
of size at least 3.
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
2 1 5 4 3 6 2 1 5 4 3 8 7 6 9
[215436, 215438769℄ is dis onne ted
119
![Page 121: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/121.jpg)
M Namara and Steingrímsson:
Theorem: An interval [σ, τ ] of layered permutations is dis-
onne ted if and only if σ and τ di�er by a repeated layer
of size at least 3.
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
•
2 1 5 4 3 6 2 1 5 4 3 8 7 6 9
[215436, 215438769℄ is dis onne ted
120
![Page 122: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/122.jpg)
M Namara and Steingrímsson:
Theorem: An interval [σ, τ ] of layered permutations is dis-
onne ted if and only if σ and τ di�er by a repeated layer
of size at least 3.
2136547
215436
3216547 2154367 21543761326547
21437658 14327658 21543768 21543876
215438769[215436, 215438769℄ is dis onne ted
121
![Page 123: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/123.jpg)
M Namara and Steingrímsson:
Theorem: An interval [σ, τ ] of layered permutations is dis-
onne ted if and only if σ and τ di�er by a repeated layer
of size at least 3.
2136547
215436
3216547 2154367 21543761326547
21437658 14327658 21543768 21543876
215438769[215436, 215438769℄ is dis onne ted
122
![Page 124: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/124.jpg)
M Namara and Steingrímsson:
Theorem: An interval [σ, τ ] of layered permutations is dis-
onne ted if and only if σ and τ di�er by a repeated layer
of size at least 3.
123
![Page 125: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/125.jpg)
M Namara and Steingrímsson:
Theorem: An interval [σ, τ ] of layered permutations is dis-
onne ted if and only if σ and τ di�er by a repeated layer
of size at least 3.
Theorem: An interval of layered permutations is shellable
if and only if it has no dis onne ted subintervals of rank 3
or more.
124
![Page 126: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/126.jpg)
M Namara and Steingrímsson:
Theorem: An interval [σ, τ ] of layered permutations is dis-
onne ted if and only if σ and τ di�er by a repeated layer
of size at least 3.
Theorem: An interval of layered permutations is shellable
if and only if it has no dis onne ted subintervals of rank 3
or more.
Conje ture: The same is true of separable permutations.
125
![Page 127: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/127.jpg)
The interval
[123,3416725]
has no non-trivial dis onne ted subintervals, and alternating
Möbius fun tion, but homology in di�erent dimensions.
Betti numbers: 0, 1, 2.
126
![Page 128: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/128.jpg)
Some questions:
•
What proportion of intervals have µ = 0?
127
![Page 129: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/129.jpg)
Some questions:
•
What proportion of intervals have µ = 0? Almost all?
128
![Page 130: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/130.jpg)
Some questions:
•
What proportion of intervals have µ = 0? Almost all?
•
What kinds of intervals exist in P
129
![Page 131: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/131.jpg)
Some questions:
•
What proportion of intervals have µ = 0? Almost all?
•
What kinds of intervals exist in P? Tori?
130
![Page 132: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/132.jpg)
Some questions:
•
What proportion of intervals have µ = 0? Almost all?
•
What kinds of intervals exist in P? Tori?
•
Is there torsion in the homology of any intervals?
131
![Page 133: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/133.jpg)
Some questions:
•
What proportion of intervals have µ = 0? Almost all?
•
What kinds of intervals exist in P? Tori?
•
Is there torsion in the homology of any intervals?
•
Is the rank fun tion of every interval unimodal?
132
![Page 134: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/134.jpg)
Some questions:
•
What proportion of intervals have µ = 0? Almost all?
•
What kinds of intervals exist in P? Tori?
•
Is there torsion in the homology of any intervals?
•
Is the rank fun tion of every interval unimodal?
•
How does max(|µ(1, π)|) grow with the length of π?
133
![Page 135: Themath.mit.edu/conferences/stanley70/Site/Slides/Steingrimsson.pdf · adjacency in a p ermutation is maximal increasing se-quence of letters adjacent in p osition and value: 516](https://reader033.vdocuments.pub/reader033/viewer/2022042212/5eb5a5eb1ba56b1c514c113c/html5/thumbnails/135.jpg)
Thanks, Ri hard!
(and you all ⌣̈)
134