Packing patterns into words

Alexander Burstein; Peter Hästö; Toufik Mansour

doi:10.37236/1692

Packing patterns into words

Alexander Burstein, Peter Hästö, Toufik Mansour

Department of Mathematics

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

Abstract

In this article we generalize packing density problems from permutations to patterns with repeated letters and generalized patterns. We are able to find the packing density for some classes of patterns and several other short patterns.

Original language	English
Journal	Electronic Journal of Combinatorics
Volume	9
Issue number	2 R
DOIs	https://doi.org/10.37236/1692
State	Published - 20 Nov 2003

ASJC Scopus subject areas

Theoretical Computer Science
Geometry and Topology
Discrete Mathematics and Combinatorics
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.37236/1692

Cite this

@article{d45c74524a594ed394423bdc96ad1612,

title = "Packing patterns into words",

abstract = "In this article we generalize packing density problems from permutations to patterns with repeated letters and generalized patterns. We are able to find the packing density for some classes of patterns and several other short patterns.",

author = "Alexander Burstein and Peter H{\"a}st{\"o} and Toufik Mansour",

year = "2003",

month = nov,

day = "20",

doi = "10.37236/1692",

language = "English",

volume = "9",

journal = "Electronic Journal of Combinatorics",

issn = "1077-8926",

publisher = "Electronic Journal of Combinatorics",

number = "2 R",

}

TY - JOUR

T1 - Packing patterns into words

AU - Burstein, Alexander

AU - Hästö, Peter

AU - Mansour, Toufik

PY - 2003/11/20

Y1 - 2003/11/20

N2 - In this article we generalize packing density problems from permutations to patterns with repeated letters and generalized patterns. We are able to find the packing density for some classes of patterns and several other short patterns.

AB - In this article we generalize packing density problems from permutations to patterns with repeated letters and generalized patterns. We are able to find the packing density for some classes of patterns and several other short patterns.

UR - http://www.scopus.com/inward/record.url?scp=3042668957&partnerID=8YFLogxK

U2 - 10.37236/1692

DO - 10.37236/1692

M3 - Article

AN - SCOPUS:3042668957

SN - 1077-8926

VL - 9

JO - Electronic Journal of Combinatorics

JF - Electronic Journal of Combinatorics

IS - 2 R

ER -

Packing patterns into words

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this