中文
相关论文

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

200 篇论文

The Stirling numbers of type $B$ of the second kind count signed set partitions. In this paper we provide new combinatorial and analytical identities regarding these numbers as well as Broder's $r$-version of these numbers. Among these…

组合数学 · 数学 2024-04-08 Takao Komatsu , Eli Bagno , David Garber

In this paper, we introduce the power-partible reduction for holonomic (or, P-recursive) sequences and apply it to obtain a series of congruences for Ap\'ery numbers $A_k$. In particular, we prove that, for any $r\in\mathbb{N}$, there…

组合数学 · 数学 2024-07-16 Rong-Hua Wang , Michael X. X. Zhong

We continue the study of the rational-slope generalized $q,t$-Catalan numbers $c_{m,n}(q,t)$. We describe generalizations of the bijective constructions of J. Haglund and N. Loehr and use them to prove a weak symmetry property…

代数几何 · 数学 2013-12-24 Evgeny Gorsky , Mikhail Mazin

In this paper we prove a new recurrence relation on the van der Waerden numbers, $w(r,k)$. In particular, if $p$ is a prime and $p\leq k$ then $w(r, k) > p \cdot \left(w\left(r - \left\lceil \frac{r}{p}\right\rceil, k\right) -1\right)$.…

组合数学 · 数学 2018-07-27 Thomas Blankenship , Jay Cummings , Vladislav Taranchuk

A subset $A$ of a Boolean algebra $B$ is said to be $(n,m)$-reaped if there is a partition of unity $P \subset B$ of size $n$ such that the cardinality of $\{b \in P: b \wedge a \neq \emptyset\}$ is greater than or equal to $m$ for all…

逻辑 · 数学 2008-02-03 A. Dow , J Steprāns , W. S. Watson

In this paper, we show that the difference between the number of parts in the odd partitions of $n$ and the number of parts in the distinct partitions of $n$ satisfies Euler's recurrence relation for the partition function $p(n)$ when $n$…

组合数学 · 数学 2020-05-08 Mircea Merca

Let $S_r(p,q)$ be the $r$-associated Stirling numbers of the second kind, the number of ways to partition a set of size $p$ into $q$ subsets of size at least $r$. For $r=1$, these are the standard Stirling numbers of the second kind, and…

组合数学 · 数学 2024-09-04 E. Rodney Canfield , J. William Helton , Jared A. Hughes

In this note we will give various exact formulas for functions on integer partitions including the functions $p(n)$ and $p(n,k)$ of the number of partitions of $n$ and the number of such partitions into exactly $k$ parts respectively. For…

数论 · 数学 2015-03-17 Mohamed El Bachraoui

Asymptotic formulas of the number of various partitions are studied, like 3-colored partitions, concave partitions, certain plane partitions, partitions without small parts, the number of p-rings.

数论 · 数学 2007-05-23 Gert Almkvist

Diaconis and Griffiths (2014) study the multivariate Krawtchouk polynomials orthogonal on the multinomial distribution. In this paper we derive the reproducing kernel orthogonal polynomials Q_n(x,y};N,p) on the multinomial distribution…

概率论 · 数学 2019-02-06 Persi Diaconis , Robert Griffiths

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

组合数学 · 数学 2012-07-16 Noga Alon

We present a higher genus generalization of $bc$-Motzkin numbers, which are themselves a generalization of Catalan numbers, and we derive a recursive formula which can be used to calculate them. Further, we show that this leads to a…

组合数学 · 数学 2021-11-29 Cooper Jacob

Let $\overline{\mathrm{spt}}k(n)$ denote the number of overpartitions of $n$ where the smallest non-overlined part, say $s(\pi)$, appears $k$ times and every overlined part is bigger than $s(\pi)$. Let $\overline{\mathrm{spt}}k_o(n)$ denote…

组合数学 · 数学 2026-02-03 Nayandeep Deka Baruah , Haijun Li , Pankaj Jyoti Mahanta

We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…

组合数学 · 数学 2007-05-23 V. U. Pierce

In this work, we investigate the arithmetic properties of $p_{1,7^k}(n)$, which counts 2-color partitions of $n$ where one of the colors appears only in parts that are multiples of $7^k$. By constructing generating functions for…

数论 · 数学 2025-04-03 D. S. Gireesh , Shivashankar C. , HemanthKumar B

We revisit Euler's partition function recurrence, which asserts, for integers $n\geq 1,$ that $$ p(n)=p(n-1)+p(n-2)-p(n-5)-p(n-7)+\dots = \sum_{k\in \mathbb{Z}\setminus \{0\}} (-1)^{k+1} p(n-\omega(k)), $$ where $\omega(m):=(3m^2+m)/2$ is…

数论 · 数学 2025-04-22 Kevin Gomez , Ken Ono , Hasan Saad , Ajit Singh

In this paper, we investigate $\pi(m,n)$, the number of partitions of the \emph{bipartite number} $(m,n)$ into \emph{steadily decreasing} parts, introduced by L.Carlitz ['A problem in partitions', Duke Math Journal 30 (1963), 203--213]. We…

数论 · 数学 2020-02-11 Nian Hong Zhou

We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…

组合数学 · 数学 2015-05-28 José Agapito , Ângela Mestre , Pasquale Petrullo , Maria M. Torres

Generalizing some popular sequences like Catalan's number, Schr\"oder's number, etc, we consider the sequence $s_n$ with $s_0=1$ and for $n\ge 1$, \begin{multline*} s_n=\sum_{x_1+\dots+x_{\ell_1}=n-1} \kappa_1 s_{x_1}\dots s_{x_{\ell_1}} +…

组合数学 · 数学 2024-10-25 Vuong Bui

We formulate and prove a general recurrence relation that applies to integrals involving orthogonal polynomials and similar functions. A special case are connection coefficients between two sets of orthonormal polynomials, another example…

经典分析与常微分方程 · 数学 2023-08-17 Jing Gao , Arieh Iserles
‹ 上一页 1 8 9 10 下一页 ›