On Conjectures Concerning Nonassociate Factorizations
We consider and solve some open conjectures on the asymptotic behavior of the number of different numbers of the nonassociate factorizations of prescribed minimal length for specific finite factorization domains. The asymptotic behavior will be classified for Cohen-Kaplansky domains in Chapter 1 and...
Main Author: | Laska, Jason A |
---|---|
Format: | Others |
Published: |
Trace: Tennessee Research and Creative Exchange
2010
|
Subjects: | |
Online Access: | http://trace.tennessee.edu/utk_graddiss/818 |
Similar Items
-
Some topics in abstract factorization
by: Juett, Jason Robert
Published: (2013) -
Algorithmic complexity of linear nonassociative algebra
by: R. K. Kerimbaev, et al.
Published: (2020-09-01) -
Primary decomposition of ideals in a ring
by: Oyinsan, Sola
Published: (2007) -
Matrix Factorizations of the Classical Discriminant
by: Hovinen, Bradford
Published: (2009) -
Matrix Factorizations of the Classical Discriminant
by: Hovinen, Bradford
Published: (2009)