Related papers: Least zero of a cubic form
The Cayley cubic surface is given by the equation sum_{i=1}^4 X_i^{-1}=0. We show that the number of non-trivial primitive integer points of size at most B is of exact order B(log B)^6, as predicted by Manin's conjecture.
The problem of finding a local minimum of a black-box function is central for understanding local search as well as quantum adiabatic algorithms. For functions on the Boolean hypercube {0,1}^n, we show a lower bound of Omega(2^{n/4}/n) on…
We construct infinite cubefree binary words containing exponentially many distinct squares of length n. We also show that for every positive integer n, there is a cubefree binary square of length 2n.
Conceptually, a rough number is a positive integer with no small prime factors. Formally, for real numbers $x$ and $y$, let $\Phi(x,y)$ denote the number of positive integers at most $x$ with no prime factors less than $y$. In this paper we…
In this paper we prove a new asymptotic lower bound for the minimal number of simplices in simplicial dissections of $n$-dimensional cubes. In particular we show that the number of simplices in dissections of $n$-cubes without additional…
In this paper, we will interest in finding the number of zeros of the quadratic forms over finite fields. We will apply the tool for finding the number of rational points of supersingular curves in [6]. We will give some more tools for…
Reduced ideals have been defined in the context of integer rings in quadratic number fields, and they are closely tied to the continued fraction algorithm. The notion of this type of ideal extends naturally to number fields of higher…
Cubic forms in three variables are parametrised by points of $\P^9$. We study the subvarieties in this space defined by decomposable forms. Specifically, we calculate the equivariant minimal resolutions of these varieties and describe their…
For a positive integer $m$, a (positive definite integral) quadratic form is called primitively $m$-universal if it primitively represents all quadratic forms of rank $m$. It was proved in arXiv:2202.13573 that there are exactly $107$…
We provide an upper bound on the efficient irrationality exponents of cubic algebraics $x$ with the minimal polynomial $x^3 - tx^2 - a$. In particular, we show that it becomes non-trivial, i.e. better than the classical bound of Liouville…
We estimate the number of principal ideals $ I $ of norm $ \mathrm{N}(I) \leq x $ in the family of the simplest cubic fields. The advantage of our result is that it provides the correct order of magnitude for arbitrary $ x \geq 1 $, even…
The essential operations of a quantum computer can be accomplished using solely optical elements, with different polarization or spatial modes representing the individual qubits. We present a simple all-optical implementation of Grover's…
We give upper bounds on the size of the gap between a non-zero constant term and the next non-zero Fourier coefficient of an entire level two modular form. We give upper bounds for the minimum positive integer represented by a level two…
In this paper, we proved that there are infinite cube--free numbers of the form $[n^c]$ for any fixed real number $1<c<11/6$.
One of the most important quantum algorithms ever discovered is Grover's algorithm for searching an unordered set. We give a new lower bound in the query model which proves that Grover's algorithm is exactly optimal. Similar to existing…
Integer cuboids are rectangular Diophantine parallelepipeds It has been discovered that these cuboids come in 3 varieties: Euler or body type, edge type, and face type. In all three cases, one edge or diagonal is irrational, all six others…
This paper contains an account of arbitrary cubic function fields of characteristic three. We define a standard form for an arbitrary cubic curve and consider its function field. By considering an integral basis for the maximal order of…
A perfect cuboid is formed when an Euler brick whose edges and face diagonals are all integers also has an integer internal diagonal. It is known that if a perfect cuboid exists the internal diagonal is odd. No perfect cuboid has been…
Separation bounds are a fundamental measure of the complexity of solving a zero-dimensional system as it measures how difficult it is to separate its zeroes. In the positive dimensional case, the notion of reach takes its place. In this…
An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…