Related papers: Cubic polynomials represented by norm forms

We prove an effective form of Hilbert's irreducibility theorem for polynomials over a global field $K$. More precisely, we give effective bounds for the number of specializations $t\in \mathcal{O}_K$ that do not preserve the irreducibility…

We propose a randomized polynomial time algorithm for computing nontrivial zeros of quadratic forms in 4 or more variables over $\mathbb{F}_q(t)$, where $\mathbb{F}_q$ is a finite field of odd characteristic. The algorithm is based on a…

We construct new examples of cubic surfaces, for which the Hasse principle fails. Thereby, we show that, over every number field, the counterexamples to the Hasse principle are Zariski dense in the moduli scheme of non-singular cubic…

We prove the universality of the large deviations principle for the empirical measures of zeros of random polynomials whose coefficients are i.i.d. random variables possessing a density with respect to the Lebesgue measure on C, R or R + ,…

We study the irreducible quotient $\mathcal{L}_{t,c}$ of the polynomial representation of the rational Cherednik algebra $\mathcal{H}_{t,c}(S_n,\mathfrak{h})$ of type $A_{n-1}$ over an algebraically closed field of positive characteristic…

Conditionally on the $abc$ conjecture, we generalize previous work of Clark and the author to show that a superelliptic curve $C: y^n = f(x)$ of sufficiently high genus has infinitely many twists violating the Hasse Principle if and only if…

Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized…

We study the distribution of abelian extensions of bounded discriminant of a number field $k$ which fail the Hasse norm principle. For example, we classify those finite abelian groups $G$ for which a positive proportion of $G$-extensions of…

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

We establish new upper bounds on the number of failures of the integral Hasse principle within the family of Markoff type cubic surfaces $x^2+ y^2+ z^2- xyz= a$ with $|a|\leq A$ as $A\to \infty$. Our bound improves upon existing work of…

For any 4-variate quartic form $f\geq 0$ (i.e. $f$ nonnegative, homogeneous polynomial of degree $4$ with real coefficients) there exist quadratic forms $q$ and $q'$ so that $qq'f$ is a sum of squares (s.o.s.) of quartics, by reducing to…

We establish a lower bound for the frequency with which an irreducible monic cubic polynomial with negative discriminant can be expressed as a sum of two squares ($\square_{2}$). This provides a quantitative answer to a question posed by…

We prove a Hasse principle for solving equations of the form ax+by+cz=0 where x, y, z belong to a given finite index subgroup of the multiplicative group of rational numbers. From this we deduce a Hasse principle for diagonal curves over…

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 establish the Hasse principle for smooth projective quartic hypersurfaces of dimension greater than or equal to 28 defined over $\mathbb{Q}$.

A polynomial f(x) has emergent reducibility at depth n if f^{\circ k}(x) is irreducible for 0\leq k\leq n-1 but f^{\circ n}(x) is reducible. In this paper we prove that there are infinitely many irreducible cubics f \in \mathbb{Z}[x] with…

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…

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

In this note, we prove an irreducibility criterion for the polynomial of the form $f(x) = a_{n}x^{n} + a_{n-1}x^{n-1} + \cdots + a_{m}x^{m} + p^{u} \in \mathbb{Z}[x]$, where $p$ is a prime number, $u \geqslant 1$, $\gcd(u, m) = 1$, $p \nmid…

Let ${\{K_m\}_{m\geq 4}}$ be the family of non-normal totally real cubic number fields defined by the irreducible cubic polynomial $f_m(x)=x^3-mx^2-(m+1)x-1$, where $m$ is an integer with $m\geq 4$. In this paper, we will give a class…