Home
Resource
Computational methods in permutation patterns
PDF
PDF format is widely accepted and good for printing.
Plug-in required
PDF-1(781.05 kb)
Citation & Export
View Usage Statistics
Staff View

Citation & Export
Hide

Simple citation

Nakamura, Brian Koichi. Computational methods in permutation patterns. Retrieved from https://doi.org/doi:10.7282/T3C24V02

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleComputational methods in permutation patterns
NameNakamura, Brian Koichi (author); Zeilberger, Doron (chair); Retakh, Vladimir (internal member); Saks, Michael (internal member); Sloane, Neil (outside member); Rutgers University; Graduate School - New Brunswick
Date Created2013
Other Date2013-05 (degree)
SubjectMathematics, Permutations, Mathematics--Data processing
Extentvii, 94 p. : ill.
DescriptionGiven two permutations sigma (of length k) and pi (of length n), the permutation pi is said to contain the pattern sigma if there exists a length k subsequence in pi that is order-isomorphic to sigma. Each such subsequence is called an occurrence of sigma in pi. Over the past few decades, the study of pattern-avoiding permutations has been a very active area of research. This thesis will consider two types of problems in this area. The first is a variation known as consecutive patterns, where the pattern sigma must occur in consecutive terms of the permutation to count as an occurrence. The second is a generalization of the classical pattern avoiding problem, where we wish to study permutations with exactly r occurrences of a pattern (for some fixed non-negative r).
NotePh.D.
NoteIncludes bibliographical references
Noteby Brian Koichi Nakamura
Genretheses, ETD doctoral
Persistent URLhttps://doi.org/doi:10.7282/T3C24V02
Languageeng
CollectionGraduate School - New Brunswick Electronic Theses and Dissertations
Organization NameRutgers, The State University of New Jersey
RightsThe author owns the copyright to this work.
Version 8.5.5
Rutgers University Libraries - Copyright ©2024