In the paper, we consider a ring structure on the Cartesian product of two sets of integer multisets. In this way, we introduce a ring of integer multinumbers as a quotient of the Cartesian product with respect to a natural equivalence. We examine the properties of this ring and construct some isomorphisms to subrings of polynomials and Dirichlet series with integer coefficients. In addition, we introduce finite rings of multinumbers “modulo ” and propose an algorithm for construction of invertible elements in these rings that may be applicable in Public-key Cryptography. An analog of the Little Fermat Theorem for integer multinumbers is proved.
In this paper, we introduce -symmetric polynomials associated with the finite group which consists of roots of unity, and groups of permutations acting on the Cartesian product of Banach spaces These polynomials extend the classical notions of symmetric and supersymmetric polynomials on We explore algebraic bases in the algebra of -symmetric polynomials and derive corresponding generating functions. Building on this foundation, we construct rings of multisets (multinumbers), defined as equivalence classes on the underlying space under the action of -symmetric polynomials, and investigate their fundamental properties. Furthermore, we examine the ring of integer multinumbers associated with the group proving that it forms an integral domain when n is prime or