Pattern Packing: Questions and Observations

Hua Wang

Pattern Packing: Questions and Observations

Mathematical Sciences

Research output: Contribution to conference › Presentation

Abstract

Pattern packing, as opposed to the well-known question of pattern avoidance, aims to include as many as possible of a prescribed pattern in a permutation of given length. In this talk we will present an overview of the study of pattern packing in permutations and its variations such as colored permutations, preferential arrangements, and circular permutations.

Original language	American English
State	Published - Mar 6 2017
Event	Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC) - Duration: Mar 6 2017 → …

Conference

Conference	Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC)
Period	03/6/17 → …

Disciplines

Mathematics
Physical Sciences and Mathematics

Keywords

Pattern Packing
Permutation
Preferential Arrangement

Access to Document

http://www.science.fau.edu/combinatorics/wanghua.pdf

Cite this

@conference{68004e4bc3c44df3b638b9c523531236,

title = "Pattern Packing: Questions and Observations",

abstract = " Pattern packing, as opposed to the well-known question of pattern avoidance, aims to include as many as possible of a prescribed pattern in a permutation of given length. In this talk we will present an overview of the study of pattern packing in permutations and its variations such as colored permutations, preferential arrangements, and circular permutations.",

keywords = "Pattern Packing, Permutation, Preferential Arrangement",

author = "Hua Wang",

year = "2017",

month = mar,

day = "6",

language = "American English",

note = "Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC) ; Conference date: 06-03-2017",

}

TY - CONF

T1 - Pattern Packing: Questions and Observations

AU - Wang, Hua

PY - 2017/3/6

Y1 - 2017/3/6

N2 - Pattern packing, as opposed to the well-known question of pattern avoidance, aims to include as many as possible of a prescribed pattern in a permutation of given length. In this talk we will present an overview of the study of pattern packing in permutations and its variations such as colored permutations, preferential arrangements, and circular permutations.

AB - Pattern packing, as opposed to the well-known question of pattern avoidance, aims to include as many as possible of a prescribed pattern in a permutation of given length. In this talk we will present an overview of the study of pattern packing in permutations and its variations such as colored permutations, preferential arrangements, and circular permutations.

KW - Pattern Packing

KW - Permutation

KW - Preferential Arrangement

UR - https://digitalcommons.georgiasouthern.edu/math-sci-facpres/486

UR - http://www.science.fau.edu/combinatorics/wanghua.pdf

M3 - Presentation

T2 - Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC)

Y2 - 6 March 2017

ER -

Pattern Packing: Questions and Observations

Abstract

Conference

Disciplines

Keywords

Access to Document

Other files and links

Fingerprint

Cite this