Permutation patterns in Latin squares

MaRDI QIDQ2876040zbMATH OpenFDO

Authors Michael J. Earnest, Samuel C. Gutekunst

Publication date 15 August 2014

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1402.3336, http://ajc.maths.uq.edu.au/pdf/59/ajc_v59_p218.pdf

zbMATH Keywords

Erdős-Szekeres theorempattern avoidance in permutations

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Abstract: In this paper we study pattern avoidance in Latin Squares, which gives us a two dimensional analogue of the well studied notion of pattern avoidance in permutations. Our main results include enumerating and characterizing the Latin Squares which avoid patterns of length three and a generalization of the ErdH{o}s-Szekeres theorem. We also discuss equivalence classes among longer patterns, and conclude by describing open questions of interest both in light of pattern avoidance and their potential to reveal information about the structure of Latin Squares. Along the way, we show that classical results need not trivially generalize, and demonstrate techniques that may help answer future questions.

Recommendations

• Pattern avoidance in permutations and their squares
• Multi-avoidance of generalised patterns
• Avoiding pairs of partial Latin squares
• Enumerating pattern avoidance for affine permutations
• Avoiding Arrays of Odd Order by Latin Squares

Cited in

(3)

• Pattern avoidance in permutations and their squares
• scientific article; zbMATH DE number 7640030 (Why is no real title available?)
• Cycle switches in Latin squares

This page was built for publication: Permutation patterns in Latin squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2876040)