Related papers: On the Schaper Number of Partitions

In this paper, we consider a subclass of quantum states in the multipartite system, namely, the supersymmetric states. We investigate the problem whether they admit the symmetrically separable decomposition, i.e., each term in this…

In this article, we first investigate the partitions whose parts are congruent to $a$ or $b$ modulo $k$ with the aid of separable integer partition classes with modulus $k$ introduced by Andrews. Then, we introduce the…

In [14] Hemmer conjectures that the module of fixed points for the symmetric group $\Sigma_m$ of a Specht module for $\Sigma_n$ (with $n>m$), over a field of positive characteristic $p$, has a Specht series, when viewed as a…

In a previous paper of the second author with K. Ono, surprising multiplicative properties of the partition function were presented. Here, we deal with $k$-regular partitions. Extending the generating function for $k$-regular partitions…

In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…

Previous work showed that, for $\nu_2(n)$ the number of partitions of $n$ into exactly two part sizes, one has $\nu_2(16n + 14) \equiv 0 \pmod{4}$. The earlier proof required the technology of modular forms, and a combinatorial proof was…

This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size.

Partitions of the set of primes are introduced based on the Chebyshev polynomials at rationals. The prime densities of all such partitions are established. Euler's Criterion for $SL(2,\mathbb Q)$ is formulated, which is the bridge between…

Elementary proofs are given for sums of Schur functions over partitions into at most n parts each less than or equal to m for which i) all parts are even, ii) all parts of the conjugate partition are even. Also, an elementary proof of a…

Let $p$ be a prime and $\mathbb{F}$ a field of characteristic $p$, and let $\mathcal{H}_n$ denote the Iwahori--Hecke algebra of the symmetric group $\mathfrak{S}_n$ over $\mathbb{F}$ at $q=-1$. We prove that there are only finitely many…

Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…

Let $r \geq 0$, and let $\lambda$ and $\mu$ be partitions such that $\lambda_1 \leq r + 1$. We present a combinatorial interpretation of the plethysm coefficient $\langle s_\lambda, s_\mu[s_r] \rangle$. As a consequence, we solve the…

We investigate the construction and performance of summation-by-parts (SBP) operators, which offer a powerful framework for the systematic development of structure-preserving numerical discretizations of partial differential equations.…

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

Sometimes we need the approximate value of the partition number in a simple and efficient way. There are already several formulae to calculate the partition number p(n). But they are either inconvenient for most people (not majored in math)…

We consider the following "partition and sum" operation on a natural number: Treating the number as a long string of digits insert several plus signs in between some of the digits and carry out the indicated sum. This results in a smaller…

This paper is about how to partition decision variables while decomposing a large-scale optimization problem for the best performance of distributed solution methods. Solving a large-scale optimization problem sequen- tially can be…

We classify the subsets of a group by their sizes, formalize the basic methods of partitions and apply them to partition a group to subsets of prescribed sizes.

Inspired by the `computable cross norm' or `realignment' criterion, we propose a new point of view about the characterization of the states of bipartite quantum systems. We consider a Schmidt decomposition of a bipartite density operator.…

We formulate the statistics of the discrete multicomponent fragmentation event using a methodology borrowed from statistical mechanics. We generate the ensemble of all feasible distributions that can be formed when a single integer…