English
Related papers

Related papers: Fuss-Catalan numbers and planar partitions

200 papers

We introduce the $q,t$-Catalan measures, a sequence of piece-wise polynomial measures on $\mathbb{R}^2$. These measures are defined in terms of suitable area, dinv, and bounce statistics on continuous families of paths in the plane, and…

Combinatorics · Mathematics 2024-02-21 Ian Cavey

Let $p_{-r}(n)$ denote the $r$-coloured partition function, and $\sigma(n)=\sum_{d|n}d$ denote the sum of positive divisors of $n$. The aim of this note is to prove the following $$…

General Mathematics · Mathematics 2020-08-10 Sumit Kumar Jha

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

Combinatorics · Mathematics 2018-12-05 Yuriy Choliy , Andrew V. Sills

We consider compositions of natural numbers when there are different types of each natural number. Several recursions as well as some closed formulas for the number of compositions is derived. We also find its relationships with some known…

Combinatorics · Mathematics 2010-12-17 Milan Janjic

By using techniques of poset representation theory, we present a formula for the number of partitions of a positive integer into three polygonal numbers.

Combinatorics · Mathematics 2008-12-02 Agustin Moreno

We derive expressions for the partition function p(n), with n in the form 7k+a, as (k+1)-dimensional determinants.

Number Theory · Mathematics 2011-06-17 Jerome Malenfant

We consider planar cubic maps, i.e. connected cubic graphs imbedded into plane, with marked spanning tree and marked directed edge (not in this tree). The number of such objects with $2n$ vertices is $C_{2n}\cdot C_{n+1}$, where $C_k$ is…

Combinatorics · Mathematics 2016-08-09 Yury Kochetkov

We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…

Algebraic Topology · Mathematics 2022-05-11 Scott M. Bailey , Donald M. Larson

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

Combinatorics · Mathematics 2015-12-15 Clifford Smyth

We study certain series with Catalan numbers and reciprocal Catalan numbers, respectively, and provide seemingly new closed form evaluations of these series with Fibonacci (Lucas) entries. In addition, we state some combinatorial sums that…

Combinatorics · Mathematics 2022-04-12 Kunle Adegoke , Robert Frontczak , Taras Goy

In this note, we polynomially reduce an instance of the partition problem to a dynamic lot sizing problem, and show that solving the latter problem solves the former problem. By solving the dynamic program formulation of the dynamic lot…

Computational Complexity · Computer Science 2025-12-24 Chee-Khian Sim

Using $P(n,m)$, the number of integer partitions of $n$ into exactly $m$ parts, which was the subject of an earlier paper, $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, can be…

Combinatorics · Mathematics 2022-11-23 M. J. Kronenburg

Integer partitions are one of the most fundamental objects of combinatorics (and number theory), and so is enumerating objects avoiding patterns. In the present paper we describe two approaches for the systematic counting of classes of…

Combinatorics · Mathematics 2019-10-29 Mingjia Yang , Doron Zeilberger

For a positive integer $n$, let $p(n)$ be the number of ways to express $n$ as a sum of positive integers. In this note, we revisit the derivation of the Rademacher's convergent series for $p(n)$ in a pedagogical way, with all the details…

Number Theory · Mathematics 2023-02-09 Ze-Yong Kong , Lee-Peng Teo

We define, for an arbitrary partially ordered set, a multi-variable polynomial generalizing the hook polynomial.

Combinatorics · Mathematics 2015-06-10 Oleg Ogievetsky , Senya Shlosman

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…

Combinatorics · Mathematics 2007-05-23 William M. Y. Goh , Pawel Hitczenko , Ali Shokoufandeh

Let $p_{\textrm{dsd}} (n)$ be the number of partitions of $n$ into distinct squarefree divisors of $n$. In this note, we find a lower bound for $p_{\textrm{dsd}} (n)$, as well as a sequence of $n$ for which $p_{\textrm{dsd}} (n)$ is…

Number Theory · Mathematics 2024-02-14 Noah Lebowitz-Lockard , Joseph Vandehey

The $q,t$-Catalan numbers can be defined using rational functions, geometry related to Hilbert schemes, symmetric functions, representation theory, Dyck paths, partition statistics, or Dyck words. After decades of intensive study, it was…

Combinatorics · Mathematics 2019-11-01 Kyungyong Lee , Li Li , Nicholas A. Loehr

We prove a product formula for the remaining cases of the weighted enumeration of self-complementary plane partitions contained in a given box where adding one half of an orbit of cubes and removing the other half of the orbit changes the…

Combinatorics · Mathematics 2007-05-23 Theresia Eisenkölbl

This article is an extensive study of partitions with fixed number of odd and even-indexed odd parts. We use these partitions to generalize recent results of C. Savage and A. Sills. Moreover, we derive explicit formulas for generating…

Number Theory · Mathematics 2016-04-12 Alexander Berkovich , Ali Kemal Uncu
‹ Prev 1 8 9 10 Next ›