English
Related papers

Related papers: A Bijection for Partitions with Initial Repetition…

200 papers

In this paper we provide proofs of two new theorems that provide a broad class of partition inequalities and that illustrate a na\"ive version of Andrews' anti-telescoping technique quite well. These new theorems also put to rest any notion…

Number Theory · Mathematics 2013-03-12 Alexander Berkovich , Keith Grizzell

A classical theorem of Baranyai states that, given integers $2\leq k < n$ such that $k$ divides $n$, one can find a family of ${n-1\choose k-1}$ partitions of $[n]$ into $k$-element subsets such that every subset appears in exactly one…

Combinatorics · Mathematics 2024-10-14 Zoe Xi

A partition is finitary if all its members are finite. For a set $A$, $\mathscr{B}(A)$ denotes the set of all finitary partitions of $A$. It is shown consistent with $\mathsf{ZF}$ (without the axiom of choice) that there exist an infinite…

Logic · Mathematics 2023-09-04 Guozhen Shen

The partition function is known to exhibit beautiful congruences that are often proved using the theory of modular forms. In this paper, we study the extent to which these congruence results apply to the generalized Frobenius partitions…

Number Theory · Mathematics 2018-09-05 Marie Jameson , Maggie Wieczorek

We show that, in many cases, there are infinitely many sets of partitions corresponding to a single analytical Rogers-Ramanujan type identity. This means that a single analytical Rogers-Ramanujan type identity implies the existence of…

Combinatorics · Mathematics 2021-01-06 Pietro Mercuri

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

Number Theory · Mathematics 2007-05-23 Ken Ono

In this document we define a method of proof that we call proof by dichotomy. Its field of application is any proposition on the set of natural numbers N. It consists in the repetition of a step. A step proves the proposition for half of…

Logic · Mathematics 2023-10-09 Laurent Fallot

Holroyd, Liggett, and Romik introduced the following probability model. Let $C_1, C_2,...$ be independent events with probabilities $\P_s(C_n)= 1-e^{-ns}$ under a probability measure $\P_s$ with $0<s<1$. Let $A_k$ be the event that there is…

Number Theory · Mathematics 2012-04-24 Daniel M. Kane , Robert C. Rhoades

A partition of a positive integer $n$ is a representation of $n$ as a sum of a finite number of positive integers (called parts). A trapezoidal number is a positive integer that has a partition whose parts are a decreasing sequence of…

Number Theory · Mathematics 2020-04-22 Melvyn B. Nathanson

In 2016 Bessenrodt--Ono discovered an inequality addressing additive and multiplicative properties of the partition function. Generalization by several authors have been given; on partitions with rank in a given residue class by…

Combinatorics · Mathematics 2021-08-03 Bernhard Heim , Markus Neuhauseer

The Alder-Andrews Theorem, a partition inequality generalizing Euler's partition identity, the first Rogers-Ramanujan identity, and a theorem of Schur to $d$-distinct partitions of $n$, was proved successively by Andrews in 1971, Yee in…

Number Theory · Mathematics 2024-07-29 Leah Sturman , Holly Swisher

We look at extensions of formulas given by Jovovic and recently proved by Dhar on integer partitions where the smallest part occurs at least $m$ times and on integer partitions with fixed differences between the largest and smallest parts…

Combinatorics · Mathematics 2024-01-08 Pankaj Jyoti Mahanta , Manjil P. Saikia

A partition into distinct parts is refinable if one of its parts $a$ can be replaced by two different integers which do not belong to the partition and whose sum is $a$, and it is unrefinable otherwise. Clearly, the condition of being…

Combinatorics · Mathematics 2022-05-24 Riccardo Aragona , Lorenzo Campioni , Roberto Civino , Massimo Lauria

For an integer $m\ge 2$, a partition $\lambda=(\lambda_1,\lambda_2,\ldots)$ is called $m$-falling, a notion introduced by Keith, if the least nonnegative residues mod $m$ of $\lambda_i$'s form a nonincreasing sequence. We extend a bijection…

Combinatorics · Mathematics 2019-02-04 Shishuo Fu , Dazhao Tang , Ae Ja Yee

It is proved that the number of 9-regular partitions of n is divisible by 3 when n is congruent to 3 mod 4, and by 6 when n is congruent to 13 mod 16. An infinite family of congruences mod 3 holds in other progressions modulo powers of 4…

Combinatorics · Mathematics 2013-06-07 William J. Keith

Given an integer $n$, we introduce the integral Lie ring of partitions with bounded maximal part, whose elements are in one-to-one correspondence to integer partitions with parts in $\{1,2,\dots, n-1\}$. Starting from an abelian subring, we…

Combinatorics · Mathematics 2023-03-10 Riccardo Aragona , Roberto Civino , Norberto Gavioli

We use an injection method to prove a new class of partition inequalities involving certain $q$-products with two to four finitization parameters. Our new theorems are a substantial generalization of work by Andrews and of previous work by…

Combinatorics · Mathematics 2013-11-22 Alexander Berkovich , Keith Grizzell

A theorem of Tverberg from 1966 asserts that every set $X\subset\mathbb{R}^d$ of $n=T(d,r)=(d+1)(r-1)+1$ points can be partitioned into $r$ pairwise disjoint subsets, whose convex hulls have a point in common. Thus every such partition…

Combinatorics · Mathematics 2017-05-17 Moshe White

This paper investigates integer multiplication of continued fractions using geometric structures. In particular, this paper shows that integer multiplication of a continued fraction can be represented by replacing one triangulation of an…

Geometric Topology · Mathematics 2018-09-28 J. Blackman

We show that the number of anti-lecture hall compositions of n with the first entry not exceeding k-2 equals the number of overpartitions of n with non-overlined parts not congruent to $0,\pm 1$ modulo k. This identity can be considered as…

Combinatorics · Mathematics 2010-06-22 William Y. C. Chen , Doris D. M. Sang , Diane Y. H. Shi