AbstractWe give a decision method for the Positivity Problem for second order recurrent sequences: it is decidable whether or not a recurrent sequence defined by un=aun-1+bun-2 has only nonnegative terms
Abstract. We consider the decidability and complexity of the Ultimate Positivity Problem, which asks...
The set of indices that correspond to the positive entries of a sequence ofnumbers is called its pos...
International audienceThe Skolem problem is a long-standing open problem in linear dynamical systems...
We study decision problems for sequences which obey a second-order holonomic recurrence of the form ...
AbstractIt is shown that the Positivity Problem for a sequence satisfying a third order linear recur...
Linear recurrence sequences permeate a vast number of areas of mathematics and computer science. In ...
Abstract. Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem asks wh...
The objective of this thesis is to shed some light on the boundaries of decidability by answering so...
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely th...
The set of indices that correspond to the positive entries of a sequence of numbers is called its po...
An infinite sequence ⟨u_n⟩_n of real numbers is holonomic (also known as P-recursive or P-finite) if...
We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity...
An infinite sequence ?u_n?_n of real numbers is holonomic (also known as P-recursive or P-finite) if...
Abstract. We consider two computational problems for linear recur-rence sequences (LRS) over the int...
Abstract. We consider the decidability and complexity of the Ultimate Positivity Problem, which asks...
Abstract. We consider the decidability and complexity of the Ultimate Positivity Problem, which asks...
The set of indices that correspond to the positive entries of a sequence ofnumbers is called its pos...
International audienceThe Skolem problem is a long-standing open problem in linear dynamical systems...
We study decision problems for sequences which obey a second-order holonomic recurrence of the form ...
AbstractIt is shown that the Positivity Problem for a sequence satisfying a third order linear recur...
Linear recurrence sequences permeate a vast number of areas of mathematics and computer science. In ...
Abstract. Given a linear recurrence sequence (LRS) over the integers, the Positivity Problem asks wh...
The objective of this thesis is to shed some light on the boundaries of decidability by answering so...
We consider two decision problems for linear recurrence sequences (LRS) over the integers, namely th...
The set of indices that correspond to the positive entries of a sequence of numbers is called its po...
An infinite sequence ⟨u_n⟩_n of real numbers is holonomic (also known as P-recursive or P-finite) if...
We study the decidability of the Skolem Problem, the Positivity Problem, and the Ultimate Positivity...
An infinite sequence ?u_n?_n of real numbers is holonomic (also known as P-recursive or P-finite) if...
Abstract. We consider two computational problems for linear recur-rence sequences (LRS) over the int...
Abstract. We consider the decidability and complexity of the Ultimate Positivity Problem, which asks...
Abstract. We consider the decidability and complexity of the Ultimate Positivity Problem, which asks...
The set of indices that correspond to the positive entries of a sequence ofnumbers is called its pos...
International audienceThe Skolem problem is a long-standing open problem in linear dynamical systems...
DOI
Add to ORKG