English
Related papers

Related papers: Partition Recurrences

200 papers

We introduce new recurrences for the type B and type D Eulerian polynomials, and interpret them combinatorially. These recurrences are analogous to a well-known recurrence for the type A Eulerian polynomials. We also discuss their…

Combinatorics · Mathematics 2015-02-17 Matthew Hyatt

We present a method of computing the generating function $f_P(\x)$ of $P$-partitions of a poset $P$. The idea is to introduce two kinds of transformations on posets and compute $f_P(\x)$ by recursively applying these transformations. As an…

Combinatorics · Mathematics 2014-11-26 Daniel K. Du , Qing-Hu Hou

We study linear recurrences of Eulerian type of the form \[ P_n(v) = (\alpha(v)n+\gamma(v))P_{n-1}(v) +\beta(v)(1-v)P_{n-1}'(v)\qquad(n\ge1), \] with $P_0(v)$ given, where $\alpha(v), \beta(v)$ and $\gamma(v)$ are in most cases polynomials…

Combinatorics · Mathematics 2019-11-05 Hsien-Kuei Hwang , Hua-Huai Chern , Guan-Huei Duh

The paper introduce a new type of partitions where the largest part appears exactly once, and the remaining parts constitute a partition of that largest part. We derive the generating function associated with these partitions and…

Combinatorics · Mathematics 2025-06-16 H Kaur , M Rana

We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…

Combinatorics · Mathematics 2018-03-06 Shane Chern

The partitioning of space by hyperplanes in the context of discrete classification problem is considered. We obtain some relations for the number of partitions and establish a recurrence relation for the maximal number of partitions of R^n…

Discrete Mathematics · Computer Science 2013-12-17 Armen Bagdasaryan

This note introduces some bijections relating core partitions and tuples of integers. We apply these bijections to count the number of cores with various types of restriction, including fixed number of parts, limited size of parts, parts…

Combinatorics · Mathematics 2019-11-20 Hao Zhong

We derive an explicit formula for a restricted partition function P_n^m(s) with constraints making use of known expression for a restricted partition function W_m(s) without constraints

Combinatorics · Mathematics 2018-02-12 Leonid G. Fel

We compute Euler characteristics of p-subgroup categories of finite groups

Category Theory · Mathematics 2015-04-22 Martin Wedel Jacobsen , Jesper M. Moller

The generating function for $p_N(n)$, the number of partitions of $n$ into at most $N$ parts, may be written as a product of $N$ factors. We find the behavior of coefficients in the partial fraction decomposition of this product as $N \to…

Number Theory · Mathematics 2015-07-30 Cormac O'Sullivan

An attempt is described to extend the notion of Schur functions from Young diagrams to plane partitions. The suggestion is to use the recursion in the partition size, which is easily generalized and deformed. This opens a possibility to…

High Energy Physics - Theory · Physics 2018-12-05 A. Morozov

Recently, George Andrews has given a Glaisher style proof of a finite version of Euler's partition identity. We generalise this result by giving a finite version of Glaisher's partition identity. Both the generating function and bijective…

Combinatorics · Mathematics 2016-12-06 Darlison Nyirenda

We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…

Combinatorics · Mathematics 2007-12-12 Anisse Kasraoui , Jiang Zeng

We consider sequences of polynomials that satisfy differential-difference recurrences. Polynomials satisfying such recurrences frequently appear as generating polynomials of integer valued random variables that are of interest in discrete…

Combinatorics · Mathematics 2024-03-07 Paweł Hitczenko

In this paper, we will introduce Bell numbers $D(n)$ of type $D$ as an analogue to the classical Bell numbers related to all the partitions of the set $[n]$. Then based on a signed set partition of type $D$, we will construct the recurrence…

Combinatorics · Mathematics 2025-04-24 Hasan Arslan , Nazmiye Alemdar , Mariam Zaarour , Hüseyin Altındiş

In this paper we present a simple method for deriving recurrence relations and we apply it to obtain two equations involving the Lerch Phi function and sums of Bernoulli and Euler polynomials. Connections between these results and those…

Number Theory · Mathematics 2007-05-23 Marco Dalai

Let $n$ and $t$ be positive integers with $t\geq 2$. Let $R_t(n)$ be the number of $t$-regular partitions of $n$. A class of functions, denoted $\tau_k(n)$, is defined as follows:…

Number Theory · Mathematics 2025-10-01 S. Sriram , A. David Christopher

These lecture notes provide a self-contained introduction to Euler integrals, which are frequently encountered in applications. In particle physics, they arise as Feynman integrals or string amplitudes. Our four selected topics demonstrate…

Mathematical Physics · Physics 2023-11-01 Saiei-Jaeyeong Matsubara-Heo , Sebastian Mizera , Simon Telen

Recurrence coefficients of semi-classical orthogonal polynomials (orthogonal polynomials related to a weight function $w$ such that $w'/w$ is a rational function) are shown to be solutions of non linear differential equations with respect…

Classical Analysis and ODEs · Mathematics 2016-09-06 Alphonse P. Magnus

We introduce a new generalization of Euler's $\varphi$-function associated with a system of polynomials of several variables. We reprove by a short direct approach certain known related identities, and study some other special cases that do…

Number Theory · Mathematics 2025-08-27 Norbert Csizmazia , László Tóth