S-crucial and bicrucial permutations with respect to squares
MetadataShow full item record
A permutation is square-free if it does not contain two consecutive factors of length two or more that are order-isomorphic. A permutation is bicrucial with respect to squares if it is square-free but any extension of it to the right or to the left by any element gives a permutation that is not square-free. Avgustinovich et al. studied bicrucial permutations with respect to squares, and they proved that there exist bicrucial permutations of lengths 8k+1, 8k+5, 8k+7 for k ≥ 1. It was left as open questions whether bicrucial permutations of even length, or such permutations of length 8k+3 exist. In this paper, we provide an encoding of orderings which allows us, using the constraint solver Minion, to show that bicrucial permutations of even length exist, and the smallest such permutations are of length 32. To show that 32 is the minimum length in question, we establish a result on left-crucial (that is, not extendable to the left) square-free permutations which begin with three elements in monotone order. Also, we show that bicrucial permutations of length 8k+3 exist for k = 2,3 and they do not exist for k =1. Further, we generalize the notions of right-crucial, left-crucial, and bicrucial permutations studied in the literature in various contexts, by introducing the notion of P-crucial permutations that can be extended to the notion of P-crucial words. In S-crucial permutations, a particular case of P-crucial permutations, we deal with permutations that avoid prohibitions, but whose extensions in any position contain a prohibition. We show that S-crucial permutations exist with respect to squares, and minimal such permutations are of length 17. Finally, using our software, we generate relevant data showing, for example, that there are 162,190,472 bicrucial square-free permutations of length 19.
Gent , I , Kitaev , S , Konovalov , A , Linton , S & Nightingale , P 2015 , ' S-crucial and bicrucial permutations with respect to squares ' , Journal of Integer Sequences , vol. 18 , no. 6 , 15.6.5 .
Journal of Integer Sequences
Copyright 2014, the authors. This an arXiv preprint.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Showing items related by title, author, creator and subject.
Albert, M.H.; Linton, Stephen Alexander; Ruskuc, Nik; Vatter, V; Waton, S (2011-05) - Journal articleA selection of points drawn from a convex polygon, no two with the same vertical or horizontal coordinate, yields a permutation in a canonical fashion. We characterise and enumerate those permutations which arise in this ...
Menezes, Nina E. (University of St Andrews, 2013) - ThesisPart I of this thesis studies P[subscript(G)](d), the probability of generating a nonabelian simple group G with d randomly chosen elements, and extends this idea to consider the conditional probability P[subscript(G,S ...
Cameron, Peter J.; Fernandes, Maria Elisa; Leemans, Dimitri; Mixer, Mark (2017-07-04) - Journal articleWe prove that the highest rank of a string C-group constructed from an alternating group An is 3 if n=5, 4 if n=9, 5 if n=10, 6 if n=11, and ⌊(n−1)/2⌋ if n⩾12. Moreover, if n=3,4,6,7, or 8, the group An is not a string ...