Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Central polygonal numbers (1)
- Circle method (1)
- Colored permutation (1)
- Flat (1)
- Gallai-Ramsey numbers (1)
-
- Gorenstein (1)
- Gorenstein flat (1)
- Gorenstein projective (1)
- Homological algebra (1)
- Injective (1)
- Integer partitions (1)
- Modulo (1)
- Monochromatic cycle (1)
- Music (1)
- Number theory (1)
- Parabolic shapes (1)
- Partition identities (1)
- Pattern (1)
- Pattern packing (1)
- Patterns (1)
- Permutation (1)
- Precover (1)
- Projective (1)
- Rainbow triangle (1)
- Triangular numbers (1)
Articles 1 - 6 of 6
Full-Text Articles in Physical Sciences and Mathematics
Drawing Numbers And Listening To Patterns, Loren Zo Haynes
Drawing Numbers And Listening To Patterns, Loren Zo Haynes
Honors College Theses
The triangular numbers is a series of number that add the natural numbers. Parabolic shapes emerge when this series is placed on a lattice, or imposed with a limited number of columns that causes the sequence to continue on the next row when it has reached the kth column. We examine these patterns and construct proofs that explain their behavior. We build off of this to see what happens to the patterns when there is not a limited number of columns, and we formulate the graphs as musical patterns on a staff, using each column as a line or space …
Gorenstein Projective Precovers In The Category Of Modules, Katelyn Coggins
Gorenstein Projective Precovers In The Category Of Modules, Katelyn Coggins
Electronic Theses and Dissertations
It was recently proved that if R is a coherent ring such that R is also left n-perfect, then the class of Gorenstein projective modules, GP, is precovering. We will prove that the class of Gorenstein projective modules is special precovering over any left GF-closed ring R such that every Gorenstein projective module is Gorenstein flat and every Gorenstein flat module has finite Gorenstein projective dimension. This class of rings includes that of right coherent and left n-perfect rings.
Gorenstein Projective (Pre)Covers, Michael J. Fox
Gorenstein Projective (Pre)Covers, Michael J. Fox
Electronic Theses and Dissertations
The existence of the Gorenstein projective precovers is one of the main open problems in Gorenstein Homological algebra. We give sufficient conditions in order for the class of Gorenstein projective complexes to be special precovering in the category of complexes of R-modules Ch(R). More precisely, we prove that if every complex in Ch(R) has a special Gorenstein flat cover, every Gorenstein projective complex is Gorenstein flat, and every Gorenstein flat complex has finite Goenstein projective dimension, then the class of Gorenstein projective complexes, GP(C), is special precovering in Ch(R).
Gallai-Ramsey Number Of An 8-Cycle, Jonathan Gregory
Gallai-Ramsey Number Of An 8-Cycle, Jonathan Gregory
Electronic Theses and Dissertations
Given a graph G and a positive integer k, define the Gallai-Ramsey number to be the minimum number of vertices n such that any k-edge-coloring of Kn contains either a rainbow (all different colored) triangle or a monochromatic copy of G. In this work, we establish the Gallai-Ramsey number of an 8-cycle for all positive integers.
A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot
A Partition Function Connected With The Göllnitz-Gordon Identities, Nicolas A. Smoot
Electronic Theses and Dissertations
Nearly a century ago, the mathematicians Hardy and Ramanujan established their celebrated circle method to give a remarkable asymptotic expression for the unrestricted partition function. Following later improvements by Rademacher, the method was utilized by Niven, Lehner, Iseki, and others to develop rapidly convergent series representations of various restricted partition functions. Following in this tradition, we use the circle method to develop formulas for counting the restricted classes of partitions that arise in the Gollnitz-Gordon identities. We then show that our results are strongly supported by numerical tests. As a side note, we also derive and compare the asymptotic behavior …
Combinatorial Optimization Of Subsequence Patterns In Words, Matthew R. Just
Combinatorial Optimization Of Subsequence Patterns In Words, Matthew R. Just
Electronic Theses and Dissertations
Packing patterns in words concerns finding a word with the maximum number of a prescribed pattern. The majority of the work done thus far is on packing patterns into permutations. In 2002, Albert, Atkinson, Handley, Holton and Stromquist showed that there always exists a layered permutation containing the maximum number of a layered pattern among all permutations of length n. Consequently, the packing density for all but two (up to equivalence) permutation patterns up to length 4 can be obtained. In this thesis we consider the analogous question for colored patterns and permutations. By introducing the concept of colored blocks …