The Lengths for Which Bicrucial Square-Free Permutations Exist

Carla Groenland; Tom Johnston

doi:10.54550/eca2022v2s4pp4

The Lengths for Which Bicrucial Square-Free Permutations Exist

Carla Groenland
, Tom Johnston

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

Abstract

: A square is a factor S = (S1; S2) where S1 and S2 have the same pattern, and a permutation is
said to be square-free if it contains no non-trivial squares. The permutation is further said to be bicrucial if
every extension to the left or right contains a square. We completely classify for which n there exists a bicrucial
square-free permutation of length n.

Original language	English
Pages (from-to)	1-12
Number of pages	12
Journal	Enumerative Combinatorics and Applications
Volume	2
Issue number	4
DOIs	https://doi.org/10.54550/eca2022v2s4pp4
Publication status	Published - 21 Jan 2022

Access to Document

10.54550/eca2022v2s4pp4Licence: CC BY-NC-ND

ECA2022_S4PP4Final published version, 737 KBLicence: CC BY-NC-ND

Cite this

@article{ae80ec83fc5b4cfb9e7fe0d8965ab7b9,

title = "The Lengths for Which Bicrucial Square-Free Permutations Exist",

abstract = ": A square is a factor S = (S1; S2) where S1 and S2 have the same pattern, and a permutation is said to be square-free if it contains no non-trivial squares. The permutation is further said to be bicrucial if every extension to the left or right contains a square. We completely classify for which n there exists a bicrucial square-free permutation of length n.",

author = "Carla Groenland and Tom Johnston",

year = "2022",

month = jan,

day = "21",

doi = "10.54550/eca2022v2s4pp4",

language = "English",

volume = "2",

pages = "1--12",

journal = "Enumerative Combinatorics and Applications",

issn = "2710-2335",

number = "4",

}

TY - JOUR

T1 - The Lengths for Which Bicrucial Square-Free Permutations Exist

AU - Groenland, Carla

AU - Johnston, Tom

PY - 2022/1/21

Y1 - 2022/1/21

N2 - : A square is a factor S = (S1; S2) where S1 and S2 have the same pattern, and a permutation is said to be square-free if it contains no non-trivial squares. The permutation is further said to be bicrucial if every extension to the left or right contains a square. We completely classify for which n there exists a bicrucial square-free permutation of length n.

AB - : A square is a factor S = (S1; S2) where S1 and S2 have the same pattern, and a permutation is said to be square-free if it contains no non-trivial squares. The permutation is further said to be bicrucial if every extension to the left or right contains a square. We completely classify for which n there exists a bicrucial square-free permutation of length n.

U2 - 10.54550/eca2022v2s4pp4

DO - 10.54550/eca2022v2s4pp4

M3 - Article

SN - 2710-2335

VL - 2

SP - 1

EP - 12

JO - Enumerative Combinatorics and Applications

JF - Enumerative Combinatorics and Applications

IS - 4

ER -

The Lengths for Which Bicrucial Square-Free Permutations Exist

Abstract

Access to Document

Fingerprint

Cite this