Skip to main content

All Questions

Filter by
Sorted by
Tagged with
8 votes
3 answers
2k views

Bijective proof for a partition identity

I came across the following cute fact about partitions: \begin{align} & |\{\lambda \vdash n \text{ with an even number of even parts}\}| \\[8pt] & {} - |\{ \lambda \vdash n \text{ with an odd ...
Nate's user avatar
  • 2,242
8 votes
0 answers
260 views

Efficient listing of ASMs

Famously, the alternating sign matrix theorem gives a product formula for the number $a(n)$ of ASMs of size $n$. There are multiple proofs of this formula, all somewhat involved. My question is ...
Igor Pak's user avatar
  • 17k
5 votes
1 answer
237 views

Bijection from "black-white balanced" partitions to pairs of partitions

Definition Call a partition $\lambda$ of an even integer $2n$ "black-white balanced" if the following equivalent conditions are satisfied: In the usual (Ferrers-)Young diagram of $\lambda$, ...
aorq's user avatar
  • 4,994
3 votes
4 answers
380 views

Bijections on the set of integer partitions of $n$

I am looking for natural bijections from the set of integer partitions of $n$ to itself. Of course, I have no definition of natural, but for the purpose of this question it suffices that it appears ...
Martin Rubey's user avatar
  • 5,822
1 vote
2 answers
788 views

Terminology for a bijection from a set to itself

A current project uses bijections from a set to itself. (The set is the integer compositions of $n$, i.e., "ordered partitions of $n$," but that doesn't seem pertinent to the question.) Is ...
Brian Hopkins's user avatar
1 vote
1 answer
304 views

A combinatorial problem about partitions [closed]

A partition of $n$ is a unordered list, whose sum is exactly $n$. The total number of $2$’s in all partitions of $n$ is equal to the total number of singletons in all partitions of $n−1$. A singleton ...
oyyj603450138's user avatar