Sieve-Equivalence and Explicit Bijections

@article{Gordon1983SieveEquivalenceAE,
  title={Sieve-Equivalence and Explicit Bijections},
  author={Basil Gordon},
  journal={J. Comb. Theory, Ser. A},
  year={1983},
  volume={34},
  pages={90-93}
}
Suppose A ,,..., A, are subsets of a finite set A, and B ,,..., B, are subsets of a finite set B. For each subset S of N= (1, 2,..., n), let A, = nies Ai and B, = nisS Bi. It is shown that if explicit bijections fs: A, + B, for each S c N are given, an explicit bijection h: A-U,:, Ai 4 B Ui_I Bi can be constructed. The map h is independent of any ordering of the elements of A and B, and of the order in which the subsets Ai and Bi are listed. 

From This Paper

Topics from this paper.
9 Citations
2 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-2 of 2 references

WILF, Sieve-equivalence in generalized partition theory

  • H S.
  • J. Combin. Theory Ser. A
  • 1983
2 Excerpts

MILNE, A Rogers-Ramanujan bijection

  • S.C.A.M. GARSIA
  • J. Combin. Theor) Ser. A
  • 1981

Similar Papers

Loading similar papers…