George Labahn | DeepAI

AI Chat

Featured Co-authors

Wei Zhou
116 publications
Hui Huang
61 publications
Mohab Safey El Din
36 publications
Eric Schost
27 publications
Vincent Neiger
26 publications
Shaoshi Chen
18 publications
Jean-Charles Faugère
12 publications
Robert M. Corless
12 publications
Mark Giesbrecht
9 publications
Thi Xuan Vu
7 publications
Qing-Hu Hou
6 publications

∙ 09/21/2022

A cubic algorithm for computing the Hermite normal form of a nonsingular integer matrix

A Las Vegas randomized algorithm is given to compute the Hermite normal ...

0 Stavros Birmpilis, et al. ∙

∙ 02/18/2022

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

Consider a matrix 𝐅∈𝕂[x]^m × n of univariate polynomials over a field 𝕂....

0 George Labahn, et al. ∙

∙ 02/15/2022

Bohemian Matrix Geometry

A Bohemian matrix family is a set of matrices all of whose entries are d...

0 Robert M. Corless, et al. ∙

∙ 11/18/2021

A fast algorithm for computing the Smith normal form with multipliers for a nonsingular integer matrix

A Las Vegas randomized algorithm is given to compute the Smith multiplie...

0 Stavros Birmpilis, et al. ∙

∙ 09/02/2020

Computing critical points for invariant algebraic systems

Let 𝐊 be a field and ϕ, 𝐟 = (f_1, …, f_s) in 𝐊[x_1, …, x_n] be multivari...

0 Jean-Charles Faugère, et al. ∙

∙ 09/02/2020

Homotopy techniques for solving sparse column support determinantal polynomial systems

Let 𝐊 be a field of characteristic zero with 𝐊 its algebraic closure. Gi...

0 George Labahn, et al. ∙

∙ 02/01/2020

Efficient q-Integer Linear Decomposition of Multivariate Polynomials

We present two new algorithms for the computation of the q-integer linea...

0 Mark Giesbrecht, et al. ∙

∙ 09/15/2019

Efficient Rational Creative Telescoping

We present a new algorithm to compute minimal telescopers for rational f...

0 Mark Giesbrecht, et al. ∙

∙ 04/25/2019

Constructing minimal telescopers for rational functions in three discrete variables

We present a new algorithm for constructing minimal telescopers for rati...

0 Shaoshi Chen, et al. ∙

∙ 12/11/2018

Computing Nearby Non-trivial Smith Forms

We consider the problem of computing the nearest matrix polynomial with ...

0 Mark Giesbrecht, et al. ∙

∙ 12/11/2017

Computing Lower Rank Approximations of Matrix Polynomials

Given an input matrix polynomial whose coefficients are floating point n...

0 Mark Giesbrecht, et al. ∙

∙ 07/14/2016

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 ...

0 George Labahn, et al. ∙

∙ 02/05/2016

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 × ...

0 George Labahn, et al. ∙

∙ 01/12/2016

Existence Problem of Telescopers: Beyond the Bivariate Case

In this paper, we solve the existence problem of telescopers for rationa...

0 Shaoshi Chen, et al. ∙

∙ 09/18/2014

A Bayesian model for recognizing handwritten mathematical expressions

Recognizing handwritten mathematics is a challenging classification prob...

0 Scott MacLean, et al. ∙

Are you a researcher?
Expose your work
to one of the largest
A.I. communities in the world