中文
相关论文

相关论文: The Raney Numbers and $(s,s+1)$-Core Partitions

200 篇论文

I propose two simple ways of generating the partitions of (n+1) from the partitions of n. A recurrence relation for P(n+1), the number of partitions of (n+1), in terms of P(n) and Q(n), where Q(n) denotes the number of partitions of n…

综合数学 · 数学 2007-05-23 Dhananjay P. Mehendale

Using a combinatorial bijection with certain abaci diagrams, Nath and Sellers have enumerated $(s, m s \pm 1)$-core partitions into distinct parts. We generalize their result in several directions by including the number of parts of these…

组合数学 · 数学 2019-10-15 Hannah E. Burson , Simone Sisneros-Thiry , Armin Straub

The Catalan numbers constitute one of the most important sequences in combinatorics. Catalan objects have been generalized in various directions, including the classical Fuss-Catalan objects and the rational Catalan generalization of…

组合数学 · 数学 2018-05-11 Cesar Ceballos , Rafael S. González D'León

We establish a recursive relation for the bipartition number $p_2(n)$ which might be regarded as an analogue of Euler's recursive relation for the partition number $p(n)$. Two proofs of the main result are proved in this article. The first…

组合数学 · 数学 2024-06-24 Yen-Chi Roger Lin , Shu-Yen Pan

An n-core partition is an integer partition whose Young diagram contains no hook lengths equal to n. We consider partitions that are simultaneously a-core and b-core for two relatively prime integers a and b. These are related to abacus…

组合数学 · 数学 2014-04-23 Drew Armstrong , Christopher R. H. Hanusa , Brant C. Jones

Amdeberhan conjectured that the number of $(s,s+2)$-core partitions with distinct parts for an odd integer $s$ is $2^{s-1}$. This conjecture was first proved by Yan, Qin, Jin and Zhou, then subsequently by Zaleski and Zeilberger. Since the…

组合数学 · 数学 2017-05-10 Jineon Baek , Hayan Nam , Myungjun Yu

In 2008, Spivey found a recurrence relation for the Bell numbers. We consider the probabilistic r-Bell polynomials associated with which are a probabilistic extension of the r-Bell polynomials. Here Y is a random variable whose moment…

数论 · 数学 2024-04-04 Taekyun Kim , Dae San Kim

Let $\overline{p}_o(n)$ denote the number of overpartitions of $n$ into odd parts. The partition function $\overline{p}_o(n)$ has been the subject of many recent studies where many explicit Ramanujan-like congruences were discovered. In…

数论 · 数学 2024-03-12 Deepthi G. , S. Chandankumar

In a recent paper (Tran et al., Ann.Phys.311(2004)204), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We…

数学物理 · 物理学 2009-11-11 C. S. Srivatsan , M. V. N. Murthy , R. K. Bhaduri

Integer partitions have long been of interest to number theorists, perhaps most notably Ramanujan, and are related to many areas of mathematics including combinatorics, modular forms, representation theory, analysis, and mathematical…

数论 · 数学 2020-10-20 Adriana L. Duncan , Simran Khunger , Holly Swisher , Ryan Tamura

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…

离散数学 · 计算机科学 2010-12-30 Manosij Ghosh Dastidar , Sourav Sen Gupta

A partition on $[n]$ has a crossing if there exists $i\_1<i\_2<j\_1<j\_2$ such that $i\_1$ and $j\_1$ are in the same block, $i\_2$ and $j\_2$ are in the same block, but $i\_1$ and $i\_2$ are not in the same block. Recently, Chen et al.…

组合数学 · 数学 2009-01-23 Mireille Bousquet-Mélou , Guoce Xin

A generalized Catalan matrix $(a_{n,k})_{n,k\ge 0}$ is generated by two seed sequences $\mathbf{s}=(s_0,s_1,\ldots)$ and $\mathbf{t}=(t_1,t_2,\ldots)$ together with a recurrence relation. By taking $s_\ell=2\ell+1$ and $t_\ell=\ell^2$ we…

组合数学 · 数学 2022-07-22 Yen-Jen Cheng , Sen-Peng Eu , Hsiang-Chun Hsu

Let $\kappa$ be a positive real number and $m\in\mathbb{N}\cup\{\infty\}$ be given. Let $p_{\kappa, m}(n)$ denote the number of partitions of $n$ into the parts from the Piatestki-Shapiro sequence $(\lfloor \ell^{\kappa}\rfloor)_{\ell\in…

数论 · 数学 2021-04-06 Nian Hong Zhou , Ya-Li Li

A Catalan pair is a pair of binary relations (S,R) satisfying certain axioms. These objects are enumerated by the well-known Catalan numbers, and have been introduced with the aim of giving a common language to most of the structures…

离散数学 · 计算机科学 2010-11-17 Stefano Bilotta , Filippo Disanto , Renzo Pinzani , Simone Rinaldi

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…

组合数学 · 数学 2022-01-25 Hannah Constantin , Benjamin Houston-Edwards , Nathan Kaplan

Let $p$ be a prime and let $a$ be a positive integer. In this paper we investigate $\sum_{k=0}^{p^a-1}\binom[(h+1)k,k+d]/m^k$ modulo a prime $p$, where $d$ and $m$ are integers with $-h<d<=p^a$ and $m\not=0 (mod p)$. We also study…

数论 · 数学 2009-09-28 Zhi-Wei Sun

Let ${p}_{3,3}(n)$ denote the number of $2$-color partition triples of $n$ where one of the colors appears only in parts that are multiples of $3$. In this paper, we shall establish some interesting Ramanujan-type congruences for…

数论 · 数学 2018-03-08 Shane Chern , Chun Wang

We prove some general recursions for the numbers of representations of positive integers as a sum x+y, x in X, y in Y, where X,Y are increasing sequences. In particular, we obtain recursions for the number of the Goldbach, Lemoine-Levy,…

数论 · 数学 2013-07-16 Vladimir Shevelev

Let $A_{t,k}(n)$ denote the number of partition $k$-tuples of $n$ where each partition is $t$-core. In this paper, we establish formulas of $A_{t,k}(n)$ for some values of $t$ and $k$ by employing the method of modular forms, which extends…

数论 · 数学 2016-02-05 Shane Chern