Displaying 301 – 320 of 2843

Showing per page

An improvement of Euclid's algorithm

Zítko, Jan, Kuřátko, Jan (2010)

Programs and Algorithms of Numerical Mathematics

The paper introduces the calculation of a greatest common divisor of two univariate polynomials. Euclid’s algorithm can be easily simulated by the reduction of the Sylvester matrix to an upper triangular form. This is performed by using c - s transformation and Q R -factorization methods. Both procedures are described and numerically compared. Computations are performed in the floating point environment.

An overview of some recent developments on integer-valued polynomials: Answers and Questions

Jean-Luc Chabert (2010)

Actes des rencontres du CIRM

The purpose of my talk is to give an overview of some more or less recent developments on integer-valued polynomials and, doing so, to emphasize that integer-valued polynomials really occur in different areas: combinatorics, arithmetic, number theory, commutative and non-commutative algebra, topology, ultrametric analysis, and dynamics. I will show that several answers were given to open problems, and I will raise also some new questions.

Anneaux de Fatou

Benali Benzaghou (1968/1969)

Séminaire Delange-Pisot-Poitou. Théorie des nombres

Currently displaying 301 – 320 of 2843