activity
20062026
most citedLocal polynomial factorisation: improving the Montes algorithm

7 citations · 14 across the 16 of their papers we have counts for

collaborators

19 papers

cs.SC2026★ 7 cited

Local polynomial factorisation: improving the Montes algorithm

Poteaux Adrien, Weimann Martin

We improve significantly the Nart-Montes algorithm for factoring polynomials over a complete discrete valuation ring . Our first contribution is to extend the Hensel le…

math.AG2026

Fast computation of Riemann-Roch spaces for singular curves

Dounia Darkaoui, Martin Weimann

Let C be a projective curve defined over a field k and let D be a divisor of C. The Riemann-Roch space L(D) is the set of rational functions on C for which certain zeros are impose…

math.AG2025

Hyperflex loci of hypersurfaces

Cristina Bertone, Martin Weimann

The -flex locus of a projective hypersurface is the locus of points such that there is a line with order of contact at least with at .…

math.AC2025

Improvements of convex-dense factorization of bivariate polynomials

Martin Weimann

We develop a new algorithm for factoring a bivariate polynomial which takes fully advantage of the geometry of the Newton polygon of . Under a non degener…

math.NT2024

Fast computation of integral bases

Adrien Poteaux, Martin Weimann

We obtain new complexity bounds for computing a triangular integral basis of a number field or a function field. We reach for function fields a softly linear cost with respect to t…

math.AC2022★ 1 cited

Polynomial factorization over henselian fields

Maria Alberich-Carramiñana, Jordi Guàrdia, Enric Nart +3

Given a valued field and an irreducible polynomial , we survey the ideas of Ore, Maclane, Okutsu, Montes, Vaquié and Herrera-Olalla-Mahboub-Spivakovsky, leading…