Professional Documents
Culture Documents
Sacnasdiazlopez
Sacnasdiazlopez
Sacnasdiazlopez
to them
Alexander Diaz-Lopez
Swarthmore College
Lathisms.org
Pamela Harris
Erik Insko
Mo Omar
Bruce Sagan
Definition
A symmetric group of degree n, denoted by Sn , is the set of all
bijective mappings from the set [n] := {1, 2, . . . , n} to itself.
We can represent the elements of Sn in a variety of ways (one-line
notation, two-line notation, matrices). We will use the one-line
notation.
S3 = {123 132
pb
p6 p
p
6
pb
bp
bp
pb
p
@
p p @pb
pb p
p
bp
p
A
p A p
A
p Apb
p-
p-
p6 p
p
p
p
= 123
= 132
= 231
p-
pb
bp
p p
@
p @
pb
p
p6 pb
p
A
p
p A p
A
p
p Apb
p
p
p
6
bp
@
p
p @bp
p
@
p
p
p @pb
p-
= 213
p-
= 312
pb
= 321
p-
6
p
pb
6
p
pb
pb
p-
= 123
bp
p
@
p p @pb
bp
p
p
p
= 132
p-
Peak sets in Sn
Definition
The peak set of a permutation is the set of peaks in :
P() = {i [n] : i is a peak of }.
Peak sets in Sn
Definition
The peak set of a permutation is the set of peaks in :
P() = {i [n] : i is a peak of }.
Given a subset S [n], we denote the set of all permutations with
peak set S by
P(S; n) = { Sn : P() = S}.
Peak sets in Sn
Definition
The peak set of a permutation is the set of peaks in :
P() = {i [n] : i is a peak of }.
Given a subset S [n], we denote the set of all permutations with
peak set S by
P(S; n) = { Sn : P() = S}.
Question
How many permutations in Sn have a given peak set i.e., what is
the cardinality of P(S; n)?
Example in S3
6
p
pb
p6 p
p
6
pb
bp
bp
pb
p
@
p p @pb
pb p
p
p
bp
A
p A p
A
p Apb
p-
p-
p6 p
p
p
p
= 123
= 132
= 231
p-
pb
bp
p p
@
p @
pb
p
p6 pb
p
A
p
p A p
A
p
p Apb
p
6
bp
p
p
@
p
p @bp
p
@
p
p
p @pb
p-
= 213
p-
= 312
pb
= 321
p-
Peak sets in Sn
Question
How many permutations in Sn have a given peak set?
Peak sets in Sn
Question
How many permutations in Sn have a given peak set?
Peak sets in Sn
Question
How many permutations in Sn have a given peak set?
(Open) Question
What does the 2n|S|1 mean?
Question
What properties does pS (n) have?
(Open) Question
What does the 2n|S|1 mean?
Question
What properties does pS (n) have?
x m
pS (x ) =
( pS )(m)
.
j
j=0
j
computing pS (x ), and
proved that the positivity conjecture holds in several special
cases
computing pS (x ), and
proved that the positivity conjecture holds in several special
cases
In Fall 2015 ...
s
X
`=1
|P(Si` ; q)| +
s
X
`=1
|P(Sbi` ; q)|.
s
X
|P(Si` ; q)| +
`=1
s
X
|P(Sbi` ; q)|.
`=1
s
X
`=1
pSi` (x ) +
s
X
`=1
s
X
`=1
s
X
`=1
pbS (x ).
i`
Main Result
pS (x ) =
X
j=0
x m
( pS )(m)
j
Current work
p
6
pb
p6 p
p
6
pb
bp
bp
pb
p
@
p p @pb
pb p
p
bp
p
A
p A p
A
p Apb
p-
p-
= 123
p
p
= 231
p-
pb
bp
p p
@
p @
pb
p
p6 pb
p
A
p
p A p
A
p
p Apb
p
p
p
6
bp
@
p
p @bp
p
@
p
p
p @pb
p-
p6 p
p
= 132
= 213
p-
= 312
pb
= 321
p-
Other projects
n vertices.
Joint with Harris, Insko, Sagan:
Find a combinatorial interpretation for the coefficients of
Thanks!