Hostname: page-component-74656f9884-8rzl6 Total loading time: 0 Render date: 2026-11-06T09:40:22.491Z Has data issue: false hasContentIssue false

A New Upper Bound for 1324-Avoiding Permutations

Published online by Cambridge University Press:  09 July 2014

MIKLÓS BÓNA*
Affiliation:
Department of Mathematics, University of Florida, 358 Little Hall, PO Box 118105, Gainesville, FL 32611–8105, USA (e-mail: bona@ufl.edu)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We prove that the number of 1324-avoiding permutations of length n is less than $(7+4\sqrt{3})^n$. The novelty of our method is that we injectively encode such permutations by a pair of words of length n over a finite alphabet that avoid a given factor.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2014