What is Nonunique Factorization Theory in Number Theory?

[camilus]

Im applying to an REU in San Diego State where the focus will be Nonunique factorization theory but I'm clueless as to what this actually is. Does anybody know anything about this?

The general area of study will be Number Theory, specifically Nonunique Factorization Theory. An Arithmetic Congruence Monoid, or ACM, is a multiplicatively closed subset of the naturals, such as {6, 36, 66, 96, 126, 156, 186, ...} with {1} included for convenience. We are concerned with the multiplicative structure. For example, 66*66=6*726, a factorization into "primes" in two different ways.

 

[Mooky]

I know nothing about this, but brush up of your knowledge of basic number theory, including primes and factorizations, and you should be fine. This is an REU, so they don't expect you do be an expert, especially on a relatively obscure field such as this. It sounds very interesting. Enjoy!

 

[Mathguy15]

I have heard of a construction that gives a set of integers that cannot be factorized uniquely. Consider the numbers that have an even number of distinct primes as factors. It is not hard to see that the primes of this set are those integers that have at most two distinct prime factors. Let p and q be two ordinary prime numbers. Then, p^2*q^2=(pq)^2. Since p^2, q^2, and pq have no factors in this set, p^2*q^2 is a counterexample to unique factorization in this set. I suspect that something similar may happen when an even number is replaced with multiples of any integer. Maybe something like this is what you were looking for? You might be looking for something a great deal more advanced. This is just what I've heard that might be related to what you want.

Um, something is happening. I am not reposting this. I think something's going wrong with my computer. I keep clicking edit and i get a new post. SORRY!

 

[Mathguy15]

I have heard of a construction that gives a set of integers that cannot be factorized uniquely. Consider the numbers that have an even number of distinct primes as factors. It is not hard to see that the primes of this set are those integers that have at most two distinct prime factors. Let p and q be two ordinary prime numbers. Then, p^2*q^2=(pq)^2. Since p^2, q^2, and pq have no factors in this set, p^2*q^2 is a counterexample to unique factorization in this set. I suspect that something similar may happen when an even number is replaced with multiples of any integer. Maybe something like this is what you were looking for? You might be looking for something a great deal more advanced. This is just what I've heard that might be related to what you want.

EDIT:SORRY, I did not carefully read your post. You are looking for something specifically about the REU. Sorry for my redundant ramblings.

 

[Mathguy15]

I have heard of a construction that gives a set of integers that cannot be factorized uniquely. Consider the numbers that have an even number of distinct primes as factors. It is not hard to see that the primes of this set are those integers that have at most two distinct prime factors. Let p and q be two ordinary prime numbers. Then, p^2*q^2=(pq)^2. Since p^2, q^2, and pq have no factors in this set, p^2*q^2 is a counterexample to unique factorization in this set. I suspect that something similar may happen when an even number is replaced with multiples of any integer. Maybe something like this is what you were looking for? You might be looking for something a great deal more advanced. This is just what I've heard that might be related to what you want.

SORRY, I did not carefully read your post. You are looking for something specifically about the REU. Sorry for my redundant ramblings.

edit:Sorry for the repost.

 

[lostcauses10x]

do an internet search for Non Unique factorization. A lot of material is available out there.