Approximation by polynomials with bounded coefficients

Let θ be a real number satisfying 1<θ<2, and let A(θ) be the set of polynomials with coefficients in {0,1}, evaluated at θ. Using a result of Bugeaud, we prove by elementary methods that θ is a Pisot number when the set (A(θ)−A(θ)−A(θ)) is discrete; the problem whether Pisot numbers are the only numbers θ such that 0 is not a limit point of (A(θ)−A(θ)) is still unsolved. We also determine the three greatest limit points of the quantities , where C(θ) is the set of polynomials with coefficients in {−1,1}, evaluated at θ, and we find in particular infinitely many Perron numbers θ such that the sets C(θ) are discrete.     

On the coefficients of ternary cyclotomic polynomials

We study coefficients of ternary cyclotomic polynomials Φ_pqr(z)=∏_ρ(z−ρ), where p, q, and r are distinct odd primes and the product is taken over all primitive pqrth roots of unity ρ.     

Irreducibility Results for Compositions of Polynomials with Integer Coefficients

We obtain explicit upper bounds for the number of irreducible factors for a class of polynomials of the form f ○ g, where f,g are polynomials with integer coefficients, in terms of the prime factorization of the leading coefficients of f and g, the degrees of f and g, and the size of coefficients of f. In particular, some irreducibility results are given for this class of compositions of polynomials.     

Complete solution of the polynomial version of a problem of Diophantus

In this paper, we prove that if {a,b,c,d} is a set of four non-zero polynomials with integer coefficients, not all constant, such that the product of any two of its distinct elements plus 1 is a square of a polynomial with integer coefficients, then

(a+b−c−d)2=4(ab+1)(cd+1).     

Parametrization of Pythagorean triples by a single triple of polynomials

It is well known that Pythagorean triples can be parametrized by two triples of polynomials with integer coefficients. We show that no single triple of polynomials with integer coefficients in any number of variables is sufficient, but that there exists a parametrization of Pythagorean triples by a single triple of integer-valued polynomials.     

Diophantine m-tuples for linear polynomials II. Equal degrees

In this paper we prove the best possible upper bounds for the number of elements in a set of polynomials with integer coefficients all having the same degree, such that the product of any two of them plus a linear polynomial is a square of a polynomial with integer coefficients. Moreover, we prove that there does not exist a set of more than 12 polynomials with integer coefficients and with the property from above. This significantly improves a recent result of the first two authors with Tichy [A. Dujella, C. Fuchs, R.F. Tichy, Diophantine m-tuples for linear polynomials, Period. Math. Hungar. 45 (2002) 21-33].     

On Fermat's equation in integral 2×2 matrices

Supported by the National Science Foundation of China     

On the support base of a functional equation arising from multiplication of quantum integers

Given a set of primes P, we determine the necessary and sufficient criterions for the existence of a sequence of polynomials Γ, with support base P, which is a solution of the functional equations arising from multiplication of quantum integers discussed in Melvyn B. Nathanson (2003) [1] and which cannot be generated by quantum integers.     

On the solutions of a functional equation arising from multiplication of quantum integers

This paper is the first of several papers in which we prove, for the case where the fields of coefficients are of characteristic zero, four open problems posed in the work of Melvyn Nathanson (2003) [1] concerning the solutions of a functional equation arising from multiplication of quantum integers q[n]=qn−1+qn−2+?+q+1. In this paper, we prove one of the problems. The next papers, namely [002], [003] and [004] by Lan Nguyen, contain the solutions to the other 3 problems.     

Integral trees of diameter 6

A graph G is called integral if all eigenvalues of its adjacency matrix A(G) are integers. In this paper, the trees T(p,q)•T(r,m,t) and K_1,s•T(p,q)•T(r,m,t) of diameter 6 are defined. We determine their characteristic polynomials. We also obtain for the first time sufficient and conditions for them to be integral. To do so, we use number theory and apply a computer search. New families of integral trees of diameter 6 are presented. Some of these classes are infinite. They are different from those in the existing literature. We also prove that the problem of finding integral trees of diameter 6 is equivalent to the problem of solving some Diophantine equations. We give a positive answer to a question of Wang et al. [Families of integral trees with diameters 4, 6 and 8, Discrete Appl. Math. 136 (2004) 349-362].     

Integral Points of Small Height Outside of a Hypersurface

Let F be a non-zero polynomial with integer coefficients in N variables of degree M. We prove the existence of an integral point of small height at which F does not vanish. Our basic bound depends on N and M only. We separately investigate the case when F is decomposable into a product of linear forms, and provide a more sophisticated bound. We also relate this problem to a certain extension of Siegel’s Lemma as well as to Faltings’ version of it. Finally we exhibit an application of our results to a discrete version of the Tarski plank problem.     

Tetranomial Thue equations

Let F(x,y)$F(x,y)$ be an irreducible binary form of degree n?6$n?6$ with exactly four nonzero terms. Assuming certain conditions relating the coefficients and the degrees of the different terms are satisfied, we prove upper bounds on the number of equivalent pairs of nontrivial solutions of the Thue equation |F(x,y)|=1$|F(x,y)|=1$. Improved bounds are provided for a variety of cases, where more information about the form is known.     

Polynomials over ordered fields

In this paper we determine which polynomials over ordered fields have multiples with nonnegative coefficients and also which polynomials can be written as quotients of two polynomials with nonnegative coefficients. This problem is related to a result given by Pólya in [G.H. Hardy, J.E. Littlewood, G. Pólya, Inequalities, Cambridge University Press, Cambridge, England, 1952] (as a companion of Artin’s theorem) that asserts that if F(X₁,…,X_n)∈R[X₁,…,X_n] is a form (i.e., a homogeneous polynomial) s.t.  with ∑x_j>0, then F=G/H, where G,H are forms with all coefficients positive (i.e., every monomial of degree degG or degH appears in G or H, resp., with a coefficient that is strictly positive). In Pólya’s proof H is chosen to be H=(X₁+?+X_n)^m for some m.At the end we give some applications, including a generalization of Pólya’s result to arbitrary ordered fields.     

Some properties of graphs determined by edge zeta functions

In 1989, Hashimoto introduced an edge zeta function of a finite graph, which is a generalization of the Ihara zeta function. The edge zeta function is the reciprocal of a polynomial in twice as many indeterminants as edges in the graph and can be computed via a determinant expression. We look at graph properties which we can determine using the edge zeta function. In particular, the edge zeta function is enough to deduce the clique number, the number of Hamiltonian cycles, and whether a graph is perfect or chordal. Finally, we present a new example illustrating that the Ihara zeta function cannot necessarily do the same.     

Polynomials whose coefficients coincide with their zeros

In this paper we consider monic polynomials such that their coefficients coincide with their zeros. These polynomials were first introduced by S. Ulam. We combine methods of algebraic geometry and dynamical systems to prove several results. We obtain estimates on the number of Ulam polynomials of degree N. We provide additional methods to obtain algebraic identities satisfied by the zeros of Ulam polynomials, beyond the straightforward comparison of their zeros and coefficients. To address the question about the existence of orthogonal Ulam polynomial sequences, we show that the only Ulam polynomial eigenfunctions of hypergeometric type differential operators are the trivial Ulam polynomials \(\{x^N\}_{N=0}^\infty \). We propose a family of solvable N-body problems such that their stable equilibria are the zeros of certain Ulam polynomials.     

Polynomials with integer coefficients and their zeros

We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to the approximation by polynomials with integer coefficients, and to the growth of coefficients for polynomials with roots located in prescribed sets. The distribution of zeros for polynomials with integer coefficients plays an important role in all of these problems.     

On Explicit Bounds for the Solutions of a Class of Parametrized Thue Equations of Arbitrary Degree

 In a recent paper [7] the author considered the family of parametrized Thue equations