Work

Two combinatorial formulas concerning marked partitions

Year: 2008
Type: preprint
Abstract: A partition of degree $n$ is a decomposition $n=i_1+i_2+\dots+i_q$, where ${i_1,i_2,\dots,i_q}$ are positive integers called the parts of the partition. Let $λ>0$ be an integer. The partition is said to be a $λ$--partition if $i_{a+1}-i_a\geqslant λ$ for all $a$ such that $1\leqslant a
Language: English
Open Access status: green
OpenAlex ID: W2890237016
Cites: 3
Cited by:
Related to: 10