Related papers: On the Schaper Number of Partitions

A general formula for the canonical partition function for a system obeying any statistics based on the permutation group is derived. The formula expresses the canonical partition function in terms of sums of Schur functions. The only…

Let $S_\lambda$ denote the Specht module defined by Dipper and James for the Iwahori-Hecke algebra $\mathscr{H}_n$ of the symmetric group $\mathfrak{S}_n$. When $e=2$ we determine the decomposability of all Specht modules corresponding to…

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

Let $B$ be an infinite subset of $\mathbf{N}$. When we consider partitions of natural numbers into elements of $B$, a partition number without a restriction of the number of equal parts can be expressed by partition numbers with a…

We study the indecomposable summands of the permutation module obtained by inducing the trivial $\mathbb{F}(S_a\wr S_n)$-module to the full symmetric group $S_{an}$ for any field $\mathbb{F}$ of odd prime characteristic $p$ such that…

Schmidt's theorem is significantly generalized, to partitions in which periodic but otherwise arbitrary subsets of parts are counted or uncounted. The identification of such sets of partitions with colored partitions satisfying certain…

For $f : \mathbb{N} \to \{0,\pm 1\}$ the $f$-signed partition numbers $\mathfrak{p}(n,f)$ are defined to be the weighted partition sums \[ \mathfrak{p}(n,f) = \sum_{\substack{x_{1}+\cdots+x_{k} = n \\ x_{1} \geq \cdots \geq x_{k} > 0 \\ k…

For any bipartite quantum system the Schmidt decomposition allows us to express the state vector in terms of a single sum instead of double sums. We show the existence of the Schmidt decomposition for tripartite system under certain…

In this paper we study the vertices of indecomposable Specht modules for symmetric groups. For any given indecomposable non-projective Specht module, the main theorem of the article describes a family of p-subgroups contained in its vertex.…

We relate the condition numbers of computing three decompositions of symmetric tensors: the canonical polyadic decomposition, the Waring decomposition, and a Tucker-compressed Waring decomposition. Based on this relation we can speed up the…

Motivated by spin modular representations of the symmetric groups, we propose two generalizations of the Schur regular partitions for an odd integer $p\geq 3$. One forms a subset of the set of $p$-strict partitions, and the other forms that…

The aim of this paper is to derive explicit formulas for two distinct values. The first is the total number of symmetric peaks in a set partition of $[n]$ with exactly $k$ blocks, and the second one is the total number of non-symmetric…

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

Set partitions are arrangements of distinct objects into groups. The problem of listing all set partitions arises in a variety of settings, in particular in combinatorial optimization tasks. After a brief review, we give practical…

Let $d(G)$ be the minimum number of elements required to generated a group $G.$ For a group $G $ of order $p^n$ with derived subgroup of order $ p^k $ and $d(G) = d,$ we knew the order of the Schur multiplier of $G$ is bounded by $…

Quantum states can be written in infinitely many ways depending on the choices of basis. Schmidt decomposition of a quantum state has a lot of properties useful in the study of entanglement. All bipartite states admit Schmidt decomposition,…

Necessary and sufficient conditions are given for the existence of extended Schmidt decompositions, with more than two subspaces.

A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…

We provide a framework for which one can approach showing the integer decomposition property for symmetric polytopes. We utilize this framework to prove a special case which we refer to as $2$-partition maximal polytopes in the case where…

Extending the partition function multiplicatively to a function on partitions, we show that it has a unique maximum at an explicitly given partition for any $n\neq 7$. The basis for this is an inequality for the partition function which…