A Note on Boolean Lattices and Farey Sequences
Combinatorics
2007-05-23 v2 Number Theory
Abstract
We establish monotone bijections between the Farey sequences of order m and the halfsequences of Farey subsequences associated with the rank m elements of the Boolean lattice of subsets of a 2m-set. We also present a few related combinatorial identities.
Cite
@article{arxiv.math/0702106,
title = {A Note on Boolean Lattices and Farey Sequences},
author = {Andrey O. Matveev},
journal= {arXiv preprint arXiv:math/0702106},
year = {2007}
}
Comments
8 pages; published version