PUSHES IN WORDS—A PRIMITIVE SORTING ALGORITHM

M. Archibald; A. Blecher; C. Brennan; A. Knopfmacher; T. Mansour

PUSHES IN WORDS—A PRIMITIVE SORTING ALGORITHM

M. Archibald, A. Blecher, C. Brennan, A. Knopfmacher, T. Mansour

Department of Mathematics

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

Abstract

We define the statistic of a push for words on an alphabet [k] and use this to obtain a generating function measuring the degree to which an arbitrary word deviates from sorted order. Several subsidiary concepts are investigated: the number of cells that are not pushed, the number of already sorted columns, the number of cells that coincide before and after pushing, the fixed cells in words and finally, the frictionless pushes.

Original language	English
Pages (from-to)	56-69
Number of pages	14
Journal	Contributions to Discrete Mathematics
Volume	17
Issue number	1
State	Published - 2022

Bibliographical note

Publisher Copyright:
© 2022 University of Calgary. All rights reserved.

Keywords

asymptotics
generating function
sorting
words

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Cite this

@article{ddf94df8f3014cc6af9a3cb648278212,

title = "PUSHES IN WORDS—A PRIMITIVE SORTING ALGORITHM",

abstract = "We define the statistic of a push for words on an alphabet [k] and use this to obtain a generating function measuring the degree to which an arbitrary word deviates from sorted order. Several subsidiary concepts are investigated: the number of cells that are not pushed, the number of already sorted columns, the number of cells that coincide before and after pushing, the fixed cells in words and finally, the frictionless pushes.",

keywords = "asymptotics, generating function, sorting, words",

author = "M. Archibald and A. Blecher and C. Brennan and A. Knopfmacher and T. Mansour",

year = "2022",

language = "English",

volume = "17",

pages = "56--69",

journal = "Contributions to Discrete Mathematics",

issn = "1715-0868",

publisher = "University of Calgary Press",

number = "1",

}

TY - JOUR

T1 - PUSHES IN WORDS—A PRIMITIVE SORTING ALGORITHM

AU - Archibald, M.

AU - Blecher, A.

AU - Brennan, C.

AU - Knopfmacher, A.

AU - Mansour, T.

PY - 2022

Y1 - 2022

N2 - We define the statistic of a push for words on an alphabet [k] and use this to obtain a generating function measuring the degree to which an arbitrary word deviates from sorted order. Several subsidiary concepts are investigated: the number of cells that are not pushed, the number of already sorted columns, the number of cells that coincide before and after pushing, the fixed cells in words and finally, the frictionless pushes.

AB - We define the statistic of a push for words on an alphabet [k] and use this to obtain a generating function measuring the degree to which an arbitrary word deviates from sorted order. Several subsidiary concepts are investigated: the number of cells that are not pushed, the number of already sorted columns, the number of cells that coincide before and after pushing, the fixed cells in words and finally, the frictionless pushes.

KW - asymptotics

KW - generating function

KW - sorting

KW - words

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

M3 - Article

AN - SCOPUS:85158824103

SN - 1715-0868

VL - 17

SP - 56

EP - 69

JO - Contributions to Discrete Mathematics

JF - Contributions to Discrete Mathematics

IS - 1

ER -

PUSHES IN WORDS—A PRIMITIVE SORTING ALGORITHM

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this