Combinatorial Constructions for Sifting Primes and Enumerating the Rationals

Details Combinatorial Constructions for Sifting Primes and Enumerating the Rationals Combinatorial Constructions for Sifting Primes and Enumerating the Rationals

2012-01-09

arxiv.org/abs/1201.1936v2

Mathematics

Combinatorics

Scientific paper

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that such mappings achieve much more than enumeration of rooted trees. We discuss two related structural bijections. The first corresponds to a bijective map between integers and rooted trees. The first bijection also suggests a new algorithm for sifting primes. The second bijection extends the first one in order to map rational numbers to a family of rooted trees. The second bijection suggests a new combinatorial construction for generating reduced rational numbers, thereby producing refinements of the output of the Wilf-Calkin[1] Algorithm.

Affiliated with

Also associated with

No associations

Rating

Combinatorial Constructions for Sifting Primes and Enumerating the Rationals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial Constructions for Sifting Primes and Enumerating the Rationals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Constructions for Sifting Primes and Enumerating the Rationals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-461487