Bijective arithmetic codings of hyperbolic automorphisms of the 2-torus, and binary quadratic forms

Mathematics – Dynamical Systems

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We study the arithmetic codings of hyperbolic automorphisms of the 2-torus, i.e. the continuous mappings acting from a certain symbolic space of sequences with a finite alphabet endowed with an appropriate structure of additive group onto the torus which preserve this structure and turn the two-sided shift into a given automorphism of the torus. This group is uniquely defined by an automorphism, and such an arithmetic coding is a homomorphism of that group onto the 2-torus. The necessary and sufficient condition of the existence of a bijective arithmetic coding is obtained; it is formulated in terms of a certain binary quadratic form constructed by means of a given automorphism. Furthermore, we describe all bijective arithmetic codings in terms the Dirichlet group of the corresponding quadratic field. The minimum of that quadratic form over the nonzero elements of the lattice coincides with the minimal possible order of the kernel of a homomorphism described above.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Bijective arithmetic codings of hyperbolic automorphisms of the 2-torus, and binary quadratic forms 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 Bijective arithmetic codings of hyperbolic automorphisms of the 2-torus, and binary quadratic forms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bijective arithmetic codings of hyperbolic automorphisms of the 2-torus, and binary quadratic forms will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-236113

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.