On Certain Computations of Pisot Numbers

Details On Certain Computations of Pisot Numbers On Certain Computations of Pisot Numbers

2012-02-26

arxiv.org/abs/1202.5785v1

Mathematics

Number Theory

10 pages

Scientific paper

This paper presents two algorithms on certain computations about Pisot numbers. Firstly, we develop an algorithm that finds a Pisot number $\alpha$ such that $\Q[\alpha] = \F$ given a real Galois extension $\F$ of $\Q$ by its integral basis. This algorithm is based on the lattice reduction, and it runs in time polynomial in the size of the integral basis. Next, we show that for a fixed Pisot number $\alpha$, one can compute $ [\alpha^n] \pmod{m}$ in time polynomial in $(\log (m n))^{O(1)}$, where $m$ and $n$ are positive integers.

Affiliated with

Also associated with

No associations

Rating

On Certain Computations of Pisot Numbers 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 On Certain Computations of Pisot Numbers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Certain Computations of Pisot Numbers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-216141