Almost avoiding permutations

Brignall, Robert; Ekhad, Shalosh B.; Smith, Rebecca and Vatter, Vincent (2009). Almost avoiding permutations. Discrete Mathematics, 309(23-24), pp. 6626–6631.

(Click here to request a copy from the OU Author.)

DOI (Digital Object Identifier) Link:	http://dx.doi.org/doi:10.1016/j.disc.2009.06.027
Google Scholar:	Look up in Google Scholar

Abstract

We investigate the notion of almost avoiding a permutation: π almost avoids β if one can remove a single entry from π to obtain a β-avoiding permutation.

Item Type:	Journal Article
Copyright Holders:	2009 Elsevier B.V.
ISSN:	0012-365X
Keywords:	almost avoidance; restricted permutation; permutation class; permutation pattern
Academic Unit/Department:	Mathematics, Computing and Technology > Mathematics and Statistics
Item ID:	23474
Depositing User:	Robert Brignall
Date Deposited:	08 Oct 2010 15:43
Last Modified:	05 Dec 2012 15:32
URI:	http://oro.open.ac.uk/id/eprint/23474

Actions (login may be required)

	View Item
RDF+XMLBibTeXRDF+N-TriplesJSONDublin CoreAtomOAI-ORE Resource Map (Atom Format)Simple MetadataReferMETSOAI-ORE Resource Map (RDF Format)HTML CitationASCII CitationMultiline CSVRefMan RIS Format (UTF-8)OpenURL ContextObjectEndNoteMODSOpenURL ContextObject in SpanMPEG-21 DIDLEP3 XMLRefMan RIS FormatRDF+N3Eprints Application Profile	Public: Report issue / request change