Related papers: On the Schaper Number of Partitions
A popular numerical method to compute SOS (sum of squares of polynomials) decompositions for polynomials is to transform the problem into semi-definite programming (SDP) problems and then solve them by SDP solvers. In this paper, we focus…
A widely used method for solving SOS (Sum Of Squares) decomposition problem is to reduce it to the problem of semi-definite programs (SDPs) which can be efficiently solved in theory. In practice, although many SDP solvers can work out some…
In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to…
Permutation modules play an important role in the representation theory of the symmetric group. Hartmann and Paget defined permutation modules for non-degenerate Brauer algebras. We generalise their construction to a wider class of…
We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…
We constructively determine the Pietsch measure of the 2-summing multiplication operator \[\mathcal{M}_u:\ell^{\infty} \rightarrow H^p, \quad (\varphi_I) \mapsto \sum \varphi_Ix_Ih_I. \] Our construction of the Pietsch measure for the…
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…
In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…
The purpose of this short article is to announce, and briefly describe, a Maple package, PARTITIONS, that (inter alia) completely automatically discovers, and then proves, explicit expressions (as sums of quasi-polynomials) for pm(n) for…
We study partitions of complex numbers as sums of non-negative powers of a fixed algebraic number $\beta$. We prove that if $\beta$ is real quadratic, then the number of partitions is always finite if and only if some conjugate of $\beta$…
For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…
The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…
Consideration of a classification of the number of partitions of a natural number according to the members of sub-partitions differing from unity leads to a non-recursive formula for the number of irreducible representations of the…
We introduce a way of describing cohomology of the symmetric groups with coefficients in Specht modules over Z or F_p. We study i-th-degree cohomology for i in {0,1,2}. The focus lies on the isomorphism type of second-degree cohomology of…
We prove a ``positive'' Jantzen sum formula for the Specht modules of the cyclotomic Hecke algebras of type~$A$. That is, in the Grothendieck group, we show that the sum of the pieces of the Jantzen filtration is equal to an explicit…
We give a bound on the order of the Schur multiplier of $p$-groups refining earlier bounds. As an application we complete the classification of groups having Schur multiplier of maximum order. Finally we prove that the order of the Schur…
We make an application of ideas from partition theory to a problem in multiplicative number theory. We propose a deterministic model of prime number distribution, from first principles related to properties of integer partitions, that…
While there has been some progress on the decomposition of Kronecker products of characters of the symmetric groups in recent times, results on the symmetric and alternating part of Kronecker squares are still scarce. Here, new results (and…
The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase…