Multi-avoidance of generalised patterns

Research output: Contribution to journalArticle

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.
LanguageEnglish
Pages89-100
Number of pages12
JournalDiscrete Mathematics
Volume260
Issue number1-3
Early online date21 Dec 2002
DOIs
Publication statusPublished - 6 Jan 2003

Fingerprint

Permutation
Adjacent
Subword
Internal
Requirements

Keywords

  • pattern-avoidance
  • generalised patterns
  • simultaneous avoidance

Cite this

Kitaev, Sergey. / Multi-avoidance of generalised patterns. In: Discrete Mathematics. 2003 ; Vol. 260, No. 1-3. pp. 89-100.
@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 = "1",
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",

}

Multi-avoidance of generalised patterns. / Kitaev, Sergey.

In: Discrete Mathematics, Vol. 260, No. 1-3, 06.01.2003, p. 89-100.

Research output: Contribution to journalArticle

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

T2 - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 1-3

ER -