liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Pattern Avoidance in Alternating Sign Matrices
Linköping University, Department of Mathematics.
2006 (English)Independent thesis Basic level (professional degree), 20 points / 30 hpStudent thesis
Abstract [en]

This thesis is about a generalization of permutation theory. The concept of pattern avoidance in permutation matrices is investigated in a larger class of matrices - the alternating sign matrices. The main result is that the set of alternating sign matrices avoiding the pattern 132, is counted by the large Schröder numbers. An algebraic and a bijective proof is presented. Another class is shown to be counted by every second Fibonacci number. Further research in this new area of combinatorics is discussed.

Place, publisher, year, edition, pages
Matematiska institutionen , 2006. , 51 p.
Keyword [en]
Combinatorics, Alternating Sign Matrix, Permutation, Restricted permutation, Permutation pattern, Pattern avoidance, Schröder number
National Category
Computational Mathematics
URN: urn:nbn:se:liu:diva-7936ISRN: LiTH-MAT-EX--06/15--SEOAI: diva2:22841
Available from: 2006-12-21 Created: 2006-12-21

Open Access in DiVA

fulltext(296 kB)1259 downloads
File information
File name FULLTEXT01.pdfFile size 296 kBChecksum SHA-1
Type fulltextMimetype application/pdf

By organisation
Department of Mathematics
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 1259 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 401 hits
ReferencesLink to record
Permanent link

Direct link