Displaying similar documents to “Shift equivalence of P-finite sequences.”

D0L sequence equivalence is in P for fixed alphabets

Keijo Ruohonen (2008)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

Similarity:

A new algorithm is presented for the D0L sequence equivalence problem which, when the alphabets are fixed, works in time polynomial in the rest of the input data. The algorithm uses a polynomial encoding of words and certain well-known properties of ℤ -rational sequences.

On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials

Akritas, Alkiviadis, Malaschonok, Gennadi, Vigklas, Panagiotis (2015)

Serdica Journal of Computing

Similarity:

In 1917 Pell (1) and Gordon used sylvester2, Sylvester’s little known and hardly ever used matrix of 1853, to compute(2) the coefficients of a Sturmian remainder — obtained in applying in Q[x], Sturm’s algorithm on two polynomials f, g ∈ Z[x] of degree n — in terms of the determinants (3) of the corresponding submatrices of sylvester2. Thus, they solved a problem that had eluded both J. J. Sylvester, in 1853, and E. B. Van Vleck, in 1900. (4) In this paper we extend the work by Pell...

Topics in computational algebraic number theory

Karim Belabas (2004)

Journal de Théorie des Nombres de Bordeaux

Similarity:

We describe practical algorithms from computational algebraic number theory, with applications to class field theory. These include basic arithmetic, approximation and uniformizers, discrete logarithms and computation of class fields. All algorithms have been implemented in the system.

Pivoting algorithm in class of ABS methods

Gabriela Kálnová (1996)

Archivum Mathematicum

Similarity:

Summary: The paper deals with a pivoting modification of the algorithm in the class of ABS methods. Numerical experiments compare this pivoting modification with the fundamental version. A hybrid algorithm for the solution of the linear system with the Hankel matrix is introduced.