English
Related papers

Related papers: Partition number identities which are true for all…

200 papers

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…

Combinatorics · Mathematics 2022-05-13 Damanvir Singh Binner

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…

Combinatorics · Mathematics 2025-10-02 Krystian Gajdzica , Robin Visser , Maciej Zakarczemny

Zeckendorf proved that every positive integer has a unique partition as a sum of non-consecutive Fibonacci numbers. Similarly, every natural number can be partitioned into a sum of non-consecutive terms of the Lucas sequence, although such…

Number Theory · Mathematics 2021-08-31 Hung V. Chu , David C. Luo , Steven J. Miller

Using a new presentation for partition algebras (J. Algebraic Combin. 37(3):401-454, 2013), we derive explicit combinatorial formulae for the seminormal representations of the partition algebras. These results generalise to the partition…

Quantum Algebra · Mathematics 2013-07-04 John Enyang

A partition of the positive integers into sets $A$ and $B$ {\em avoids} a set $S\subset\N$ if no two distinct elements in the same part have a sum in $S$. If the partition is unique, $S$ is {\em uniquely avoidable.} For any irrational…

Combinatorics · Mathematics 2016-09-07 David J. Grabiner

We prove various inequalities between the number of partitions with the bound on the largest part and some restrictions on occurrences of parts. We explore many interesting consequences of these partition inequalities. In particular, we…

Combinatorics · Mathematics 2017-08-08 Alexander Berkovich , Ali K. Uncu

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of…

Combinatorics · Mathematics 2024-04-10 Pedro A. García-Sánchez , Laura González , Francesc Planas-Vilanova

Using ultrafilter techniques we show that in any partition of $\mathbb{N}$ into 2 cells there is one cell containing infinitely many exponential triples, i.e. triples of the kind $a,b,a^b$ (with $a,b>1$). Also, we will show that any…

Combinatorics · Mathematics 2011-07-19 Alessandro Sisto

We give a series of recursive identities for the number of partitions with exactly $k$ parts and with constraints on both the minimal difference among the parts and the minimal part. Using these results we demonstrate that the number of…

Combinatorics · Mathematics 2014-01-29 Ivica Martinjak , Dragutin Svrtan

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…

Combinatorics · Mathematics 2013-07-09 Godofredo Iommi Amunategui

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

Discrete Mathematics · Computer Science 2010-12-30 Manosij Ghosh Dastidar , Sourav Sen Gupta

Let $\alpha=\{a_1,a_2,a_3,...,a_n\}$ be a set of elements, $\delta < n$ be a non-negative integer, and $\Gamma: \alpha \to \{0, 1, 2, ..., n\}$ be a total mapping. Then, we call $\Gamma$ a \emph{partition} of $\alpha$ if and only if for all…

Data Structures and Algorithms · Computer Science 2021-02-04 Samer Nofal

A partition is finitary if all its blocks are finite. For a cardinal $\mathfrak{a}$ and a natural number $n$, let $\mathrm{fin}(\mathfrak{a})$ and $\mathscr{B}_{n}(\mathfrak{a})$ be the cardinalities of the set of finite subsets and the set…

Logic · Mathematics 2024-11-12 Yifan Hu , Guozhen Shen

Euler's partition identity states that the number of partitions of $n$ into odd parts is equal to the number of partitions of $n$ into distinct parts. Strikingly, Straub proved in 2016 that this identity also holds when counting partitions…

Combinatorics · Mathematics 2025-02-19 Gabriel Gray , Emily Payne , Holly Swisher , Ren Watson

We show that many theorems which assert that two kinds of partitions of the same integer $n$ are equinumerous are actually special cases of a much stronger form of equality. We show that in fact there correspond partition statistics $X$ and…

Combinatorics · Mathematics 2007-05-23 Herbert S. Wilf

We prove combinatorially some identities related to Euler's partition identity (the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts). They were conjectured by Beck and proved by Andrews…

Combinatorics · Mathematics 2018-07-02 Cristina Ballantine , Richard Bielak

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…

Combinatorics · Mathematics 2014-04-08 Christine Bessenrodt , Ken Ono

We state and prove a theorem on the partitioning of a randomly selected large population into stationary and non-stationary components by using a property of stationary population identity. Applications of this theorem for practical…

Populations and Evolution · Quantitative Biology 2021-10-20 Arni S. R. Srinivasa Rao

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

We present a number of results concerning infinite-exponent partition relations on linear orders of the form $\langle {}^\alpha 2,<_{\text{lex}}\rangle$ for $\alpha$ an ordinal, generalising the setting of the real line, working throughout…

Logic · Mathematics 2026-05-04 Lyra A. Gardiner , Jonathan Schilhan , Thilo Weinert