Page 1

Displaying 1 – 5 of 5

Showing per page

The cyclicity problem for the images of Q-rational series

Juha Honkala (2011)

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

We show that it is decidable whether or not a given Q-rational series in several noncommutative variables has a cyclic image. By definition, a series r has a cyclic image if there is a rational number q such that all nonzero coefficients of r are integer powers of q.

The cyclicity problem for the images of Q-rational series

Juha Honkala (2012)

RAIRO - Theoretical Informatics and Applications

We show that it is decidable whether or not a given Q-rational series in several noncommutative variables has a cyclic image. By definition, a series r has a cyclic image if there is a rational number q such that all nonzero coefficients of r are integer powers of q.

The minimal resultant locus

Robert Rumely (2015)

Acta Arithmetica

Let K be a complete, algebraically closed nonarchimedean valued field, and let φ(z) ∈ K(z) have degree d ≥ 2. We study how the resultant of φ varies under changes of coordinates. For γ ∈ GL₂(K), we show that the map γ o r d ( R e s ( φ γ ) ) factors through a function o r d R e s φ ( · ) on the Berkovich projective line, which is piecewise affine and convex up. The minimal resultant is achieved either at a single point in P ¹ K , or on a segment, and the minimal resultant locus is contained in the tree in P ¹ K spanned by the fixed points and poles...

The positivity problem for fourth order linear recurrence sequences is decidable

Pinthira Tangsupphathawat, Narong Punnim, Vichian Laohakosol (2012)

Colloquium Mathematicae

The problem whether each element of a sequence satisfying a fourth order linear recurrence with integer coefficients is nonnegative, referred to as the Positivity Problem for fourth order linear recurrence sequence, is shown to be decidable.

Currently displaying 1 – 5 of 5

Page 1