Interval Avoidance in the Symmetric Group Isaiah Lankham UC Davis - - PowerPoint PPT Presentation

interval avoidance in the symmetric group
SMART_READER_LITE
LIVE PREVIEW

Interval Avoidance in the Symmetric Group Isaiah Lankham UC Davis - - PowerPoint PPT Presentation

Interval Avoidance in the Symmetric Group Isaiah Lankham UC Davis Fourth International Conference on Permutation Patterns Reykjav k University June 16, 2006 (joint work with Alexander Woo, UC Davis) Permutation Embeddings Interval


slide-1
SLIDE 1

Interval Avoidance in the Symmetric Group

Isaiah Lankham

UC Davis Fourth International Conference on Permutation Patterns Reykjav´ ık University June 16, 2006 (joint work with Alexander Woo, UC Davis)

slide-2
SLIDE 2

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Permutation Embeddings

Definition (Embedding of pattern π into σ) Given π = π1π2 · · · πm ∈ Sm and σ = σ1σ2 · · · σn ∈ Sn, an embedding is a choice of indices i1 < i2 < · · · < im such that σij < σik if and only if πj < πk for each j, k = 1, 2, . . . , m:

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-3
SLIDE 3

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Permutation Embeddings

Definition (Embedding of pattern π into σ) Given π = π1π2 · · · πm ∈ Sm and σ = σ1σ2 · · · σn ∈ Sn, an embedding is a choice of indices i1 < i2 < · · · < im such that σij < σik if and only if πj < πk for each j, k = 1, 2, . . . , m: σ1 · · · σi1 · · · σi2 · · · σi3 · · · σi4 · · · σim−1 · · · σim · · · σn

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-4
SLIDE 4

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Permutation Embeddings

Definition (Embedding of pattern π into σ) Given π = π1π2 · · · πm ∈ Sm and σ = σ1σ2 · · · σn ∈ Sn, an embedding is a choice of indices i1 < i2 < · · · < im such that σij < σik if and only if πj < πk for each j, k = 1, 2, . . . , m: σ1 · · · σi1 · · · σi2 · · · σi3 · · · σi4 · · · σim−1 · · · σim

  • σi1 · · · σim order-isomorphic to π

· · · σn

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-5
SLIDE 5

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Permutation Embeddings

Definition (Embedding of pattern π into σ) Given π = π1π2 · · · πm ∈ Sm and σ = σ1σ2 · · · σn ∈ Sn, an embedding is a choice of indices i1 < i2 < · · · < im such that σij < σik if and only if πj < πk for each j, k = 1, 2, . . . , m: σ1 · · · σi1 · · · σi2 · · · σi3 · · · σi4 · · · σim−1 · · · σim

  • σi1 · · · σim order-isomorphic to π

· · · σn

  • Example. (1, 3, 4, 6) is an embedding of 3412 into 426153.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-6
SLIDE 6

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Permutation Embeddings

Definition (Embedding of pattern π into σ) Given π = π1π2 · · · πm ∈ Sm and σ = σ1σ2 · · · σn ∈ Sn, an embedding is a choice of indices i1 < i2 < · · · < im such that σij < σik if and only if πj < πk for each j, k = 1, 2, . . . , m: σ1 · · · σi1 · · · σi2 · · · σi3 · · · σi4 · · · σim−1 · · · σim

  • σi1 · · · σim order-isomorphic to π

· · · σn

  • Example. (1, 3, 4, 6) is an embedding of 3412 into 426153.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-7
SLIDE 7

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Permutation Embeddings

Definition (Embedding of pattern π into σ) Given π = π1π2 · · · πm ∈ Sm and σ = σ1σ2 · · · σn ∈ Sn, an embedding is a choice of indices i1 < i2 < · · · < im such that σij < σik if and only if πj < πk for each j, k = 1, 2, . . . , m: σ1 · · · σi1 · · · σi2 · · · σi3 · · · σi4 · · · σim−1 · · · σim

  • σi1 · · · σim order-isomorphic to π

· · · σn

  • Example. (1, 3, 4, 6) is an embedding of 3412 into 426153.

Notation (Avoidance Set for a pattern π) Sn(π) = {σ ∈ Sn | σ does not contain an embedding of π}

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-8
SLIDE 8

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ}

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-9
SLIDE 9

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{ }

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-10
SLIDE 10

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2) }

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-11
SLIDE 11

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4) }

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-12
SLIDE 12

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6) }

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-13
SLIDE 13

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4) }

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-14
SLIDE 14

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4) }

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-15
SLIDE 15

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5) }

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-16
SLIDE 16

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6) }

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-17
SLIDE 17

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)}

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-18
SLIDE 18

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-19
SLIDE 19

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-20
SLIDE 20

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-21
SLIDE 21

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-22
SLIDE 22

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻ 3142

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-23
SLIDE 23

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻ 3142

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-24
SLIDE 24

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻ 3142

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-25
SLIDE 25

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻ 3142 ≻

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-26
SLIDE 26

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻ 3142 ≻ 3124

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-27
SLIDE 27

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻ 3142 ≻ 3124

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-28
SLIDE 28

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻ 3142 ≻ 3124

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-29
SLIDE 29

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻ 3142 ≻ 3124 ≻

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-30
SLIDE 30

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻ 3142 ≻ 3124 ≻ 1324

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-31
SLIDE 31

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

The (Strong) Bruhat Order

Definition (Inversion in σ ∈ Sn) An inversion is an embedding of the pattern 21 ∈ S2 into σ. Definition (Length Function on Sn) ℓ(σ) = #{ indices (i1, i2) | (i1, i2) is an inversion in σ} Example: ℓ(426153) = #{(1, 2), (1, 4), (1, 6), (2, 4), (3, 4), (3, 5), (3, 6), (5, 6)} Definition (Bruhat order on Sn) We say τ > σ in Bruhat order if τ can be transformed into σ by successively “undoing” inversions.

  • Example. 3412 > 1324:

3412 ≻ 3142 ≻ 3124 ≻ 1324

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-32
SLIDE 32

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Bruhat Covering Relation

Definition (Bruhat covering relation on Sn) We say σ ≺ τ in Bruhat order if σ = τt for some transposition t ℓ(σ) = ℓ(τ) − 1 Equivalently: use transposition t to “undo” an embedding of 21 at positions i < k in τ such that ∄ index j for which i < j < k and τi > τj > τk:

  • (i, τi)

(k, τk)

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-33
SLIDE 33

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Symmetry Properties of Bruhat Order

Lemma (Bruhat order symmetries for σ, τ ∈ Sn) (Inverses) σ < τ = ⇒ σ−1 < τ −1 (Reverse) σ < τ = ⇒ τ r < σr (Complement) σ < τ = ⇒ τ c < σc (Reverse Complement) σ < τ = ⇒ σrc < τ rc Examples: Starting with 1324 < 2341, 1324−1 = 1324 < 4123 = 2341−1. 2341r = 1432 < 4231 = 1324r. 2341c = 3214 < 4231 = 1324c. 1324rc = 1324 < 4123 = 2341rc.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-34
SLIDE 34

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Intervals in Bruhat Order

Definition (Intervals in Bruhat order) Given σ, τ ∈ Sn, [σ, τ] = {ω ∈ Sn | σ ≤ ω ≤ τ}.

  • Example. [1324, 2341]:

1234 1243 1324 1324 2134 1423 1342 1342 2143 3124 2314 2314 4123 1432 2413 3142 2341 2341 3214 4132 4213 3412 2431 3241 4312 4231 3421 4321 4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-35
SLIDE 35

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Embeddings Intervals into Larger Intervals

Definition (Interval Embedding) Given π ≤ ρ ∈ Sm and σ ≤ τ ∈ Sn with m ≤ n, we say that [π, ρ] embeds into [σ, τ] if π embeds into σ ρ embeds into τ

  • using same embedding (i1, i2, . . . , im)

the intervals [π, ρ] and [σ, τ] are order-isomorphic.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-36
SLIDE 36

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Embeddings Intervals into Larger Intervals

Definition (Interval Embedding) Given π ≤ ρ ∈ Sm and σ ≤ τ ∈ Sn with m ≤ n, we say that [π, ρ] embeds into [σ, τ] if π embeds into σ ρ embeds into τ

  • using same embedding (i1, i2, . . . , im)

the intervals [π, ρ] and [σ, τ] are order-isomorphic.

  • Example. [123, 231] embeds into [1324, 2341]:

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-37
SLIDE 37

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Embeddings Intervals into Larger Intervals

Definition (Interval Embedding) Given π ≤ ρ ∈ Sm and σ ≤ τ ∈ Sn with m ≤ n, we say that [π, ρ] embeds into [σ, τ] if π embeds into σ ρ embeds into τ

  • using same embedding (i1, i2, . . . , im)

the intervals [π, ρ] and [σ, τ] are order-isomorphic.

  • Example. [123, 231] embeds into [1324, 2341]:

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-38
SLIDE 38

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Embeddings Intervals into Larger Intervals

Definition (Interval Embedding) Given π ≤ ρ ∈ Sm and σ ≤ τ ∈ Sn with m ≤ n, we say that [π, ρ] embeds into [σ, τ] if π embeds into σ ρ embeds into τ

  • using same embedding (i1, i2, . . . , im)

the intervals [π, ρ] and [σ, τ] are order-isomorphic.

  • Example. [123, 231] embeds into [1324, 2341]:

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-39
SLIDE 39

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Embeddings Intervals into Larger Intervals

Definition (Interval Embedding) Given π ≤ ρ ∈ Sm and σ ≤ τ ∈ Sn with m ≤ n, we say that [π, ρ] embeds into [σ, τ] if π embeds into σ ρ embeds into τ

  • using same embedding (i1, i2, . . . , im)

the intervals [π, ρ] and [σ, τ] are order-isomorphic.

  • Example. [123, 231] embeds into [1324, 2341]:

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-40
SLIDE 40

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Embeddings Intervals into Larger Intervals

Definition (Interval Embedding) Given π ≤ ρ ∈ Sm and σ ≤ τ ∈ Sn with m ≤ n, we say that [π, ρ] embeds into [σ, τ] if π embeds into σ ρ embeds into τ

  • using same embedding (i1, i2, . . . , im)

the intervals [π, ρ] and [σ, τ] are order-isomorphic.

  • Example. [123, 231] embeds into [1324, 2341]:

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-41
SLIDE 41

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Embeddings Intervals into Larger Intervals

Definition (Interval Embedding) Given π ≤ ρ ∈ Sm and σ ≤ τ ∈ Sn with m ≤ n, we say that [π, ρ] embeds into [σ, τ] if π embeds into σ ρ embeds into τ

  • using same embedding (i1, i2, . . . , im)

the intervals [π, ρ] and [σ, τ] are order-isomorphic.

  • Example. [123, 231] embeds into [1324, 2341]:

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-42
SLIDE 42

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Embeddings Intervals into Larger Intervals

Definition (Interval Embedding) Given π ≤ ρ ∈ Sm and σ ≤ τ ∈ Sn with m ≤ n, we say that [π, ρ] embeds into [σ, τ] if π embeds into σ ρ embeds into τ

  • using same embedding (i1, i2, . . . , im)

the intervals [π, ρ] and [σ, τ] are order-isomorphic.

  • Example. [123, 231] embeds into [1324, 2341]:

123 132 213 231 312 321

1234 1243 1324 2134 1423 1342 2143 3124 2314 4123 1432 2413 3142 2341 3214 4132 4213 3412 2431 3241 4312 4231 3421 4321 4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-43
SLIDE 43

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Embeddings Intervals into Larger Intervals

Definition (Interval Embedding) Given π ≤ ρ ∈ Sm and σ ≤ τ ∈ Sn with m ≤ n, we say that [π, ρ] embeds into [σ, τ] if π embeds into σ ρ embeds into τ

  • using same embedding (i1, i2, . . . , im)

the intervals [π, ρ] and [σ, τ] are order-isomorphic.

  • Example. [123, 231] embeds into [1324, 2341]:

123 132 213 231 312 321

1234 1243 1324 2134 1423 1342 2143 3124 2314 4123 1432 2413 3142 2341 3214 4132 4213 3412 2431 3241 4312 4231 3421 4321 4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-44
SLIDE 44

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

An Equivalent Definition of Interval Embeddings

Lemma (Interval Embedding Characterization) Given π ≤ ρ ∈ Sm and σ ≤ τ ∈ Sn with m ≤ n, the interval [π, ρ] embeds into [σ, τ] iff σi = τi for i / ∈ {i1, i2, . . . , im} (a common embedding) ℓ(τ) − ℓ(σ) = ℓ(ρ) − ℓ(π) Corollary Given any three of the permutations π, ρ, σ, and τ, the fourth is uniquely determine. Definition (Avoidance Set for an Interval) Sn([π, ρ]) = {τ ∈ Sn | ∀σ ∈ Sn, [π, ρ] doesn’t embed into [σ, τ]}.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-45
SLIDE 45

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Interval Embeddings & Avoidance

Examples: If π = ρ, then Sn([π, ρ]) = Sn(ρ) since the intervals [π, ρ] = {ρ} and [σ, τ] = {τ} are trivially order-isomorphic. 43512 “contains” [1324, 3412] because the interval [1324, 3412] embeds into [41325, 43512]: ℓ(43512) − ℓ(41325) = 7 − 4 = 4 − 1 = ℓ(3412) − ℓ(1324) 426153 ∈ Sn([1324, 3412]) because the interval [1324, 3412] cannot embed into [124356, 426153]: ℓ(426153)−ℓ(124356) = 8−1 > 4−1 = ℓ(3412)−ℓ(1324) “Universal” in characterizing singularities of Schubert varieties (A. Woo and A. Yong).

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-46
SLIDE 46

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-47
SLIDE 47

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-48
SLIDE 48

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]:

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-49
SLIDE 49

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-50
SLIDE 50

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-51
SLIDE 51

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-52
SLIDE 52

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-53
SLIDE 53

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-54
SLIDE 54

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-55
SLIDE 55

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-56
SLIDE 56

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-57
SLIDE 57

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-58
SLIDE 58

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-59
SLIDE 59

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-60
SLIDE 60

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-61
SLIDE 61

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-62
SLIDE 62

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-63
SLIDE 63

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-64
SLIDE 64

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-65
SLIDE 65

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-66
SLIDE 66

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-67
SLIDE 67

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-68
SLIDE 68

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-69
SLIDE 69

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

A Geometric Form for Interval Pattern Containment

Algorithm (Forbidden Region for π ≤ ρ) Graph π as circles, ρ as dots. Connect point horizontally. Connect point vertically toward π. Shade between closest vertical “left-side down” and “right-side up” pairs of lines. For [2143, 4231]: 1 2 3 4 1 2 3 4

  • Lemma

Then a permutation τ ∈ Sn “contains” [π, ρ] iff the forbidden region constructed above contains no “non-embedding” points.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-70
SLIDE 70

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Forbidden Regions

Examples: 43512 “contains” [1324, 3412] because the Forbidden Region contains no “non-embedding” points. 426153 ∈ Sn([1324, 3412]) because the Forbidden Region contains “non-embedding” points. 0 1 2 3 4 5 1 2 3 4 5

  • 0 1 2 3 4 5 6

1 2 3 4 5 6

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-71
SLIDE 71

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]:

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-72
SLIDE 72

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-73
SLIDE 73

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-74
SLIDE 74

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-75
SLIDE 75

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-76
SLIDE 76

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-77
SLIDE 77

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-78
SLIDE 78

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-79
SLIDE 79

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-80
SLIDE 80

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-81
SLIDE 81

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-82
SLIDE 82

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-83
SLIDE 83

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-84
SLIDE 84

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-85
SLIDE 85

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-86
SLIDE 86

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-87
SLIDE 87

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-88
SLIDE 88

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-89
SLIDE 89

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-90
SLIDE 90

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-91
SLIDE 91

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-92
SLIDE 92

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-93
SLIDE 93

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-94
SLIDE 94

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-95
SLIDE 95

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-96
SLIDE 96

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-97
SLIDE 97

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-98
SLIDE 98

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-99
SLIDE 99

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-100
SLIDE 100

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-101
SLIDE 101

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-102
SLIDE 102

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-103
SLIDE 103

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-104
SLIDE 104

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-105
SLIDE 105

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-106
SLIDE 106

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-107
SLIDE 107

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-108
SLIDE 108

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-109
SLIDE 109

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-110
SLIDE 110

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-111
SLIDE 111

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-112
SLIDE 112

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-113
SLIDE 113

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-114
SLIDE 114

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-115
SLIDE 115

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-116
SLIDE 116

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-117
SLIDE 117

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Strange Forbidden Regions

For [1324, 4231]: 1 2 3 4 1 2 3 4

  • For [3412, 4321]:

1 2 3 4 1 2 3 4

  • For [123, 321]:

1 2 3 1 2 3

  • 4th International Conference on Permutation Patterns

Interval Avoidance in the Symmetric Group

slide-118
SLIDE 118

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Familiar Forbidden Regions (I)

For Sn([2143, 3142]): 1 2 3 4 1 2 3 4

  • 1

2 3 4 1 2 3 4

  • Remark. It follows that Sn([2143, 3142]) = Sn(21¯

354), which characterizes Planar Permutations. Similarly, Sn(21¯ 354, 1324) = Sn([2143, 3142], [1324, 1324]).

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-119
SLIDE 119

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Familiar Forbidden Regions (II)

For Sn([2143, 2413]): 1 2 3 4 1 2 3 4

  • 1

2 3 4 1 2 3 4

  • Remark. It follows that Sn([2143, 2413]) = Sn(25¯

314), which characterizes Baxter Permutations as Sn(41¯ 352, 25¯ 314) = Sn([2143, 3142], [2143, 2413]).

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-120
SLIDE 120

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Familiar Forbidden Regions (III)

For Sn([3142, 3412]): 1 2 3 4 1 2 3 4

  • 1

2 3 4 1 2 3 4

  • Remark. It follows that Sn([3142, 3412]) = Sn(45¯

312), which characterizes Twisted Baxter Permutations as Sn(45¯ 312, 25¯ 314) = Sn([3142, 3412], [2143, 2413]).

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-121
SLIDE 121

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Familiar Forbidden Regions (IV)

1 2 3 1 2 3

  • Forbidden region for 3¯

142. This forbidden region cannot be reduced to Interval Avoidance since it is unbounded.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-122
SLIDE 122

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Permutation Embeddings Overview of Bruhat Order Intervals & Embeddings Geometric Interval Embeddings

Examples of Familiar Forbidden Regions (V)

1 2 3 4 1 2 3 4

  • Forbidden region for 3¯

5241. This forbidden region cannot be reduced to Interval Avoidance since it is unbounded.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-123
SLIDE 123

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-124
SLIDE 124

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132])

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-125
SLIDE 125

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc =

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-126
SLIDE 126

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213])

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-127
SLIDE 127

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-128
SLIDE 128

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-129
SLIDE 129

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-130
SLIDE 130

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-131
SLIDE 131

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-132
SLIDE 132

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-133
SLIDE 133

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-134
SLIDE 134

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-135
SLIDE 135

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-136
SLIDE 136

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-137
SLIDE 137

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-138
SLIDE 138

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-139
SLIDE 139

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-140
SLIDE 140

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-141
SLIDE 141

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-142
SLIDE 142

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-143
SLIDE 143

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-144
SLIDE 144

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-145
SLIDE 145

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-146
SLIDE 146

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-147
SLIDE 147

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-148
SLIDE 148

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-149
SLIDE 149

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements: 123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-150
SLIDE 150

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-151
SLIDE 151

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-152
SLIDE 152

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-153
SLIDE 153

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-154
SLIDE 154

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-155
SLIDE 155

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-156
SLIDE 156

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-157
SLIDE 157

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321 Summary (Four Distinct Symmetry Classes)

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-158
SLIDE 158

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321 Summary (Four Distinct Symmetry Classes) Sn([123, 132])

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-159
SLIDE 159

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321 Summary (Four Distinct Symmetry Classes) Sn([123, 132]), Sn([123, 312])

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-160
SLIDE 160

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321 Summary (Four Distinct Symmetry Classes) Sn([123, 132]), Sn([123, 312]), Sn([132, 312])

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-161
SLIDE 161

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Interval Equivalences Using Symmetries

Using inverses and reverse complements:

#Sn([123,132]) rc = #Sn([123,213]) #Sn([123,231]) inv = #Sn([123,312]) #Sn([132,321]) rc = #Sn([213,321]) #Sn([231,321]) inv = #Sn([312,321]) #Sn([132,231]) inv = #Sn([132,312]) rc = #Sn([213,231]) inv = #Sn([213,312])

Using reverses and complements:

#Sn([231,321]) rev = #Sn([123,132])

cmp

= #Sn([312,321])

123 132 213 231 312 321 Summary (Four Distinct Symmetry Classes) Sn([123, 132]), Sn([123, 312]), Sn([132, 312]), Sn([123, 321])

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-162
SLIDE 162

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Main Theorem for Length Three Case

Theorem (L.-Woo) Sn([123, 132]) = Sn(132) Sn([132, 312]) = Sn(312) Sn([123, 312]) = Sn(312) Corollary For π ≤ ρ ∈ S3 and Cn the nth Catalan number, if [π, ρ] = [123, 321], then #Sn([π, ρ]) = #Sn(ρ) = Cn.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-163
SLIDE 163

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Proof for Interval Generated by 123 ≤ 132

1 2 3 1 2 3

  • Forbidden region reduction for [123, 132].

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-164
SLIDE 164

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Proof for Interval Generated by 132 ≤ 312

1 2 3 1 2 3

1 2

  • Forbidden region reduction for [132, 312].

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-165
SLIDE 165

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Proof for Interval Generated by 123 ≤ 312

1 2 3 1 2 3

1 2 3

  • Forbidden region reduction for [123, 312].

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-166
SLIDE 166

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions Using Symmetries of Bruhat Order Main Theorem Avoiding all of S3

Data for Interval Generated by 123 ≤ 321

This interval generates the following forbidden region: 1 2 3 1 2 3

  • The values of #Sn([123, 321]) for n = 1, 2, . . . , 12 are

1, 2, 5, 15, 51, 194, 810, 3675, 17935, 93481, 517129, 3021133.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group

slide-167
SLIDE 167

Interval Avoidance Classification for Length Three Patterns Summary & Further Directions

Summary & Further Directions

Interval avoidance is a very natural (and well-motivated) generalization of classical pattern avoidance. Intervals formed from S3 all reduce to classical avoidance except for [123, 321], which has so far proven elusive. For n ≥ 4, “short” intervals become more subtle. E.g., τ = 53124 contains an embedding of 4123, yet τ ∈ Sn([1423, 4123]) nonetheless. We are also looking at what changes when Strong Bruhat Order is relaxed to Weak Bruhat Order.

4th International Conference on Permutation Patterns Interval Avoidance in the Symmetric Group