You are here

COMBINATORIAL STRUCTURES

Download pdf | Full Screen View

Date Issued:
2017
Summary:
The purpose of this paper is to re-examine combinatorial structures as studied with respect to permutations and partitions. Ferrers diagrams, the Robinson-Schensted insertion algorithm, Knuth equivalence, and plactic monoids are explained and discussed. This paper is the result of research in mathematical journal databases. The purpose of this paper is to give clear explanations and examples of some of the basic combinatorial structures. While there are many textbooks out there for some of these concepts, a simple concise and clear document has been made available to explain through this work in order to give a basic reference point without the need of seeking an entire book.
Title: COMBINATORIAL STRUCTURES.
12 views
3 downloads
Name(s): Baldwin, William Wesley, IV, Author
Type of Resource: text
Date Issued: 2017
Publisher: University of West Florida
Language(s): English
Summary: The purpose of this paper is to re-examine combinatorial structures as studied with respect to permutations and partitions. Ferrers diagrams, the Robinson-Schensted insertion algorithm, Knuth equivalence, and plactic monoids are explained and discussed. This paper is the result of research in mathematical journal databases. The purpose of this paper is to give clear explanations and examples of some of the basic combinatorial structures. While there are many textbooks out there for some of these concepts, a simple concise and clear document has been made available to explain through this work in order to give a basic reference point without the need of seeking an entire book.
Identifier: WFE0000570 (IID), uwf:61173 (fedora)
Note(s): 2017-07-01
M.S.
Department of Mathematics and Statistics
Masters
Persistent Link to This Record: http://purl.flvc.org/uwf/fd/WFE0000570
Restrictions on Access: public
Use and Reproduction: http://rightsstatements.org/vocab/InC-EDU/1.0/
Host Institution: UWF

In Collections