Packing (Colored) Patterns in Permutations

Hua Wang

Packing (Colored) Patterns in Permutations

Mathematical Sciences

Research output: Contribution to conference › Presentation

Abstract

It is known that the maximum number of layered patterns is achieved in layered permutations. This general result allows the presentation of such optimal permutations with regard to all patterns of length three and most patterns of length four. When the pattern and permutations are colored, the problem, although still of the same nature, becomes different. We present background information and some preliminary studies on this topic.

Original language	American English
State	Published - Dec 6 2014
Event	Palmetto Number Theory Series (PANTS) - Atlanta, GA Duration: Sep 12 2015 → …

Conference

Conference	Palmetto Number Theory Series (PANTS)
Period	09/12/15 → …

Keywords

Colored permutations
Layered patterns
Layered permutations
Optimal permutations

DC Disciplines

Mathematics

Cite this

@conference{0af991d2c23545d4b133838bfe847f42,

title = "Packing (Colored) Patterns in Permutations",

abstract = " It is known that the maximum number of layered patterns is achieved in layered permutations. This general result allows the presentation of such optimal permutations with regard to all patterns of length three and most patterns of length four. When the pattern and permutations are colored, the problem, although still of the same nature, becomes different. We present background information and some preliminary studies on this topic.",

keywords = "Colored permutations, Layered patterns, Layered permutations, Optimal permutations",

author = "Hua Wang",

year = "2014",

month = dec,

day = "6",

language = "American English",

note = "Palmetto Number Theory Series (PANTS) ; Conference date: 12-09-2015",

}

TY - CONF

T1 - Packing (Colored) Patterns in Permutations

AU - Wang, Hua

PY - 2014/12/6

Y1 - 2014/12/6

N2 - It is known that the maximum number of layered patterns is achieved in layered permutations. This general result allows the presentation of such optimal permutations with regard to all patterns of length three and most patterns of length four. When the pattern and permutations are colored, the problem, although still of the same nature, becomes different. We present background information and some preliminary studies on this topic.

AB - It is known that the maximum number of layered patterns is achieved in layered permutations. This general result allows the presentation of such optimal permutations with regard to all patterns of length three and most patterns of length four. When the pattern and permutations are colored, the problem, although still of the same nature, becomes different. We present background information and some preliminary studies on this topic.

KW - Colored permutations

KW - Layered patterns

KW - Layered permutations

KW - Optimal permutations

UR - http://www.math.sc.edu/~filaseta/PANTSXXIIIAbstracts.pdf

M3 - Presentation

T2 - Palmetto Number Theory Series (PANTS)

Y2 - 12 September 2015

ER -

Packing (Colored) Patterns in Permutations

Abstract

Conference

Keywords

DC Disciplines

Other files and links

Fingerprint

Cite this