A Method to Prove the Nonrationality of Some Combinatorial Generating Functions

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We are presenting a new method to prove that certain combinatorial generating functions are not rational. We show several applications of our method, such as permutation patterns, t-stack sortable permutations, and classic examples of algebraic generating functions, such as lattice paths.

Cite

CITATION STYLE

APA

Bóna, M. (2020). A Method to Prove the Nonrationality of Some Combinatorial Generating Functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12118 LNCS, pp. 559–570). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-61792-9_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free