Zobrazeno 1 - 10
of 17
pro vyhledávání: '"Pierre Lairez"'
Publikováno v:
Forum of Mathematics, Pi, Vol 11 (2023)
This work studies the average complexity of solving structured polynomial systems that are characterised by a low evaluation cost, as opposed to the dense random model previously used. Firstly, we design a continuation algorithm that computes, with h
Externí odkaz:
https://doaj.org/article/7f41a83f866c4e7da6addc621f981e9b
Publikováno v:
ACM Communications in Computer Algebra. 56:41-45
Problem statement. Let K be a field and K be an algebraic closure of K. Consider the polynomial ring R = K[ x 1 ,..., x n ] over K and a finite sequence of polynomials f 1 ,..., f c in R with c ≤ n. Let V ⊂ K n be the algebraic set defined by the
Autor:
Anton Leykin, Pierre Lairez
Publikováno v:
Journal of Symbolic Computation. 115:407-408
Publikováno v:
ACM Communications in Computer Algebra
ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2020, 54 (212), pp.9. ⟨10.1145/3427218.3427220⟩
ACM Communications in Computer Algebra, 2020, 54 (212), pp.9. ⟨10.1145/3427218.3427220⟩
ACM Communications in Computer Algebra, Association for Computing Machinery (ACM), 2020, 54 (212), pp.9. ⟨10.1145/3427218.3427220⟩
ACM Communications in Computer Algebra, 2020, 54 (212), pp.9. ⟨10.1145/3427218.3427220⟩
Software Presentation accepted at ISSAC '20 (Kalamata, Greece, July 20-22, 2020); International audience; We present in this extended abstract a new software designed to work with generating functions that count walks in the quarter plane. With this
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::be36f8f651c8bdfd71fc605d89525604
https://hal.inria.fr/hal-02902709/document
https://hal.inria.fr/hal-02902709/document
Publikováno v:
ISSAC'19
ISSAC 2019-International Symposium on Symbolic and Algebraic Computation
ISSAC 2019-International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China
ISSAC
ISSAC 2019-International Symposium on Symbolic and Algebraic Computation
ISSAC 2019-International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China
ISSAC
International audience; Let $S\subset R^n$ be a compact basic semi-algebraic set defined as the real solution set of multivariate polynomial inequalities with rational coefficients. We design an algorithm which takes as input a polynomial system defi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::49b8c47d7e4e275f3cf2e549ab691b52
https://hal.archives-ouvertes.fr/hal-02110556
https://hal.archives-ouvertes.fr/hal-02110556
Autor:
Pierre Lairez, Emre Can Sertöz
Publikováno v:
SIAM Journal on Applied Algebra and Geometry
SIAM Journal on Applied Algebra and Geometry, Society for Industrial and Applied Mathematics 2019, 3 (4), pp.559-584. ⟨10.1137/18M122861X⟩
SIAM Journal on Applied Algebra and Geometry, 2019, 3 (4), pp.559-584. ⟨10.1137/18M122861X⟩
SIAM Journal on Applied Algebra and Geometry, Society for Industrial and Applied Mathematics 2019, 3 (4), pp.559-584. ⟨10.1137/18M122861X⟩
SIAM Journal on Applied Algebra and Geometry, 2019, 3 (4), pp.559-584. ⟨10.1137/18M122861X⟩
International audience; Based on high precision computation of periods and lattice reduction techniques, we compute the Picard group of smooth surfaces in P3. As an application, we count the number of rational curves of a given degree lying on each s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a681a119250866d4bf3bce3becee8021
https://hal.archives-ouvertes.fr/hal-01932147v2/document
https://hal.archives-ouvertes.fr/hal-01932147v2/document
Publikováno v:
ISSAC 2018-International Symposium on Symbolic and Algebraic Computation
ISSAC 2018-International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York, United States. pp.1-8, ⟨10.1145/3208976.3208992⟩
ISSAC 2018-International Symposium on Symbolic and Algebraic Computation, Jul 2018, New York, United States. pp.1-8, ⟨10.1145/3208976.3208992⟩
Hermite reduction is a classical algorithmic tool in symbolic integration. It is used to decompose a given rational function as a sum of a function with simple poles and the derivative of another rational function. We extend Hermite reduction to arbi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d40f4457ff9084907d259043f8d73b33
https://inria.hal.science/hal-01788619/file/redct-final.pdf
https://inria.hal.science/hal-01788619/file/redct-final.pdf
Autor:
Pierre Lairez
Publikováno v:
Foundations of computational mathematics 2014, workshop “symbolic analysis”
Foundations of computational mathematics 2014, workshop “symbolic analysis”, Dec 2014, Montevideo, Uruguay
Mathematics of Computation
Mathematics of Computation, American Mathematical Society, 2016, 85, pp.1719-1752. ⟨10.1090/mcom/3054⟩
Mathematics of Computation, 2016, 85, pp.1719-1752. ⟨10.1090/mcom/3054⟩
Foundations of computational mathematics 2014, workshop “symbolic analysis”, Dec 2014, Montevideo, Uruguay
Mathematics of Computation
Mathematics of Computation, American Mathematical Society, 2016, 85, pp.1719-1752. ⟨10.1090/mcom/3054⟩
Mathematics of Computation, 2016, 85, pp.1719-1752. ⟨10.1090/mcom/3054⟩
A period of a rational integral is the result of integrating, with respect to one or several variables, a rational function over a closed path. This work focuses particularly on periods depending on a parameter: in this case the period under consider
Autor:
Pierre Lairez
Publikováno v:
Journal of the American Mathematical Society
Journal of the American Mathematical Society, In press, 33 (2), pp.487-526. ⟨10.1090/jams/938⟩
Journal of the American Mathematical Society, American Mathematical Society, In press, 33 (2), pp.487-526. ⟨10.1090/jams/938⟩
Journal of the American Mathematical Society, In press, 33 (2), pp.487-526. ⟨10.1090/jams/938⟩
Journal of the American Mathematical Society, American Mathematical Society, In press, 33 (2), pp.487-526. ⟨10.1090/jams/938⟩
How many operations do we need on average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale’s 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound (input size) 1 + o ( 1 )
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca3f5dcbed0e4bc5c42657eded0d3dc4
http://arxiv.org/abs/1711.03420
http://arxiv.org/abs/1711.03420
Publikováno v:
Journal of the ACM (JACM)
Journal of the ACM (JACM), 2018, 66 (1), pp.1-30. ⟨10.1145/3275242⟩
Journal of the ACM
Journal of the ACM (JACM), Association for Computing Machinery, 2018, 66 (1), pp.1-30. ⟨10.1145/3275242⟩
Journal of the ACM (JACM), 2018, 66 (1), pp.1-30. ⟨10.1145/3275242⟩
Journal of the ACM
Journal of the ACM (JACM), Association for Computing Machinery, 2018, 66 (1), pp.1-30. ⟨10.1145/3275242⟩
International audience; We describe and analyze an algorithm for computing the homology (Betti numbers and torsion coefficients) of basic semialgebraic sets which works in weak exponential time. That is, out of a set of exponentially small measure in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36a0d76380ea2eadaed0dff201e1fca7