3 papers
cs.SC2026
Learning Fast Monomial Orders for Gröbner Basis Computations
R. Caleb Bunch, Alperen A. Ergür, Melika Golestani +3
The efficiency of Gröbner basis computation, the standard engine for solving systems of polynomial equations, depends on the choice of monomial ordering. Despite a near-continuum…
math.OC2025
Optimal Preconditioning is a Geodesically Convex Optimization Problem
M. Levent DoÄan, Alperen Ergür, Elias Tsigaridas
We introduce a unified framework for computing approximately-optimal preconditioners for solving linear and non-linear systems of equations. We demonstrate that the condition numbe…
math.CO2024
The rank of sparse random matrices
Amin Coja-Oghlan, Alperen A. Ergür, Pu Gao +2
We determine the rank of a random matrix over an arbitrary field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the r…