Transposition graphs, stirling numbers and the parity theorem for permutations
This thesis is about an interplay between Abstract Algebra, Graph Theory, Combinatorics and Recreational Mathematics. In abstract Algebra, the Parity Theorem states that every permutation can be written as a product of either an even number of transpositions or an old number of transpositions but no...
Saved in:
Main Authors: | Abis, Genesis V., Sioco, Elaine S. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2006
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_bachelors/17431 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
On the knight's tour on the fifteen puzzle and the topspin puzzle
by: Gavino, Albert D., et al.
Published: (1998) -
Several classes of permutation polynomials of the form (xpm − x + δ)s + x over Fp2m
by: Xu, Guangkui, et al.
Published: (2022) -
An exposition on singular graphs: The cartesian product of two graphs
by: Calvero, Arianne Faye Marie B., et al.
Published: (2006) -
On groups formed from 2 x 2 matrices with entries from Zp
by: Simon, Jose L., Jr., et al.
Published: (2006) -
The terwilliger algebra of a distance-regular graph
by: Go, Junie T.
Published: (1999)