Bressoud Factorization

This is the second of two volumes of a state-of-the-art survey article collection which originates from three commutative algebra sessions at the 2009 Fall Southeastern American Mathematical Society Meeting at Florida Atlantic University. The articles reach into diverse areas of commutative algebra and build a bridge between Noetherian and non-Noetherian commutative algebra.

This book introduces the factorization method in quantum mechanics at an advanced level, with the aim of putting mathematical and physical concepts and techniques like the factorization method, Lie algebras, matrix elements and quantum control at the reader’s disposal. For this purpose, the text provides a comprehensive description of the factorization method and its wide applications in quantum mechanics which complements the traditional coverage found in quantum mechanics textbooks.

The Primality Testing Problem (PTP) has now proved to be solvable in deterministic polynomial-time (P) by the AKS (Agrawal-Kayal-Saxena) algorithm, whereas the Integer Factorization Problem (IFP) still remains unsolvable in (P). There is still no polynomial-time algorithm for IFP. Many practical public-key cryptosystems and protocols such as RSA (Rivest-Shamir-Adleman) rely their security on computational intractability of IFP.

This book presents the algorithms used to provide recommendations by exploiting matrix factorization and tensor decomposition techniques.