中文
相关论文

相关论文: Overpartitions and Bressoud's conjecture, II

200 篇论文

Motivated by Andrews' recent work related to Euler's partition theorem, we consider the set of partitions of an integer $n$ where the set of even parts has exactly $j$ elements, versus the set of partitions of $n$ where the set of repeated…

组合数学 · 数学 2017-05-16 Shishuo Fu , Dazhao Tang

In this paper, we present a generalization of one of the theorems in [G. E. Andrews, Partitions with parts separated by parity, \textit{Annals of Combinatorics} \textbf{23}(2019), 241 - 248], and give its bijective proof. Further variations…

数论 · 数学 2021-08-31 Abdulaziz M. Alanazi , Darlison Nyirenda

We present a conjecture about partitions, with a very elementary formulation.

组合数学 · 数学 2007-05-23 Michel Lassalle

In this paper, we develop the method of circle of partitions and associated statistics. As an application we prove conditionally the binary Goldbach conjecture. We develop a series of steps to prove the binary Goldbach conjecture in full.…

数论 · 数学 2026-03-16 Theophilus Agama

We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over…

组合数学 · 数学 2014-12-30 Jehanne Dousse , Byungchan Kim

In a recent paper, Thejitha and Fathima introduced the overcolored partition function $\bar{a}_{r,s}(n)$, which enumerates overpartitions in which even parts may appear in one of $r$ colors and odd parts in one of $s$ colors, for fixed…

数论 · 数学 2026-03-16 Imdadul Hussain , Suparno Ghoshal , Arijit Jana

In this paper, we are motivated by two conjectures proposed by C. Bender et al.\ in 2024, which have remained open questions. The first conjecture states that if the complemented zero-divisor graph \( G(S) \) of a commutative semigroup \( S…

组合数学 · 数学 2025-06-23 Anagha Khiste , Ganesh Tarte , Vinayak Joshi

Recently, the concept of parity bias in integer partitions has been studied by several authors. We continue this study here, but for non-unitary partitions (namely, partitions with parts greater than $1$). We prove analogous results for…

数论 · 数学 2026-01-12 Pankaj Jyoti Mahanta , Manjil P. Saikia , Abhishek Sarma

We consider $(k,j)$-colored partitions, partitions in which $k$ colors exist but at most $j$ colors may be chosen per size of part. In particular these generalize overpartitions. Advancing previous work, we find new congruences, including…

组合数学 · 数学 2020-01-24 William J. Keith

In this article we encode Hadwiger's covering conjecture and Borsuk's partition conjecture into continuous functions defined on the spaces of convex bodies, propose a four-step program to approach them, and obtain some partial results.

度量几何 · 数学 2010-07-14 Chuanming Zong

This paper proves a conjecture proposed by Ren and Li (2015: 393, \emph{Journal of Inequalities and Applications}). Our result eliminates the constraints on the parity and size of $m$, as well as the restriction $x > 1$, required in Ren and…

经典分析与常微分方程 · 数学 2025-09-29 Yongbing Luo , Ping Yan

We prove a partition identity conjectured by Lassalle (Adv. in Appl. Math. 21 (1998), 457-472).

组合数学 · 数学 2007-05-23 Theresia Eisenkölbl

We prove that the overpartition function is log-concave for all n>1. The proof is based on Sills Rademacher type series for the overpartition function and inspired by Desalvo and Pak's proof for the partition function.

数论 · 数学 2014-12-23 Benjamin Engel

Recently, several mathematicians have investigated various partition functions with the goal of discovering Ramanujan-type congruences. One such function is $\overline{B}_{2^\alpha}(n)$, which represents the number of $2^\alpha-$regular…

数论 · 数学 2025-02-25 Hemanthkumar B. , Sumanth Bharadwaj H. S

We prove three main conjectures of Berkovich and Uncu (Ann. Comb. 23 (2019) 263--284) on the inequalities between the numbers of partitions of $n$ with bounded gap between largest and smallest parts for sufficiently large $n$. Actually our…

组合数学 · 数学 2020-04-29 Wenston J. T. Zang , Jiang Zeng

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

组合数学 · 数学 2011-09-05 Cheng Yeaw Ku , Kok Bin Wong

In this paper, we study the Br\"{u}ck conjecture \cite{Bruck-1996} by interpreting it through solutions of first-order partial differential equations in several complex variables. Our results show that the Br\"{u}ck conjecture…

复变函数 · 数学 2026-01-27 Sujoy Majumder , Nabadwip Sarkar , Debabrata Pramanik

A theorem of Andrews equates partitions in which no part is repeated more than 2k-1 times to partitions in which, if j appears at least k times, all parts less than j also do so. This paper proves the theorem bijectively, with some of the…

组合数学 · 数学 2010-10-14 William J. Keith

We investigate progressions in the set of pairs of integers $\mathbb{Z}^2$ and define a generalisation of the Jacobsthal function. For this function, we conjecture a specific upper bound and prove that this bound would be a sufficient…

数论 · 数学 2017-06-02 Mario Ziller , John F. Morack

We continue our study of the density of the odd values of eta-quotients, here focusing on the $m$-regular partition functions $b_m$ for $m$ even. Based on extensive computational evidence, we propose an elegant conjecture which, in…

组合数学 · 数学 2023-06-08 William J. Keith , Fabrizio Zanello