activity
19972022
most citedHigh Probability Analysis of the Condition Number of Sparse Polynomial Systems

43 citations · 137 across the 39 of their papers we have counts for

collaborators

39 papers

cs.SC2022

Sturm's Theorem with Endpoints

Philippe Pébay, J. Maurice Rojas, David C. Thompson

Sturm's Theorem is a fundamental 19th century result relating the number of real roots of a polynomial in an interval to the number of sign alternations in a sequence of polyno…

math.AG2022

Trinomials and Deterministic Complexity Limits for Real Solving

Emma Boniface, Weixun Deng, J. Maurice Rojas

We detail an algorithm that -- for all but a fraction of with exactly monomial terms, degree , and all coefficients in $\{-H,\ldo…

math.NT2021

Root Repulsion and Faster Solving for Very Sparse Polynomials Over -adic Fields

J. Maurice Rojas, Yuyu Zhu

For any fixed field , we prove that all polynomials with exactly (resp. ) monomial terms,…

math.NT2021

Sub-Linear Point Counting for Variable Separated Curves over Prime Power Rings

Caleb Robelle, J. Maurice Rojas, Yuyu Zhu

Let with prime and let be a bivariate polynomial with degree and all coefficients of absolute value at most . Suppose als…

math.NT2020

Computing zeta functions of large polynomial systems over finite fields

Qi Cheng, J. Maurice Rojas, Daqing Wan

In this paper, we improve the algorithms of Lauder-Wan \cite{LW} and Harvey \cite{Ha} to compute the zeta function of a system of polynomial equations in variables over the…

math.NT2020★ 1 cited

A complexity chasm for solving univariate sparse polynomial equations over -adic fields

J. Maurice Rojas, Yuyu Zhu

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed fie…