Partially ordered patterns and their combinatorial interpretations

Alexander Burstein; Sergey Kitaev

Partially ordered patterns and their combinatorial interpretations

Alexander Burstein, Sergey Kitaev

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

Abstract

This paper is a continuation of the study of partially ordered patterns (POPs) introduced recently. We provide a general approach to code combinatorial objects using (POP-)restricted permutations. We give several examples of relations between permutations restricted by POPs and other combinatorial structures, such as labeled graphs, walks, binary vectors, and others. Also, we show how restricted permutations are related to Cartesian products of certain objects.

Original language	English
Pages (from-to)	27-38
Number of pages	12
Journal	Pure Mathematics and Applications
Volume	19
Issue number	2-3
Publication status	Published - 2008

Keywords

pattern avoidance
segmented patterns
permutations
labeled general graphs
binary vectors
coding

Cite this

@article{b9315729ef1e4a19b4e69d0fb5eb3b75,

title = "Partially ordered patterns and their combinatorial interpretations",

abstract = "This paper is a continuation of the study of partially ordered patterns (POPs) introduced recently. We provide a general approach to code combinatorial objects using (POP-)restricted permutations. We give several examples of relations between permutations restricted by POPs and other combinatorial structures, such as labeled graphs, walks, binary vectors, and others. Also, we show how restricted permutations are related to Cartesian products of certain objects. ",

keywords = "pattern avoidance, segmented patterns, permutations, labeled general graphs, binary vectors, coding",

author = "Alexander Burstein and Sergey Kitaev",

year = "2008",

language = "English",

volume = "19",

pages = "27--38",

journal = "Pure Mathematics and Applications",

issn = "1218-4586",

number = "2-3",

}

TY - JOUR

T1 - Partially ordered patterns and their combinatorial interpretations

AU - Burstein, Alexander

AU - Kitaev, Sergey

PY - 2008

Y1 - 2008

N2 - This paper is a continuation of the study of partially ordered patterns (POPs) introduced recently. We provide a general approach to code combinatorial objects using (POP-)restricted permutations. We give several examples of relations between permutations restricted by POPs and other combinatorial structures, such as labeled graphs, walks, binary vectors, and others. Also, we show how restricted permutations are related to Cartesian products of certain objects.

AB - This paper is a continuation of the study of partially ordered patterns (POPs) introduced recently. We provide a general approach to code combinatorial objects using (POP-)restricted permutations. We give several examples of relations between permutations restricted by POPs and other combinatorial structures, such as labeled graphs, walks, binary vectors, and others. Also, we show how restricted permutations are related to Cartesian products of certain objects.

KW - pattern avoidance

KW - segmented patterns

KW - permutations

KW - labeled general graphs

KW - binary vectors

KW - coding

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

M3 - Article

SN - 1218-4586

VL - 19

SP - 27

EP - 38

JO - Pure Mathematics and Applications

JF - Pure Mathematics and Applications

IS - 2-3

ER -

Partially ordered patterns and their combinatorial interpretations

Abstract

Keywords

Other files and links

Fingerprint

Cite this