Processing math: 100%
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

SEARCH GUIDE  Download Search Tip PDF File

  • articleNo Access

    Generalized UC plane partitions

    We define the generalized vertex operators expressed by charged fermions and state vectors corresponding to the n-partition. The action of the generalized vertex operators on state vectors and the generalized universal character (UC) plane partitions have been investigated by the fermion calculus techniques. Furthermore, we construct the infinite scalar product and the generating function associated with the generalized UC plane partitions.

  • articleNo Access

    Representations of quantum toroidal superalgebras and plane s-partitions

    We construct Fock and MacMahon modules for the quantum toroidal superalgebra s associated with the Lie superalgebra 𝔤𝔩m|n and parity s. The bases of the Fock and MacMahon modules are labeled by super-analogs of partitions and plane partitions with various boundary conditions, while the action of generators of s is given by Pieri-type formulas. We study the corresponding characters.

  • articleFree Access

    On the divisibility of 7-elongated plane partition diamonds by powers of 8

    In 2021 da Silva, Hirschhorn, and Sellers studied a wide variety of congruences for the k-elongated plane partition function dk(n) by various primes. They also conjectured the existence of an infinite congruence family modulo arbitrarily high powers of 2 for the function d7(n). We prove that such a congruence family exists — indeed, for powers of 8. The proof utilizes only classical methods, i.e. integer polynomial manipulations in a single function, in contrast to all other known infinite congruence families for dk(n) which require more modern methods to prove.

  • articleNo Access

    Linear algebra and congruences for MacMahon’s k-rowed plane partitions

    In this paper, we provide an algorithm to detect linear congruences of plk(n), the number of MacMahon’s k-rowed plane partitions, and give a quantitative result on the nonexistence of Ramanujan-type congruences of the k-rowed plane partition functions. We also show p(n,m) that the number of partitions at most m parts always admits linear congruences.