Related papers: The quadratic form in 9 prime variables
Let X be a tight t-design of dimension n for one of the open cases t=5 or t=7. An investigation of the lattice generated by X using arithmetic theory of quadratic forms allows to exclude infinitely many values for n.
A quadratically constrained quadratic programming problem is considered in a Hilbert space setting, where neither the objective nor the constraint are convex functions. Necessary and sufficient conditions are provided to guarantee that the…
In this note we show that for a given irreducible binary quadratic form $f(x,y)$ with integer coefficients, whenever we have $f(x,y) = f(u,v)$ for integers $x,y,u,v$, there exists a rational automorphism of $f$ which sends $(x,y)$ to…
In this paper, we study additively indecomposable quadratic forms over real biquadratic and simplest cubic fields. In particular, we show that over these fields, we can always find such a classical form in 2 variables, which differs from…
Let $r_Q(n)$ be the representation number of a nonnegative integer $n$ by the quaternary quadratic form $Q=x_1^2+2x_2^2+x_3^2+x_4^2+x_1x_3+x_1x_4+x_2x_4$. We first prove the identity $r_Q(p^2n)=r_Q(p^2)r_Q(n)/r_Q(1)$ for any prime $p$…
In 1888, Hilbert proved that every non-negative quartic form f=f(x,y,z) with real coefficients is a sum of three squares of quadratic forms. His proof was ahead of its time and used advanced methods from topology and algebraic geometry. Up…
This note investigates the prime values of the polynomial $f(t)=qt^2+a$ for any fixed pair of relatively prime integers $ a\geq 1$ and $ q\geq 1$ of opposite parity. For a large number $x\geq1$, an asymptotic result of the form $\sum_{n\leq…
We show that every cubic form with coefficients in an imaginary quadratic number field $K/\mathbb{Q}$ in at least $14$ variables represents zero non-trivially. This builds on the corresponding seminal result by Heath-Brown for rational…
We consider incomplete exponential sums in several variables of the form S(f,n,m) = \frac{1}{2^n} \sum_{x_1 \in \{-1,1\}} ... \sum_{x_n \in \{-1,1\}} x_1 ... x_n e^{2\pi i f(x)/p}, where m>1 is odd and f is a polynomial of degree d with…
Inspired by Dickson's classification of regular ternary quadratic forms, we prove that there are no primitive regular $m$-gonal forms when $m$ is sufficiently large. In order to do so, we construct sequences of primes that are inert in a…
Let f\in \mathbb{Z}[x,y] be an irreducible homogeneous polynomial of degree 3. We show that f(x,y) has an even number of prime factors as often as an odd number of prime factors.
We consider a variant of a question of N. Koblitz. For an elliptic curve $E/\Q$ which is not $\Q$-isogenous to an elliptic curve with torsion, Koblitz has conjectured that there exists infinitely many primes $p$ such that…
We show that for each n-tuple of positive rational integers (a_1,..,a_n) there are sets of primes S of arbitrarily large cardinality s such that the solutions of the equation a_1x_1+...+a_nx_n=1 with the x_i all S-units are not contained in…
We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…
In this paper, we prove that a binary definite quadratic form over F_q[t], where q is odd, is completely determined up to equivalence by the polynomials it represents up to degree 3m-2, where m is the degree of its discriminant. We also…
Let $Q$ be a positive-definite quaternary quadratic form with integer coefficients. We study the problem of giving bounds on the largest positive integer $n$ that is locally represented by $Q$ but not represented. Assuming that $n$ is…
Let f be a cubic polynomial. Then there are infinitely many primes p such that f(p) is square-free.
In this paper, we prove a quantitative version of the statement that every nonempty finite subset of $\mathbb{N}^+$ is a set of quadratic residues for infinitely many primes of the form $[n^c]$ with $1\leqslant c\leqslant243/205$.…
Let a1,..., a9 be non-zero integers and n any integer. Suppose that a1 + ... + a9 = n (mod 2) and (ai, aj) = 1 for 1 <= i < j <= 9. We will prove that (i) if not all of the aj's are of the same sign, then the cubic diagonal equation a1p1^3…
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…