
Computing critical points for invariant algebraic systems
Let π be a field and Ο, π = (f_1, β¦, f_s) in π[x_1, β¦, x_n] be multivari...
read it

Homotopy techniques for solving sparse column support determinantal polynomial systems
Let π be a field of characteristic zero with π its algebraic closure. Gi...
read it

Efficient qInteger Linear Decomposition of Multivariate Polynomials
We present two new algorithms for the computation of the qinteger linea...
read it

Efficient Rational Creative Telescoping
We present a new algorithm to compute minimal telescopers for rational f...
read it

Constructing minimal telescopers for rational functions in three discrete variables
We present a new algorithm for constructing minimal telescopers for rati...
read it

Computing Nearby Nontrivial Smith Forms
We consider the problem of computing the nearest matrix polynomial with ...
read it

Computing Lower Rank Approximations of Matrix Polynomials
Given an input matrix polynomial whose coefficients are floating point n...
read it

Fast, deterministic computation of the Hermite normal form and determinant of a polynomial matrix
Given a nonsingular n Γ n matrix of univariate polynomials over a field ...
read it

A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix
Given a square, nonsingular matrix of univariate polynomials FβK[x]^n Γ ...
read it

Existence Problem of Telescopers: Beyond the Bivariate Case
In this paper, we solve the existence problem of telescopers for rationa...
read it

A Bayesian model for recognizing handwritten mathematical expressions
Recognizing handwritten mathematics is a challenging classification prob...
read it
George Labahn
is this you? claim profile