中文
相关论文

相关论文: A bijection for Euler's partition theorem in the s…

200 篇论文

In this note a bijection is constructed between the set of partitions of n simultaneously s-regular and t-distinct, and those simultaneously t-regular and s-distinct. Some implications of the map are discussed. As a generalized version of…

组合数学 · 数学 2022-08-04 William J. Keith

We generalize the well known Glaisher partition bijection result. For given positive integers n, d, both greater than 1, we provide a rich family of bijections between the set of partitions of n where at least one part is divisible by d,…

组合数学 · 数学 2020-03-19 Aritro Pathak

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

Bressoud introduced the partition function $B(\alpha_1,\ldots,\alpha_\lambda;\eta,k,r;n)$, which counts the number of partitions with certain difference conditions. Bressoud posed a conjecture on the generating function for the partition…

组合数学 · 数学 2024-05-31 Y. H. Chen , Thomas Y. He

We study a curious class of partitions, the parts of which obey an exceedingly strict congruence condition we refer to as "sequential congruence": the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part…

数论 · 数学 2020-06-09 Maxwell Schneider , Robert Schneider

A bijection is presented between (1): partitions with conditions $f_j+f_{j+1}\leq k-1$ and $ f_1\leq i-1$, where $f_j$ is the frequency of the part $j$ in the partition, and (2): sets of $k-1$ ordered partitions $(n^{(1)}, n^{(2)}, ...,…

组合数学 · 数学 2008-01-15 P Jacob , P. Mathieu

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…

组合数学 · 数学 2019-11-20 Hao Zhong

We present a bijection between non-crossing partitions of the set $[2n+1]$ into $n+1$ blocks such that no block contains two consecutive integers, and the set of sequences $\{s_{i}\}_{1}^{n}$ such that $1 \leq s_{i} \leq i$, and if…

组合数学 · 数学 2007-05-23 Rekha Natarajan

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

I present a bijection on integer partitions that leads to recursive expressions, closed formulae and generating functions for the cardinality of certain sets of partitions of a positive integer $n$. The bijection leads also to a product on…

组合数学 · 数学 2009-06-17 Alain Goupil

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

组合数学 · 数学 2023-10-16 Shi-Chao Chen

We find bijections on 2-distant noncrossing partitions, 12312-avoiding partitions, 3-Motzkin paths, UH-free Schr{\"o}der paths and Schr{\"o}der paths without peaks at even height. We also give a direct bijection between 2-distant…

组合数学 · 数学 2011-08-30 Jang Soo Kim

We provide new Schmidt-type results through an investigation of two bijections, which are results involving partitions with parts counted only at given indices. Mork's bijection, the first of these, was originally given as a proof of…

组合数学 · 数学 2022-10-17 Hunter Waldron

We present a bijection between permutation matrices and descending plane partitions without special parts, which respects the quadruple of statistics considered by Behrend, Di Francesco and Zinn--Justin. This bijection involves the…

组合数学 · 数学 2018-09-10 Markus Fulmek

We exhibit, for any positive integer parameter $s$, an involution on the set of integer partitions of $n$. These involutions show the joint symmetry of the distributions of the following two statistics. The first counts the number of parts…

Andrews and Merca [J. Combin. Theory Ser. A 203 (2024), Art. 105849] recently obtained two interesting results on the sum of the parts with the same parity in the partitions of $n$ (the modulo $2$ case), the proof of which relies on…

组合数学 · 数学 2024-06-07 Ji-Cai Liu

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

组合数学 · 数学 2024-01-17 Gunnar Fløystad

In the study of the algebra $\mathrm{NCSym}$ of symmetric functions in noncommutative variables, Bergeron and Zabrocki found a free generating set consisting of power sum symmetric functions indexed by atomic partitions. On the other hand,…

组合数学 · 数学 2011-08-08 William Y. C. Chen , Teresa X. S. Li , David G. L. Wang

In this paper, we give a bijective proof of the reduced lecture hall partition theorem. It is possible to extend this bijection in lecture hall partition theorem. And refined versions of each theorems are also presented.

组合数学 · 数学 2015-04-17 Masanori Ando

In a recent paper, Andrews and Merca investigated the number of even parts in all partitions of $n$ into distinct parts, which arise naturally from the Euler-Glaisher bijective proof. They obtained new combinatorial interpretations for this…

组合数学 · 数学 2022-07-11 Jiyou Li , Sicheng Zhao
‹ 上一页 1 2 3 10 下一页 ›