COUNTING SUBWORD PATTERNS IN PERMUTATIONS ARISING AS FLATTENED PARTITIONS OF SETS

Toufik Mansour; Mark Shattuck

doi:10.2298/AADM210223009M

COUNTING SUBWORD PATTERNS IN PERMUTATIONS ARISING AS FLATTENED PARTITIONS OF SETS

Toufik Mansour, Mark Shattuck

Department of Mathematics

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

Abstract

We consider various statistics on the set Fn consisting of the distinct permutations of length n+1 that arise as a flattening of some partition of the same size. In particular, we enumerate members of Fn according to the number of occurrences of three-letter consecutive patterns, considered more broadly in the context of r-partitions.

Original language	English
Pages (from-to)	146-177
Number of pages	32
Journal	Applicable Analysis and Discrete Mathematics
Volume	16
Issue number	1
DOIs	https://doi.org/10.2298/AADM210223009M
State	Published - 2022

Bibliographical note

Publisher Copyright:
© 2022. Applicable Analysis and Discrete Mathematics.All Rights Reserved.

Keywords

Combinatorial statistic
Flattened partition
Kernel method
Pattern avoidance
Subword

ASJC Scopus subject areas

Analysis
Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.2298/AADM210223009M

Cite this

@article{da23363f5b2d4b739e33f58125d25e5d,

title = "COUNTING SUBWORD PATTERNS IN PERMUTATIONS ARISING AS FLATTENED PARTITIONS OF SETS",

abstract = "We consider various statistics on the set Fn consisting of the distinct permutations of length n+1 that arise as a flattening of some partition of the same size. In particular, we enumerate members of Fn according to the number of occurrences of three-letter consecutive patterns, considered more broadly in the context of r-partitions.",

keywords = "Combinatorial statistic, Flattened partition, Kernel method, Pattern avoidance, Subword",

author = "Toufik Mansour and Mark Shattuck",

year = "2022",

doi = "10.2298/AADM210223009M",

language = "English",

volume = "16",

pages = "146--177",

journal = "Applicable Analysis and Discrete Mathematics",

issn = "1452-8630",

publisher = "University of Belgrade",

number = "1",

}

TY - JOUR

T1 - COUNTING SUBWORD PATTERNS IN PERMUTATIONS ARISING AS FLATTENED PARTITIONS OF SETS

AU - Mansour, Toufik

AU - Shattuck, Mark

PY - 2022

Y1 - 2022

N2 - We consider various statistics on the set Fn consisting of the distinct permutations of length n+1 that arise as a flattening of some partition of the same size. In particular, we enumerate members of Fn according to the number of occurrences of three-letter consecutive patterns, considered more broadly in the context of r-partitions.

AB - We consider various statistics on the set Fn consisting of the distinct permutations of length n+1 that arise as a flattening of some partition of the same size. In particular, we enumerate members of Fn according to the number of occurrences of three-letter consecutive patterns, considered more broadly in the context of r-partitions.

KW - Combinatorial statistic

KW - Flattened partition

KW - Kernel method

KW - Pattern avoidance

KW - Subword

UR - https://www.scopus.com/pages/publications/85129904977

U2 - 10.2298/AADM210223009M

DO - 10.2298/AADM210223009M

M3 - Article

AN - SCOPUS:85129904977

SN - 1452-8630

VL - 16

SP - 146

EP - 177

JO - Applicable Analysis and Discrete Mathematics

JF - Applicable Analysis and Discrete Mathematics

IS - 1

ER -

COUNTING SUBWORD PATTERNS IN PERMUTATIONS ARISING AS FLATTENED PARTITIONS OF SETS

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this