On an approximation property of Pisot numbers

Let 1<q<2 be a real number, m≥1 be a rational integer and l_m(q)={|P(q)|,P∈Z[X],P(q)≠0,H(P)≤m}, where Z[X] denotes the set of polynomials P with rational integer coefficients and H(P) is the height of P. The value of l_m(q) was determined for many particular Pisot numbers ([3] and [7]). In this paper we determine the infimum and the supremum of the numbers l_m(q) for any fixed m. We also determine the greatest limit point for the case m=1. This revised version was published online in June 2006 with corrections to the Cover Date.     

Prime and composite numbers as integer parts of powers

We study prime and composite numbers in the sequence of integer parts of powers of a fixed real number. We first prove a result which implies that there is a transcendental number ξ>1 for which the numbers [ξ^{n !}], n =2,3, ..., are all prime. Then, following an idea of Huxley who did it for cubics, we construct Pisot numbers of arbitrary degree such that all integer parts of their powers are composite. Finally, we give an example of an explicit transcendental number ζ (obtained as the limit of a certain recurrent sequence) for which the sequence [ζⁿ], n =1,2,..., has infinitely many elements in an arbitrary integer arithmetical progression. This revised version was published online in June 2006 with corrections to the Cover Date.     

On beta expansions for Pisot numbers

Given a number , the beta-transformation is defined for by (mod 1). The number is said to be a beta-number if the orbit is finite, hence eventually periodic. In this case is the root of a monic polynomial with integer coefficients called the characteristic polynomial of . If is the minimal polynomial of , then for some polynomial . It is the factor which concerns us here in case is a Pisot number. It is known that all Pisot numbers are beta-numbers, and it has often been asked whether must be cyclotomic in this case, particularly if . We answer this question in the negative by an examination of the regular Pisot numbers associated with the smallest 8 limit points of the Pisot numbers, by an exhaustive enumeration of the irregular Pisot numbers in (an infinite set), by a search up to degree in , to degree in , and to degree in . We find the smallest counterexample, the counterexample of smallest degree, examples where is nonreciprocal, and examples where is reciprocal but noncyclotomic. We produce infinite sequences of these two types which converge to from above, and infinite sequences of with nonreciprocal which converge to from below and to the th smallest limit point of the Pisot numbers from both sides. We conjecture that these are the only limit points of such numbers in . The Pisot numbers for which is cyclotomic are related to an interesting closed set of numbers introduced by Flatto, Lagarias and Poonen in connection with the zeta function of . Our examples show that the set of Pisot numbers is not a subset of .

     

Some computations on the spectra of Pisot and Salem numbers

Properties of Pisot numbers have long been of interest. One line of questioning, initiated by Erdos, Joó and Komornik in 1990, is the determination of for Pisot numbers , where

Although the quantity is known for some Pisot numbers , there has been no general method for computing . This paper gives such an algorithm. With this algorithm, some properties of and its generalizations are investigated.

A related question concerns the analogy of , denoted , where the coefficients are restricted to ; in particular, for which non-Pisot numbers is nonzero? This paper finds an infinite class of Salem numbers where .

     

The structure of the spectra of Pisot numbers

For q∈(1,2), Erdös, Joó and Komornik studied the set:

     

Continued fractions,the group GL(2, ℤ), and Pisot numbers

The properties of continued fractions, generalized golden sections, and generalized Fibonacci and Lucas numbers are proved on the ground of the properties of subsemigroups of the group of invertible integer matrices. Some properties of special recurrent sequences are studied. A new proof of the Pisot-Vijayaraghavan theorem is given. Some connections between continued fractions and Pisot numbers are considered. Some unsolved problems are stated.     

A thermodynamic classification of real numbers

Text

A new classification scheme for real numbers is given, motivated by ideas from statistical mechanics in general and work of Knauf (1993) [16] and Fiala and Kleban (2005) [8] in particular. Critical for this classification of a real number will be the Diophantine properties of its continued fraction expansion.

Video

For a video summary of this paper, please click here or visit http://www.youtube.com/watch?v=qnPF2QS4cRg.     

Non-trivial quadratic approximations to zero of a family of cubic Pisot numbers

This paper gives exact rates of quadratic approximations to an infinite class of cubic Pisot numbers. We show that for any cubic Pisot number , with minimal polynomial , such that , and where has only one real root, then there exists a , explicitly given here, such that:

(1)

For all 0$">, all but finitely many integer quadratics satisfy

where is the height function.

(2)

For all 0$"> there exists a sequence of integer quadratics such that

Furthermore, for all in this class of cubic Pisot numbers. What is surprising about this result is how precise it is, giving exact upper and lower bounds for these approximations.

     

Comments on the spectra of Pisot numbers

For q∈(1,2), Erd?s, Joó and Komornik studied the spectra of q, defined as

     

关于完全平方数的一个性质

运用不定方程的理论讨论了完全平方数的一个基本性质,得到了关于完全平方数的几个重要定理.     

On some polynomial values of repdigit numbers

We study the equal values of repdigit numbers and the k dimensional polygonal numbers. We state some effective finiteness theorems, and for small parameter values we completely solve the corresponding equations.     

Generalized Bessel numbers and some combinatorial settings

Stirling numbers and Bessel numbers have a long history, and both have been generalized in a variety of directions. Here, we present a second level generalization that has both as special cases. This generalization often preserves the inverse relation between the first and second kind, and has simple combinatorial interpretations. We also frame the discussion in terms of the exponential Riordan group. Then the inverse relation is just the group inverse, and factoring inside the group leads to many results connecting the various Stirling and Bessel numbers.     

A New Proof of Diophantine Equation （^n2） = （^m4）

By using algebraic number theory and p-adic analysis method, we give a new and simple proof of Diophantine equation （^n2） = （^m4）     

On the Trace of Algebraic Integers of Small Height

We give an upper bound for the modulus of the first non–zero trace among natural powers of an algebraic integer of small house. An upper bound for this power is obtained for the Pisot and Salem numbers. Although the house of these numbers is not at all small, similar bounds for the first non–zero trace are also established. Finally, we give an upper bound for the trace of an algebraic number with the Mahler measure bounded above by the square root of the degree.     

Smoothed analysis of some condition numbers

In this note we do a smoothed analysis, in the sense of ( http://www‐math.mit.edu/～spielman/SmoothedAnalysis/ ), of the condition number for the Moore–Penrose inverse. Usual average analysis follows in a trivial manner as follow similar analyses for the condition number of the polar factorization. Copyright © 2005 John Wiley & Sons, Ltd.     

On some properties of the Euler's factor of certain odd perfect numbers

Let n=π^α3^2βQ^2β be an odd positive integer, with π prime, π≡α≡1 (mod 4), Q squarefree, (Q,π)=(Q,3)=1. It is shown that: if n is perfect, then σ(π^α)≡0. Some corollaries concerning the Euler's factor of odd perfect numbers of the above mentioned form, if any, are deduced.     

Neither G9（Q） nor G11（Q） Is a Subgroup of K2（Q）

It is proved that neither G9(Q) nor G11(Q) is a subgroup of K2(Q) which confirms two special cases of a conjecture proposed by Browkin, J. (Lecture Notes in Math., 966, Springer-Verlag, New York, Heidelberg, Berlin, 1982, 1-6).     

Bounds on some van der Waerden numbers

For positive integers s and k₁,k₂,…,ks, the van der Waerden number w(k₁,k₂,…,ks;s) is the minimum integer n such that for every s-coloring of set {1,2,…,n}, with colors 1,2,…,s, there is a ki-term arithmetic progression of color i for some i. We give an asymptotic lower bound for w(k,m;2) for fixed m. We include a table of values of w(k,3;2) that are very close to this lower bound for m=3. We also give a lower bound for w(k,k,…,k;s) that slightly improves previously-known bounds. Upper bounds for w(k,4;2) and w(4,4,…,4;s) are also provided.     

On some three color Ramsey numbers for paths and cycles

For given graphs G₁,G₂,…,G_k, k≥2, the multicolor Ramsey number, denoted by R(G₁,G₂,…,G_k), is the smallest integer n such that if we arbitrarily color the edges of a complete graph on n vertices with k colors, there is always a monochromatic copy of G_i colored with i, for some 1≤i≤k. Let P_k (resp. C_k) be the path (resp. cycle) on k vertices. In the paper we consider the value for numbers of type R(P_i,P_k,C_m) for odd m, k≥m≥3 and when i is odd, and when i is even. In addition, we provide the exact values for Ramsey numbers R(P₃,P_k,C₄) for all integers k≥3.