activity
20172026
most citedComputing Canonical Bases of Modules of Univariate Relations

14 citations · 24 across the 6 of their papers we have counts for

collaborators
Showing cs.SCShow all

9 papers · 1 filter

cs.SC2026

A Symbolic Homotopy Algorithm for Solving Composable Polynomial Systems

Thi Xuan Vu

We study the problem of computing the isolated regular solutions of a system \((f_1,\ldots,f_n)\) of \(n\) polynomial equations in \(n\) variables \((X_1, \dots, X_n)\) over a fiel…

cs.SC2025

Computing Polynomial Representation in Subrings of Multivariate Polynomial Rings

Thi Xuan Vu

Let be a multivariate polynomial ring over a field of characteristic 0. Consider algebraically independent elements $g_…

cs.SC20232 cited

Faster real root decision algorithm for symmetric polynomials

George Labahn, Cordian Riener, Mohab Safey El Din +2

In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the a…

cs.SC2022

On the complexity of invariant polynomials under the action of finite reflection groups

Thi Xuan Vu

Let be a multivariate polynomial ring over a field . Let be a sequence of algebraically independent elements in $\…

cs.SC20223 cited

Rank-Sensitive Computation of the Rank Profile of a Polynomial Matrix

George Labahn, Vincent Neiger, Thi Xuan Vu +1

Consider a matrix of univariate polynomials over a field . We study the problem of computing the column rank profile of $\ma…

cs.SC2020

Computing critical points for invariant algebraic systems

Jean-Charles Faugère, George Labahn, Mohab Safey El Din +2

Let be a field and , in be multivariate polynomials (with ) invariant under the action of $\m…