Recurrence Relations, Succession Rules, and the Positivity Problem

DOI10.1007/978-3-319-15579-1_39zbMath1425.05020OpenAlexW4232990990MaRDI QIDQ2799201

Renzo Pinzani, Elisa Pergola, Simone Rinaldi, Stefano Bilotta

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2158/983798

zbMATH Keywords

\(C\)-recurrencespositive numbers sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Enumerative combinatorics (05A99)

Related Items (1)

Matrix characterizations of Riordan arrays

Cites Work

• Positivity of third order linear recurrence sequences
• A holonomic systems approach to special functions identities
• Positive rational sequences
• The number of Baxter permutations
• Jumping succession rules and their generating functions
• An algebraic characterization of the set of succession rules
• Avoiding cross-bifix-free binary words
• Regular languages and their generating functions: The inverse problem
• Another proof of Soittola's theorem
• Positivity of second order linear recurrent sequences
• Deux propriétés décidables des suites récurrentes linéaires
• ECO:a methodology for the enumeration of combinatorial objects
• On positive matrices
• A technology for reverse-engineering a combinatorial problem from a rational generating function
• Unnamed Item
• Unnamed Item

This page was built for publication: Recurrence Relations, Succession Rules, and the Positivity Problem