Left-eigenvectors are certificates of the Orbit Problem

03/26/2018
by   Steven de Oliveira, et al.
0

This paper investigates the connexion between the Kannan-Lipton Orbit Problem and the polynomial invariant generator algorithm PILA based on eigenvectors computation. Namely, we reduce the problem of generating linear and polynomial certificates of non-reachability for the Orbit Problem for linear transformations with rational coefficients to the generalized eigenvector problem. Also, we prove the existence of such certificates for any transformation with integer coefficients, which is not the case with rational coefficients.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/09/2018

Definite Sums as Solutions of Linear Recurrences With Polynomial Coefficients

We present an algorithm which, given a linear recurrence operator L with...
research
03/13/2020

Transforming ODEs and PDEs with radical coefficients into rational coefficients

We present an algorithm that transforms, if possible, a given ODE or PDE...
research
08/02/2020

Decision problems for linear recurrences involving arbitrary real numbers

We study the decidability of the Skolem Problem, the Positivity Problem,...
research
09/28/2019

Equivariant Hilbert series for hierarchical models

Toric ideals to hierarchical models are invariant under the action of a ...
research
09/30/2021

Efficient computations with counting functions on free groups and free monoids

We present efficient algorithms to decide whether two given counting fun...
research
05/11/2017

Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant K

We consider systems A_ℓ(t) y(q^ℓ t) + ... + A_0(t) y(t) = b(t) of higher...
research
01/27/2019

Existence Problem of Telescopers for Rational Functions in Three Variables: the Mixed Cases

We present criteria on the existence of telescopers for trivariate ratio...

Please sign up or login with your details

Forgot password? Click here to reset