Related papers: On the Schaper Number of Partitions

We consider the equal sum partition problem, motivated by distance magic graph labeling: Given $n,k \in \N$ such that $k\, | \sum_{i=1}^ni$ and a partition $p_1+\cdots+p_k=n$, when is it possible to find a partition of the set…

Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

In this note, we obtain a formula which leads to a practical and efficient method to calculate the number of partitions of n into parts not divisible by m for given natural numbers n and m.

Using purely combinatorial methods we calculate the first degree cohomology of Specht modules indexed by two part partitions over fields of characteristic $p\ge 3$. These combinatorial methods also allow us to obtain an explicit description…

An $(n,k)$-Sperner partition system is a set of partitions of some $n$-set such that each partition has $k$ nonempty parts and no part in any partition is a subset of a part in a different partition. The maximum number of partitions in an…

The restriction of a (dual) Specht module to a smaller symmetric group has a filtration by (dual) Specht modules of this smaller group. In the cellular structure of the group algebra of the symmetric group, the cell modules are exactly the…

We derive a formula for $p(n)$ (the number of partitions of $n$) in terms of the partial Bell polynomials using Fa\`{a} di Bruno's formula and Euler's pentagonal number theorem.

Numerous congruences for partitions with designated summands have been proven since first being introduced and studied by Andrews, Lewis, and Lovejoy. This paper explicitly characterizes the number of partitions with designated summands…

Let $p$ be a prime. In this paper, we compute complexities of some simple modules of symmetric groups labelled by two-part partitions. Most of the simple modules considered here are contained in the $p$-blocks with non-abelian defect…

The number partition problem is a well-known problem, which is one of 21 Karp's NP-complete problems \cite{karp}. The partition function is a boolean function that is equivalent to the number partition problem with number range restricted.…

For $ k \in \mathbb{N}$ we introduce an idempotent subalgebra, the spherical partition algebra ${\mathcal{SP} }_{k}$, of the partition algebra ${\mathcal{P} }_{k}$, that we define using an embedding associated with the trivial…

Cluster analysis aims at partitioning data into groups or clusters. In applications, it is common to deal with problems where the number of clusters is unknown. Bayesian mixture models employed in such applications usually specify a…

Let $p$ be a prime number, $G$ a finite group, $P$ a $p$-subgroup of $G$ and $k$ an algebraically closed field of characteristic $p$. We study the relationship between the category $\Ff_P(G)$ and the behavior of $p$-permutation $kG$-modules…

The Schmidt decomposition is an important tool in the study of quantum systems especially for the quantification of the entanglement of pure states. However, the Schmidt decomposition is only unique for bipartite pure states, and some…

We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. Our proof naturally leads to a formula for the number of partitions with a given parity of the smallest part, in terms of S(i), the number of…

Pati (Physics Letters A, 2000) derived a sufficient condition for the existence of Schmidt decomposition in tripartite Hilbert spaces. In this paper, we show that the condition is erroneous by demonstrating some counter-examples. Moreover,…

An $(n,k)$-Sperner partition system is a collection of partitions of some $n$-set, each into $k$ nonempty classes, such that no class of any partition is a subset of a class of any other. The maximum number of partitions in an…