Multi-avoidance of generalised patterns

Sergey Kitaev

doi:10.1016/S0012-365X(02)00452-1

Multi-avoidance of generalised patterns

Sergey Kitaev

Research output: Contribution to journal › Article › peer-review

18 Citations (Scopus)

Abstract

Recently, Babson and Steingrı́msson introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We investigate simultaneous avoidance of two or more 3-patterns without internal dashes, that is, where the pattern corresponds to a contiguous subword in a permutation.

Original language	English
Pages (from-to)	89-100
Number of pages	12
Journal	Discrete Mathematics
Volume	260
Issue number	1-3
Early online date	21 Dec 2002
DOIs	https://doi.org/10.1016/S0012-365X(02)00452-1
Publication status	Published - 6 Jan 2003

Keywords

pattern-avoidance
generalised patterns
simultaneous avoidance

Access to Document

10.1016/S0012-365X(02)00452-1

Cite this

@article{933954e0305b479aa1cd62d87a0d94a4,

title = "Multi-avoidance of generalised patterns",

abstract = "Recently, Babson and Steingr{\'ı}msson introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We investigate simultaneous avoidance of two or more 3-patterns without internal dashes, that is, where the pattern corresponds to a contiguous subword in a permutation.",

keywords = "pattern-avoidance, generalised patterns, simultaneous avoidance",

author = "Sergey Kitaev",

year = "2003",

month = jan,

day = "6",

doi = "10.1016/S0012-365X(02)00452-1",

language = "English",

volume = "260",

pages = "89--100",

journal = "Discrete Mathematics",

issn = "0012-365X",

number = "1-3",

}

TY - JOUR

T1 - Multi-avoidance of generalised patterns

AU - Kitaev, Sergey

PY - 2003/1/6

Y1 - 2003/1/6

N2 - Recently, Babson and Steingrı́msson introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We investigate simultaneous avoidance of two or more 3-patterns without internal dashes, that is, where the pattern corresponds to a contiguous subword in a permutation.

AB - Recently, Babson and Steingrı́msson introduced generalised permutation patterns that allow the requirement that two adjacent letters in a pattern must be adjacent in the permutation. We investigate simultaneous avoidance of two or more 3-patterns without internal dashes, that is, where the pattern corresponds to a contiguous subword in a permutation.

KW - pattern-avoidance

KW - generalised patterns

KW - simultaneous avoidance

UR - https://personal.cis.strath.ac.uk/sergey.kitaev/index_files/Papers/multi_avoid.pdf

U2 - 10.1016/S0012-365X(02)00452-1

DO - 10.1016/S0012-365X(02)00452-1

M3 - Article

VL - 260

SP - 89

EP - 100

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -

Multi-avoidance of generalised patterns

Abstract

Keywords

Access to Document

Other files and links

Cite this