TL;DR: Chervov and Talalaev as discussed by the authors studied a class of matrices with noncommutative entries, which were first considered by YuI Manin in 1988 in relation with quantum group theory.
TL;DR: A significant algorithmic improvement of the Omega package is presented, which overcomes a problem related to the computational treatment of roots of unity and turns out to be superior to "The Method of Elliott" which is described in MacMahon's book.
Abstract: In his famous book "Combinatory Analysis" MacMahon introduced Partition Analysis as a computational method for solving combinatorial problems in connection with systems of linear diophantine inequalities and equations. By developing the Omega package we have shown that Partition Analysis is ideally suited for being supplemented by computer algebra methods. The object of this paper is to present a significant algorithmic improvement of this package. It overcomes a problem related to the computational treatment of roots of unity. Moreover, this new reduction strategy turns out to be superior to "The Method of Elliott" which is described in MacMahon's book. In order to make this article as self-contained as possible we give a brief introduction to Partition Analysis together with a variety of illustrative examples. For instance, the generating function of magic pentagrams is computed.
TL;DR: This work state and prove a quantum generalization of MacMahon's celebrated Master Theorem and relate it to a quantumgeneralization of the boson–fermion correspondence of physics.
Abstract: We state and prove a quantum-generalization of MacMahon's celebrated Master Theorem, and relate it to a quantum-generalization of the boson-fermion correspondence of Physics.
TL;DR: The object of this article is to show that nevertheless Partition Analysis is of significant value when treating non-standard types of plane partitions.