English
Related papers

Related papers: The $(k,l)$-Euler theorem and the combinatorics of…

200 papers

Let $\Bigl\langle\matrix{n\cr k}\Bigr\rangle$, $\Bigl\langle\matrix{B_n\cr k}\Bigr\rangle$, and $\Bigl\langle\matrix{D_n\cr k}\Bigr\rangle$ be the Eulerian numbers in the types A, B, and D, respectively -- that is, the number of…

Logic in Computer Science · Computer Science 2024-02-14 Luigi Santocanale

A $k$-partition of an $n$-set $X$ is a collection of $k$ pairwise disjoint non-empty subsets whose union is $X$. A family of $k$-partitions of $X$ is called $t$-intersecting if any two of its members share at least $t$ blocks. A…

Combinatorics · Mathematics 2025-10-27 Jie Wen , Benjian Lv

In this paper we show a a proof by explicit bijections of the famous Kirkman-Cayley formula for the number of dissections of a convex polygon. Our starting point is the bijective correspondence between the set of nested sets made by \(k\)…

Combinatorics · Mathematics 2014-06-24 Giovanni Gaiffi

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…

Combinatorics · Mathematics 2020-02-20 Jia Huang

A $k\ell$-subset partition, or $(k,\ell)$-subpartition, is a $k\ell$-subset of an $n$-set that is partitioned into $\ell$ distinct classes, each of size $k$. Two $(k,\ell)$-subpartitions are said to $t$-intersect if they have at least $t$…

Combinatorics · Mathematics 2016-01-20 Adam Dyck , Karen Meagher

For a positive integer $r$, George Andrews proved that the set of partitions of $n$ in which odd multiplicities are at least $2r + 1$ is equinumerous with the set of partitions of $n$ in which odd parts are congruent to $2r + 1$ modulo $4r…

Combinatorics · Mathematics 2022-12-29 Darlison Nyirenda

A sub-problem of the open problem of finding an explicit bijection between alternating sign matrices and totally symmetric self-complementary plane partitions consists in finding an explicit bijection between so-called $(n,k)$ Gog…

Combinatorics · Mathematics 2016-04-12 Jérémie Bettinelli

We say two posets are "doppelg\"angers" if they have the same number of $P$-partitions of each height $k$. We give a uniform framework for bijective proofs that posets are doppelg\"angers by synthesizing $K$-theoretic Schubert calculus…

Combinatorics · Mathematics 2022-03-25 Zachary Hamaker , Rebecca Patrias , Oliver Pechenik , Nathan Williams

It was shown by V. Bergelson that any set B with positive upper multiplicative density contains nicely intertwined arithmetic and geometric progressions: For each positive integer k there exist integers a,b,d such that $ {b(a+id)^j:i,j…

Combinatorics · Mathematics 2014-02-26 Mathias Beiglböck

Lecture hall partitions are a fundamental combinatorial structure which have been studied extensively over the past two decades. These objects have produced new results, as well as reinterpretations and generalizations of classicial…

Combinatorics · Mathematics 2018-08-21 McCabe Olsen

We give Euler-like recursive formulas for the $t$-colored partition function when $t=2$ or $t=3,$ as well as for all $t$-regular partition functions. In particular, we derive an infinite family of ``triangular number" recurrences for the…

Number Theory · Mathematics 2024-12-24 Tapas Bhowmik , Wei-Lun Tsai , Dongxi Ye

Tverberg's theorem asserts that every (k-1)(d+1)+1 points in R^d can be partitioned into k parts, so that the convex hulls of the parts have a common intersection. Calder and Eckhoff asked whether there is a purely combinatorial deduction…

Combinatorics · Mathematics 2010-09-14 Boris Bukh

In this paper we prove a duality between $k$-noncrossing partitions over $[n]=\{1,...,n\}$ and $k$-noncrossing braids over $[n-1]$. This duality is derived directly via (generalized) vacillating tableaux which are in correspondence to…

Combinatorics · Mathematics 2007-11-15 Emma Y. Jin , Jing Qin , Christian M. Reidys

In a recent work, Keith and Xiong gave a refinement of Glaisher's theorem by using a Sylvester-style bijection. In this paper, we introduce two families of colored partitions, flat and regular partitions, and generalize the bijection of…

Combinatorics · Mathematics 2021-05-21 Isaac Konan

We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results,…

Combinatorics · Mathematics 2007-09-11 Sylvie Corteel , Jeremy Lovejoy

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$…

Combinatorics · Mathematics 2023-10-16 Shi-Chao Chen

Let $T_{\ell,k}(n)$ denote the number of $\ell$-regular $k$-tuple partitions of $n$. In a recent work, Nath, Saikia, and Sarma derived several families of congruences for $T_{\ell,k}(n)$, with particular emphasis on the cases $T_{2,3}(n)$…

Number Theory · Mathematics 2025-03-18 Bishnu Paudel , James A. Sellers , Haiyang Wang

Based on the Euler-Lagrange cohomology groups $H_{EL}^{(2k-1)}({\cal M}^{2n}) (1 \leqslant k\leqslant n)$ on symplectic manifold $({\cal M}^{2n}, \omega)$, their properties and a kind of classification of vector fields on the manifold, we…

Mathematical Physics · Physics 2007-05-23 Han-Ying Guo , Jianzhong Pan , Bin Zhou

In this note, we investigate some of the fundamental algebraic and geometric properties of $s$-lecture hall simplices and their generalizations. We show that all $s$-lecture hall order polytopes, which simultaneously generalize $s$-lecture…

Combinatorics · Mathematics 2019-12-02 Petter Brändén , Liam Solus

Given an integer partition $\la=(\la_1, ..., \la_\ell)$ and an integer k, denote by $\la^{(k)}$ the sequence of length $\ell$ obtained by reordering the values $|\la_i-k|$ in non-increasing order. If $\la$ dominates $\mu$ and has the same…

Combinatorics · Mathematics 2008-12-18 Mireille Bousquet-Mélou