Skip to content

Research at St Andrews

Permutations Generated by Stacks and Deques

Research output: Contribution to journalArticlepeer-review

Standard

Permutations Generated by Stacks and Deques. / Albert, Michael; Atkinson, Michael David; Linton, Stephen Alexander.

In: Annals of Combinatorics, Vol. 14, No. 1, 03.2010, p. 3-16.

Research output: Contribution to journalArticlepeer-review

Harvard

Albert, M, Atkinson, MD & Linton, SA 2010, 'Permutations Generated by Stacks and Deques', Annals of Combinatorics, vol. 14, no. 1, pp. 3-16. https://doi.org/10.1007/s00026-010-0042-9

APA

Albert, M., Atkinson, M. D., & Linton, S. A. (2010). Permutations Generated by Stacks and Deques. Annals of Combinatorics, 14(1), 3-16. https://doi.org/10.1007/s00026-010-0042-9

Vancouver

Albert M, Atkinson MD, Linton SA. Permutations Generated by Stacks and Deques. Annals of Combinatorics. 2010 Mar;14(1):3-16. https://doi.org/10.1007/s00026-010-0042-9

Author

Albert, Michael ; Atkinson, Michael David ; Linton, Stephen Alexander. / Permutations Generated by Stacks and Deques. In: Annals of Combinatorics. 2010 ; Vol. 14, No. 1. pp. 3-16.

Bibtex - Download

@article{9ffa404c1c134687b64d854e1dbd2086,
title = "Permutations Generated by Stacks and Deques",
abstract = "Lower and upper bounds are given for the the number of permutations of length n generated by two stacks in series, two stacks in parallel, and a general deque.",
keywords = "deque, parallel stacks, serial stacks, permutation, enumeration, growth rate, GRAPHS",
author = "Michael Albert and Atkinson, {Michael David} and Linton, {Stephen Alexander}",
year = "2010",
month = mar,
doi = "10.1007/s00026-010-0042-9",
language = "English",
volume = "14",
pages = "3--16",
journal = "Annals of Combinatorics",
issn = "0218-0006",
publisher = "Birkhauser Verlag Basel",
number = "1",

}

RIS (suitable for import to EndNote) - Download

TY - JOUR

T1 - Permutations Generated by Stacks and Deques

AU - Albert, Michael

AU - Atkinson, Michael David

AU - Linton, Stephen Alexander

PY - 2010/3

Y1 - 2010/3

N2 - Lower and upper bounds are given for the the number of permutations of length n generated by two stacks in series, two stacks in parallel, and a general deque.

AB - Lower and upper bounds are given for the the number of permutations of length n generated by two stacks in series, two stacks in parallel, and a general deque.

KW - deque

KW - parallel stacks

KW - serial stacks

KW - permutation

KW - enumeration

KW - growth rate

KW - GRAPHS

U2 - 10.1007/s00026-010-0042-9

DO - 10.1007/s00026-010-0042-9

M3 - Article

VL - 14

SP - 3

EP - 16

JO - Annals of Combinatorics

JF - Annals of Combinatorics

SN - 0218-0006

IS - 1

ER -

Related by author

  1. Polynomial-time proofs that groups are hyperbolic

    Holt, D., Linton, S., Neunhoeffer, M., Parker, R., Pfeiffer, M. & Roney-Dougal, C. M., May 2021, In: Journal of Symbolic Computation. 104, p. 419-475

    Research output: Contribution to journalArticlepeer-review

  2. GAP – Groups, Algorithms, and Programming, Version 4.11.1

    The GAP Group, Behrends, R., Breuer, T., Horn, M., Hulpke, A., Jefferson, C. A., Konovalov, A., Linton, S. A., Lübeck, F., Mitchell, J. D., Pfeiffer, M. J., Siccha, S. & Torpey, M. C., 2 Mar 2021

    Research output: Non-textual formSoftware

  3. GAP – Groups, Algorithms, and Programming, Version 4.11.0

    The GAP Group, Behrends, R., Breuer, T., Horn, M., Hulpke, A., Jefferson, C. A., Konovalov, A., Linton, S. A., Lübeck, F., Mitchell, J. D., Pfeiffer, M. J., Siccha, S. & Torpey, M. C., 29 Feb 2020

    Research output: Non-textual formSoftware

  4. GAP – Groups, Algorithms, and Programming, Version 4.10.2

    The GAP Group, Behrends, R., Breuer, T., Horn, M., Hulpke, A., Jefferson, C. A., Konovalov, A., Linton, S. A., Lübeck, F., Mitchell, J. D., Pfeiffer, M. J., Siccha, S. & Torpey, M. C., 19 Jun 2019

    Research output: Non-textual formSoftware

  5. GAP – Groups, Algorithms, and Programming, Version 4.10.1

    The GAP Group, Behrends, R., Breuer, T., Horn, M., Hulpke, A., Jefferson, C. A., Konovalov, A., Linton, S. A., Lübeck, F., Mitchell, J. D., Pfeiffer, M. J., Siccha, S. & Torpey, M. C., 23 Feb 2019

    Research output: Non-textual formSoftware

ID: 5097676

Top