2,146 research outputs found
Progress on Polynomial Identity Testing - II
We survey the area of algebraic complexity theory; with the focus being on
the problem of polynomial identity testing (PIT). We discuss the key ideas that
have gone into the results of the last few years.Comment: 17 pages, 1 figure, surve
Report on "Geometry and representation theory of tensors for computer science, statistics and other areas."
This is a technical report on the proceedings of the workshop held July 21 to
July 25, 2008 at the American Institute of Mathematics, Palo Alto, California,
organized by Joseph Landsberg, Lek-Heng Lim, Jason Morton, and Jerzy Weyman. We
include a list of open problems coming from applications in 4 different areas:
signal processing, the Mulmuley-Sohoni approach to P vs. NP, matchgates and
holographic algorithms, and entanglement and quantum information theory. We
emphasize the interactions between geometry and representation theory and these
applied areas
Faster polynomial multiplication over finite fields
Let p be a prime, and let M_p(n) denote the bit complexity of multiplying two
polynomials in F_p[X] of degree less than n. For n large compared to p, we
establish the bound M_p(n) = O(n log n 8^(log^* n) log p), where log^* is the
iterated logarithm. This is the first known F\"urer-type complexity bound for
F_p[X], and improves on the previously best known bound M_p(n) = O(n log n log
log n log p)
Computing zeta functions of arithmetic schemes
We present new algorithms for computing zeta functions of algebraic varieties
over finite fields. In particular, let X be an arithmetic scheme (scheme of
finite type over Z), and for a prime p let zeta_{X_p}(s) be the local factor of
its zeta function. We present an algorithm that computes zeta_{X_p}(s) for a
single prime p in time p^(1/2+o(1)), and another algorithm that computes
zeta_{X_p}(s) for all primes p < N in time N (log N)^(3+o(1)). These generalise
previous results of the author from hyperelliptic curves to completely
arbitrary varieties.Comment: 23 pages, to appear in the Proceedings of the London Mathematical
Societ
Renormalization : A number theoretical model
We analyse the Dirichlet convolution ring of arithmetic number theoretic
functions. It turns out to fail to be a Hopf algebra on the diagonal, due to
the lack of complete multiplicativity of the product and coproduct. A related
Hopf algebra can be established, which however overcounts the diagonal. We
argue that the mechanism of renormalization in quantum field theory is modelled
after the same principle. Singularities hence arise as a (now continuously
indexed) overcounting on the diagonals. Renormalization is given by the map
from the auxiliary Hopf algebra to the weaker multiplicative structure, called
Hopf gebra, rescaling the diagonals.Comment: 15 pages, extended version of talks delivered at SLC55 Bertinoro,Sep
2005, and the Bob Delbourgo QFT Fest in Hobart, Dec 200
Minimisation of Multiplicity Tree Automata
We consider the problem of minimising the number of states in a multiplicity
tree automaton over the field of rational numbers. We give a minimisation
algorithm that runs in polynomial time assuming unit-cost arithmetic. We also
show that a polynomial bound in the standard Turing model would require a
breakthrough in the complexity of polynomial identity testing by proving that
the latter problem is logspace equivalent to the decision version of
minimisation. The developed techniques also improve the state of the art in
multiplicity word automata: we give an NC algorithm for minimising multiplicity
word automata. Finally, we consider the minimal consistency problem: does there
exist an automaton with states that is consistent with a given finite
sample of weight-labelled words or trees? We show that this decision problem is
complete for the existential theory of the rationals, both for words and for
trees of a fixed alphabet rank.Comment: Paper to be published in Logical Methods in Computer Science. Minor
editing changes from previous versio
Change of basis for m-primary ideals in one and two variables
Following recent work by van der Hoeven and Lecerf (ISSAC 2017), we discuss
the complexity of linear mappings, called untangling and tangling by those
authors, that arise in the context of computations with univariate polynomials.
We give a slightly faster tangling algorithm and discuss new applications of
these techniques. We show how to extend these ideas to bivariate settings, and
use them to give bounds on the arithmetic complexity of certain algebras.Comment: In Proceedings ISSAC'19, ACM, New York, USA. See proceedings version
for final formattin
Parallel sparse interpolation using small primes
To interpolate a supersparse polynomial with integer coefficients, two
alternative approaches are the Prony-based "big prime" technique, which acts
over a single large finite field, or the more recently-proposed "small primes"
technique, which reduces the unknown sparse polynomial to many low-degree dense
polynomials. While the latter technique has not yet reached the same
theoretical efficiency as Prony-based methods, it has an obvious potential for
parallelization. We present a heuristic "small primes" interpolation algorithm
and report on a low-level C implementation using FLINT and MPI.Comment: Accepted to PASCO 201
No occurrence obstructions in geometric complexity theory
The permanent versus determinant conjecture is a major problem in complexity
theory that is equivalent to the separation of the complexity classes VP_{ws}
and VNP. Mulmuley and Sohoni (SIAM J. Comput., 2001) suggested to study a
strengthened version of this conjecture over the complex numbers that amounts
to separating the orbit closures of the determinant and padded permanent
polynomials. In that paper it was also proposed to separate these orbit
closures by exhibiting occurrence obstructions, which are irreducible
representations of GL_{n^2}(C), which occur in one coordinate ring of the orbit
closure, but not in the other. We prove that this approach is impossible.
However, we do not rule out the general approach to the permanent versus
determinant problem via multiplicity obstructions as proposed by Mulmuley and
Sohoni.Comment: Substantial revision. This version contains an overview of the proof
of the main result. Added material on the model of power sums. Theorem 4.14
in the old version, which had a complicated proof, became the easy Theorem
5.4. To appear in the Journal of the AM
- …