20,749 research outputs found
Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems
B{\'e}zout 's theorem states that dense generic systems of n multivariate
quadratic equations in n variables have 2 n solutions over algebraically closed
fields. When only a small subset M of monomials appear in the equations
(fewnomial systems), the number of solutions may decrease dramatically. We
focus in this work on subsets of quadratic monomials M such that generic
systems with support M do not admit any solution at all. For these systems,
Hilbert's Nullstellensatz ensures the existence of algebraic certificates of
inconsistency. However, up to our knowledge all known bounds on the sizes of
such certificates -including those which take into account the Newton polytopes
of the polynomials- are exponential in n. Our main results show that if the
inequality 2|M| -- 2n \sqrt 1 + 8{\nu} -- 1 holds for a quadratic
fewnomial system -- where {\nu} is the matching number of a graph associated
with M, and |M| is the cardinality of M -- then there exists generically a
certificate of inconsistency of linear size (measured as the number of
coefficients in the ground field K). Moreover this certificate can be computed
within a polynomial number of arithmetic operations. Next, we evaluate how
often this inequality holds, and we give evidence that the probability that the
inequality is satisfied depends strongly on the number of squares. More
precisely, we show that if M is picked uniformly at random among the subsets of
n + k + 1 quadratic monomials containing at least (n 1/2+)
squares, then the probability that the inequality holds tends to 1 as n grows.
Interestingly, this phenomenon is related with the matching number of random
graphs in the Erd{\"o}s-Renyi model. Finally, we provide experimental results
showing that certificates in inconsistency can be computed for systems with
more than 10000 variables and equations.Comment: ISSAC 2016, Jul 2016, Waterloo, Canada. Proceedings of ISSAC 201
Reconstructing Rational Functions with
We present the open-source library for the
reconstruction of multivariate rational functions over finite fields. We
discuss the involved algorithms and their implementation. As an application, we
use in the context of integration-by-parts reductions and
compare runtime and memory consumption to a fully algebraic approach with the
program .Comment: 46 pages, 3 figures, 6 tables; v2: matches published versio
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves
We present a probabilistic Las Vegas algorithm for computing the local zeta
function of a hyperelliptic curve of genus defined over . It
is based on the approaches by Schoof and Pila combined with a modeling of the
-torsion by structured polynomial systems. Our main result improves on
previously known complexity bounds by showing that there exists a constant
such that, for any fixed , this algorithm has expected time and space
complexity as grows and the characteristic is large
enough.Comment: To appear in Foundations of Computational Mathematic
Some Speed-Ups and Speed Limits for Real Algebraic Geometry
We give new positive and negative results (some conditional) on speeding up
computational algebraic geometry over the reals: (1) A new and sharper upper
bound on the number of connected components of a semialgebraic set. Our bound
is novel in that it is stated in terms of the volumes of certain polytopes and,
for a large class of inputs, beats the best previous bounds by a factor
exponential in the number of variables. (2) A new algorithm for approximating
the real roots of certain sparse polynomial systems. Two features of our
algorithm are (a) arithmetic complexity polylogarithmic in the degree of the
underlying complex variety (as opposed to the super-linear dependence in
earlier algorithms) and (b) a simple and efficient generalization to certain
univariate exponential sums. (3) Detecting whether a real algebraic surface
(given as the common zero set of some input straight-line programs) is not
smooth can be done in polynomial time within the classical Turing model (resp.
BSS model over C) only if P=NP (resp. NP<=BPP). The last result follows easily
from an unpublished result of Steve Smale.Comment: This is the final journal version which will appear in Journal of
Complexity. More typos are corrected, and a new section is added where the
bounds here are compared to an earlier result of Benedetti, Loeser, and
Risler. The LaTeX source needs the ajour.cls macro file to compil
- …