Bounds for Recurrences on Ranked Posets

UNCG Author/Contributor (non-UNCG co-authors, if there are any, appear on document)
Filip Saidak, Assistant Professor (Creator)
Institution
The University of North Carolina at Greensboro (UNCG )
Web Site: http://library.uncg.edu/

Abstract: This note considers an extension of the concept of linear recurrence to recurrences on ranked posets. Some results on growth rates in the linear case are then extended to this generalized scenario. The work is motivated by recent results on multi-dimensional recurrences which have had applications for obtaining bounds for complex multidimensional generating functions. Some further connections to Möbius functions for binary relations and inverses of {0, 1} triangular matrices are also discussed.

Additional Information

Publication
International Journal of Contemporary Mathematical Sciences, 2(19), 929-942
Language: English
Date: 2007
Keywords
Explicit bounds, Recurrences, Ranked posets, Directed graphs, Möbius functions, Level graphs, Difference equations, Growth rates, Nonconstant coefficients, {0, 1} matrices

Email this document to