ID: math/0305078

Asymptotic estimates for the number of integer solutions to decomposable form inequalities

May 5, 2003

View on ArXiv
Jeffrey Lin Thunder
Mathematics
Number Theory

We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display good behavior in terms of the coefficients of the form, and greatly improve upon previous estimates in this regard.

Similar papers 1

Integer solutions of a sequence of decomposable form inequalities

August 5, 1998

92% Match
Kalman Gyory, Min Ru
Number Theory

In this paper, we prove the finiteness of the number of integer solutions of the decomposable form inequalities. We also study the number of integer solutions of a sequence of decomposable form inequalities.

Find SimilarView on arXiv

On the number of solutions of decomposable form inequalities

October 1, 2024

88% Match
Cameron L. Stewart
Number Theory

In 2001 Thunder gave an estimate for the number of integer solutions of decomposable form inequalities under the assumption that the forms are of finite type. The purpose of this article is to generalize this result to forms which are of essentially finite type. In the special case of binary forms this gives an improvement of a result of Mahler from 1933.

Find SimilarView on arXiv

Decomposable form inequalities

May 1, 2001

87% Match
Jeffrey Lin Thunder
Number Theory

We consider Diophantine inequalities of the kind |f(x)| \le m, where F(X) \in Z[X] is a homogeneous polynomial which can be expressed as a product of d homogeneous linear forms in n variables with complex coefficients and m\ge 1. We say such a form is of finite type if the total volume of all real solutions to this inequality is finite and if, for every n'-dimensional subspace S\subseteq R^n defined over Q, the corresponding n'-dimensional volume for F restricted to S is also...

Find SimilarView on arXiv

Density of integer solutions to diagonal quadratic forms

March 24, 2006

85% Match
T. D. Browning
Number Theory

Let Q be a non-singular diagonal quadratic form in at least four variables. We provide upper bounds for the number of integer solutions to the equation Q=0, which lie in a box with sides of length 2B, as B tends to infinity. The estimates obtained are completely uniform in the coefficients of the form, and become sharper as they grow larger in modulus.

Find SimilarView on arXiv

Counting decomposable polynomials with integer coefficients

March 23, 2018

85% Match
Artūras Dubickas, Min Sha
Number Theory

A polynomial over a ring is called decomposable if it is a composition of two nonlinear polynomials. In this paper, we obtain sharp lower and upper bounds for the number of decomposable polynomials with integer coefficients of fixed degree and bounded height. Moreover, we obtain asymptotic formulas for the number of decomposable monic polynomials of even degree. For example, the number of monic sextic integer polynomials which are decomposable and of height at most $H$ is asy...

Find SimilarView on arXiv

Weyl's inequality and systems of forms

August 9, 2012

85% Match
Rainer Dietmann
Number Theory

By providing a variant of Weyl's inequality for general systems of forms we establish the Hardy-Littlewood asymptotic formula for the density of integer zeros of systems of quadratic or cubics forms under weaker rank conditions than previously known. We also briefly discuss what happens for systems of higher degree forms, and slightly relax the non-singularity condition in Birch's paper on forms in many variables.

Find SimilarView on arXiv

Linear inequalities in primes

January 15, 2019

84% Match
Aled Walker
Number Theory
Combinatorics

In this paper we prove an asymptotic formula for the number of solutions in prime numbers to systems of simultaneous linear inequalities with algebraic coefficients. For $m$ simultaneous inequalities we require at least $m+2$ variables, improving upon existing methods, which generically require at least $2m+1$ variables. Our result also generalises the theorem of Green-Tao-Ziegler on linear equations in primes. Many of the methods presented apply for arbitrary coefficients, n...

Find SimilarView on arXiv

On the representation of integers by quadratic forms

March 14, 2006

84% Match
T. D. Browning, R. Dietmann
Number Theory

Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds for the least positive integer k such that the equation Q=k is insoluble in integers, despite being soluble modulo every prime power.

Find SimilarView on arXiv

Finiteness criteria for the solutions of the sequence of semi-decomposable form equations and inequalities

January 15, 2025

84% Match
Si Duc Quang
Number Theory

In this paper, we give some finiteness criteria for the solutions of the sequence of semi-decomposable form equations and inequalities, where the semi-decomposable form is factorized into a family of homogeneous polynomials with the distributive constant exceeding a certain number.

Find SimilarView on arXiv

Bounds for the solutions of $S$-unit equations and decomposable form equations II

January 31, 2019

84% Match
Kálmán Győry
Number Theory

In this paper we improve upon in terms of S the best known effective upper bounds for the solutions of S-unit equations and decomposable form equations.

Find SimilarView on arXiv