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
Showing math.NTShow all

14 papers · 1 filter

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…

math.NT2017★ 9 cited

Counting Roots of Polynomials Over Prime Power Rings

Qi Cheng, Shuhong Gao, J. Maurice Rojas +1

Suppose is a prime, is a positive integer, and is a univariate polynomial of degree with coefficients of absolute value . We show that f…

math.NT2014★ 2 cited

Sparse Univariate Polynomials with Many Roots Over Finite Fields

Qi Cheng, Shuhong Gao, J. Maurice Rojas +1

Suppose is a prime power and is a univariate polynomial with exactly monomial terms and degree . To establish a finite field analogue of Descart…