Generating some restricted classes of permutations

Simple item page
dc.contributor.authorLausch, Scott Arnoen_US
dc.date.accessioned2024-08-14T20:59:54Z
dc.date.available2024-08-14T20:59:54Z
dc.date.copyright1999en_US
dc.date.issued1999
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractWe consider the generation of two categories of permutations. The first category consists of stamp foldings and related objects. A stamp folding is a permutation representing the folding of a linear strip of stamps into a pile. The second category consists of Dumont permutations of both the first and second kind, which are defined by rules based on the parity of the indices and elements. Algorithms which are asymptotically efficient were developed for all objects consid­ered Each algorithm used the technique of recursive backtracking. Also, a possible one-to-one mapping between the two types of Dumont permutations was conjectured.
dc.format.extent85 pages
dc.identifier.urihttps://hdl.handle.net/1828/18549
dc.rightsAvailable to the World Wide Weben_US
dc.titleGenerating some restricted classes of permutationsen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
LAUSCH_Scott_Arno_MSc_1999_935254.pdf
Size:
18.41 MB
Format:
Adobe Portable Document Format
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.