In this paper we present a method to pass from a given recurrence relation with constant coefficients (in short, a C-finite recurrence) to a finite succession rule defining the same number sequence. Our method consists in two steps: first, we transform the given recurrence relation into an extended succession rule, then we provide a series of operations to reduce such an extended succession rule into an ordinary succession rule, equivalent to the previous one. As a byproduct, our method can be used to investigate the positivity of a C-finite recurrence.

Bilotta, S., Pergola, E., Pinzani, R., Rinaldi, S. (2019). Recurrence relations, succession rules and the positivity problem. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 104, 102-118 [10.1016/j.jcss.2016.09.006].

Recurrence relations, succession rules and the positivity problem

Rinaldi, S.
2019-01-01

Abstract

In this paper we present a method to pass from a given recurrence relation with constant coefficients (in short, a C-finite recurrence) to a finite succession rule defining the same number sequence. Our method consists in two steps: first, we transform the given recurrence relation into an extended succession rule, then we provide a series of operations to reduce such an extended succession rule into an ordinary succession rule, equivalent to the previous one. As a byproduct, our method can be used to investigate the positivity of a C-finite recurrence.
2019
Bilotta, S., Pergola, E., Pinzani, R., Rinaldi, S. (2019). Recurrence relations, succession rules and the positivity problem. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 104, 102-118 [10.1016/j.jcss.2016.09.006].
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11365/1035217