Long increasing subsequences and non-algebraicity

We use a recent result of Alin Bostan to prove that the generating functions of two infinite sequences of permutation classes are not algebraic.

Authors

Institutions

Publication Details

Journal
Discrete Mathematics & Theoretical Computer Science
Published
2024-08-21
DOI
https://doi.org/10.46298/dmtcs.12539
Primary Topic
Computability, Logic, AI Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Long increasing subsequences and non-algebraicity

Miklós Bóna
Discrete Mathematics & Theoretical Computer Science
Computability, Logic, AI Algorithms
article

Long increasing subsequences and non-algebraicity

Miklós Bóna
article en

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.

Discrete Mathematics & Theoretical Computer ScienceVol. vol. 26:1, Permutation...(Special issues)
University of Florida (US)
Reduced inequalities
Openalex Percentile: Top 84%
Computability, Logic, AI Algorithms
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Long increasing subsequences and non-algebraicity — Miklós Bóna · Discrete Mathematics & Theoretical Computer Science (2024) | TGRS Research Map | TGRS