Skip to main content
Skip to search
Open Access Journals
Sign in
(new window)
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science
Sign in
(new window)
Articles & Issues
All articles
All accepted articles
All volumes
Last volume
Sections
Special issues
Authors
About
The journal
Indexing
Boards
Publish
For authors
Ethical charter
Submit
Home > Articles & Issues >
Articles >
Long increasing subs ...
Article
Long increasing subsequences and non-algebraicity
Miklos Bona
Download article
Open on arXiv
Cite
Metadata
TEI
Dublin Core
Crossref
ZB Jats
DOAJ
BibTeX
CSL
OpenAire
JSON
Share
Bluesky
Facebook
LinkedIn
Mail
WhatsApp
X
Publication details
Submitted on
November 11, 2023
Accepted on
June 18, 2024
Published on
August 21, 2024
Last modified on
March 27, 2025
Special issue 26
vol. 26:1, Permutation Patterns 2023
Special issues
DOI
10.46298/dmtcs.12539
License
Attribution 4.0 International (CC BY 4.0)
Indicators
625
Views
491
Downloads
Long increasing subsequences and non-algebraicity
Miklos Bona
Abstract
We use a recent result of Alin Bostan to prove that the generating functions of two infinite sequences of permutation classes are not algebraic. Comment: 9 pages
Keywords
Mathematics - Combinatorics
05A05
Mathematics Subject Classification 2020
05A05
- Permutations, words, matrices
05A15
- Exact enumeration problems, generating functions
Preview
Loading PDF preview...
