• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • 2
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Pattern Avoidance in Alternating Sign Matrices

Johansson, Robert January 2006 (has links)
<p>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.</p>
2

Pattern Avoidance in Alternating Sign Matrices

Johansson, Robert January 2006 (has links)
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.

Page generated in 0.14 seconds