1 citations · 1 across the 3 of their papers we have counts for
3 papers
math.RA2023
Order bounds for -finite sequences
Manuel Kauers, Philipp Nuspl, Veronika Pillwein
A sequence is called -finite if it satisfies a linear recurrence with constant coefficients. We study sequences which satisfy a linear recurrence with -finite coefficients. R…
math.FA2010
Dominance in the family of Sugeno-Weber t-norms
Manuel Kauers, Veronika Pillwein, Susanne Saminger-Platz
The dominance relationship between two members of the family of Sugeno Weber t-norms is proven by using a quantifer elimination algorithm. Further it is shown that dominance is a t…
cs.SC2010★ 1 cited
When can we decide that a P-finite sequence is positive?
Manuel Kauers, Veronika Pillwein
We consider two algorithms which can be used for proving positivity of sequences that are defined by a linear recurrence equation with polynomial coefficients (P-finite sequences).…