𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The greatest common divisor of certain sets of binomial coefficients

✍ Scribed by H Joris; C Oestreicher; J Steinig

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
701 KB
Volume
21
Category
Article
ISSN
0022-314X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Estimation of the Greatest Common Diviso
Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method
✍ Dimitrios Christou; Marilena Mitrouli πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons βš– 146 KB

The computation of the Greatest Common Divisor (GCD) of a set of more than two polynomials is a non-generic problem. There are cases where iterative methods of computing the GCD of many polynomials, based on the Euclidean algorithm, fail to produce accurate results, when they are implemented in a so

Barnett’s Theorems About the Greatest Co
Barnett’s Theorems About the Greatest Common Divisor of Several Univariate Polynomials Through Bezout-like Matrices
✍ Gema M. Diaz-Toca; Laureano Gonzalez-Vega πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 311 KB

This article provides a new presentation of Barnett's theorems giving the degree (resp. coefficients) of the greatest common divisor of several univariate polynomials with coefficients in an integral domain by means of the rank (resp. linear dependencies of the columns) of several Bezout-like matric