English
Related papers

Related papers: A product of integer partitions

200 papers

The number partitioning problem consists of partitioning a sequence of positive numbers ${a_1,a_2,..., a_N}$ into two disjoint sets, ${\cal A}$ and ${\cal B}$, such that the absolute value of the difference of the sums of $a_j$ over the two…

Statistical Mechanics · Physics 2009-10-31 F. F. Ferreira , J. F. Fontanari

The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{n+1}\binom{2n}{n}$ when $\Psi=A_{n-1}$, and the binomial $\binom{2n}{n}$ when $\Psi=B_n$, and these numbers coincide with the correspondent…

Combinatorics · Mathematics 2011-11-14 Ricardo Mamede

We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…

Algebraic Topology · Mathematics 2022-05-11 Scott M. Bailey , Donald M. Larson

Recently, Blecher and Knopfmacher explored the notion of fixed points in integer partitions. Here, we distinguish partitions with a fixed point by which value is fixed and analyze the resulting triangle of integers. In particular, we…

Combinatorics · Mathematics 2024-05-21 Brian Hopkins

Motivated by the convolutive behavior of the counting function for partitions with designated summands in which all parts are odd, we consider coefficient sequences $(a_n)_{n\ge 0}$ of primitive eta-products that satisfy the generic…

Combinatorics · Mathematics 2025-12-05 Shane Chern , Dennis Eichhorn , Shishuo Fu , James A. Sellers

To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…

Group Theory · Mathematics 2018-04-24 Akram Yousofzadeh

This is a note for constructing fundamental invariants and computing the Hilbert series of the invariant subalgebras of tensor products of polynomial rings under the action by a direct product of symmetric groups. Our computation relies on…

Combinatorics · Mathematics 2021-03-04 Zhipeng Lu

Based on the author's previous work on the Jacobi identity for twisted relative vertex operator algebras and modules and on the generating function identities for affine Lie algebras, we interpret the second difference sequence of the…

Number Theory · Mathematics 2018-04-27 Cristiano Husu

Consider these two distinct combinatorial objects: (1) the necklaces of length $n$ with at most $q$ colors, and (2) the multisets of integers modulo $n$ with subset sum divisible by $n$ and with the multiplicity of each element being…

Combinatorics · Mathematics 2024-12-02 Swee Hong Chan

We introduce a notion of partition wreath product of a finite group by a partition quantum group, a construction motivated on the one hand by classical wreath products and on the other hand by the free wreath product of J. Bichon. We…

Quantum Algebra · Mathematics 2015-11-16 Amaury Freslon , Adam Skalski

We present a new partition identity and give a combinatorial proof of our result. This generalizes a result of Andrew's in which he considers the generation function for partitions with respect to size, number of odd parts, and number of…

Combinatorics · Mathematics 2007-05-23 Cilanne E. Boulet

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…

Combinatorics · Mathematics 2023-03-22 Cristina Ballantine , George Beck

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

Number Theory · Mathematics 2021-01-25 Zachary Hoelscher , Eyvindur Ari Palsson

The purpose of this paper is to present a collection of interesting generating functions for partitions which have connections to positive definite binary quadratic forms. In establishing our results we obtain some new Bailey pairs.

Number Theory · Mathematics 2019-03-19 Alexander E Patkowski

To flatten a set partition (with apologies to Mathematica) means to form a permutation by erasing the dividers between its blocks. Of course, the result depends on how the blocks are listed. For the usual listing--increasing entries in each…

Combinatorics · Mathematics 2008-02-18 David Callan

Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…

Combinatorics · Mathematics 2011-06-16 William Y. C. Chen , Daniel K. Du , Charles B. Mei

For a fixed positive integer $m$ and any partition $m = m_1 + m_2 + \cdots + m_e$ , there exists a sequence $\{n_{i}\}_{i=1}^{k}$ of positive integers such that $$m=\frac{1}{n_{1}}+\frac{1}{n_{2}}+\cdots+\frac{1}{n_{k}},$$ with the property…

Number Theory · Mathematics 2019-09-11 Yuchen Ding , Yu-Chen Sun

For a family of unital free *-algebras with a family of states on them, we construct a sequence of noncommutative probability spaces, which are tensor product algebras with tensor product states and which approximate the free product of…

Quantum Algebra · Mathematics 2014-07-25 Romuald Lenczewski

We demonstrate that statistics of certain classes of set partitions is described by generating functions related to the Burgers, Ibragimov--Shabat and Korteweg--de Vries integrable hierarchies.

Exactly Solvable and Integrable Systems · Physics 2015-07-07 V. E. Adler

A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split into sections by the introduction of a…

Combinatorics · Mathematics 2015-04-07 S. Nkonkobe , V. Murali