Least Zero of a Cubic Form
نویسندگان
چکیده
— An effective search bound is established for the least non-trivial integer zero of an arbitrary cubic form C ∈ Z[X1, . . . , Xn], provided that n > 17.
منابع مشابه
A note on Fouquet-Vanherpe’s question and Fulkerson conjecture
The excessive index of a bridgeless cubic graph $G$ is the least integer $k$, such that $G$ can be covered by $k$ perfect matchings. An equivalent form of Fulkerson conjecture (due to Berge) is that every bridgeless cubic graph has excessive index at most five. Clearly, Petersen graph is a cyclically 4-edge-connected snark with excessive index at least 5, so Fouquet and Vanherpe as...
متن کاملCubic Thue equations with many solutions
We shall prove that if F is a cubic binary form with integer coefficients and non-zero discriminant then there is a positive number c, which depends on F, such that the Thue equation F (x, y) = m has at least c(logm) solutions in integers x and y for infinitely many positive integers m.
متن کاملCubic Forms in 14 Variables
The result can be rephrased in geometric language to say that any projective cubic hypersurface defined over Q, of dimension at least 12, has a Q-point. Davenport’s result was extended to arbitrary number fields by Pleasants [9], and it would be interesting to know whether Theorem 1 could similarly be extended. These results can be seen as an attempt to extend the classical theorem of Meyer (18...
متن کاملOn the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization
We propose a new termination criteria suitable for potentially singular, zero or non-zero residual, least-squares problems, with which cubic regularization variants take at most O(ǫ) residualand Jacobian-evaluations to drive either the Euclidean norm of the residual or its gradient below ǫ; this is the best-known bound for potentially rank-deficient nonlinear least-squares problems. We then app...
متن کاملNowhere-zero 5-flows
We prove that every cyclically 6-edge-connected cubic graph with oddness at most 4 has a nowhere-zero 5-flow. Therefore, a possible minimum counterexample to the 5-flow conjecture has oddness at least 6.
متن کامل