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

Citation & Export
Hide

Simple citation

Shar, Nathaniel. Experimental methods in permutation patterns and bijective proof. Retrieved from https://doi.org/doi:10.7282/T3BK1FKF

Export

Click here for information about Citation Management Tools at Rutgers.

Statistics
Hide

Description

TitleExperimental methods in permutation patterns and bijective proof
NameShar, Nathaniel (author); Zeilberger, Doron (chair); Sloane, Neil (internal member); Retakh, Vladimir (internal member); Pudwell, Lara (outside member); Rutgers University; Graduate School - New Brunswick
Date Created2016
Other Date2016-05 (degree)
SubjectMathematics, Combinatorial enumeration problems
Extent1 online resource (vi, 102 p. : ill.)
DescriptionExperimental mathematics is the technique of developing conjectures and proving theorems through the use of experimentation; that is, exploring finitely many cases and detecting patterns that can then be rigorously proved. This thesis applies the techniques of experimental mathematics to several problems.
First, we generalize the translation method of Wood and Zeilberger [49] to algebraic proofs, and as an example, produce (by computer) the first bijective proof of Franel’s recurrence for an(3)=Σnk=0(nk)3.
Next, we apply the method of enumeration schemes to several problems in the fieldof patterns on permutations and words. Given a word w on the alphabet [n] and σ ∈ Sk, we say that w contains the pattern σ if some subsequence of the letters of w is orderisomorphic to σ. First, we find an enumeration scheme that allows us to count the words containing r copies of each letter that avoid the pattern 123. Then we look at the case where w is in fact a permutation in Sn. A repeating permutation is one that is the direct sum of several copies of a smaller permutation. We produce an enumeration scheme to count permutations avoiding repeating patterns of low codimension, and show that for each repeating pattern, the problem belongs to the eventually polynomial ansatz.
NotePh.D.
NoteIncludes bibliographical references
Noteby Nathaniel Shar
Genretheses, ETD doctoral
Persistent URLhttps://doi.org/doi:10.7282/T3BK1FKF
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