Abstract
dc:description.abstractLet M(n,s) be the number of nxn matrices with binary entries, row and column sum s, and whose rows are in lexicographical order. Let S(n) be the number of nxn matrices with entries from {0,1,2}, symmetric, with trace 0, and row sum 2. (The sequence S(n) appears as A002137 in N.J.A. Sloane's Online Encyclopedia of Integer Sequences.) We give two proofs to show that M(n,2)=S(n). First, we show they satisfy the same recurrence. Second, we give an explicit bijection between the two sets. We also show that the bijection maintains the cycle structure of our matrices. Let M_s(n,2) be the set of symmetric matrices in M(n,2). We will show M_s(n,2) satisfies the Fibonacci sequence.
Degree
thesis:*- Name thesis:degree_name
- Master of Science (MS)
- Level thesis:degree_level
- Thesis
- Discipline thesis:degree_discipline
- Mathematical Science
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Janoski, Janine
- Contributors dc:contributor
-
- Calkin, Neil J
- Matthews , Gretchen L
- Gallagher , Colin M
Subjects
dc:subject × 8Identifiers
dc:identifier.*- Repository record dc:identifier
- https://open.clemson.edu/all_theses/317