2 papers
cs.SC2026
Refined complexity bounds for rational reconstruction and XGCD through Padé approximants and Cauchy interpolants
Vincent Neiger, Mohab Safey El Din, Kevin Tran
When computing with univariate polynomials, two fundamental and related problems are the XGCD and rational reconstruction, classically solved in quasi-linear complexity using the h…
math.MG2026
An optimization problem for triangles
Tommy Murphy, Kevin Tran
We consider the problem of optimizing the product of the distances from a given point in a triangle to each vertex. There are two possible cases in general. For isosceles triangles…