Generating trees growing on the left for pattern-avoiding inversion sequences

This work concerns a construction of pattern-avoiding inversion sequences from right to left we call the generating tree growing on the left. We first apply this construction to inversion sequences avoiding 201 and 210, resulting in a new way of computing their generating function. We then use a slightly modified construction to compute the generating function of inversion sequences avoiding 010 and 102, which was only conjectured before. These generating functions are algebraic in both instances. We end by discussing how the generating tree growing on the left can be applied in a more general setting. 23 pages, 3 figures, 1 table

Authors

Publication Details

Journal
Discrete Mathematics & Theoretical Computer Science
Published
2025-09-23
DOI
https://doi.org/10.46298/dmtcs.14716
Primary Topic
Algorithms and Data Compression
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Generating trees growing on the left for pattern-avoiding inversion sequences

Benjamin Testart
Discrete Mathematics & Theoretical Computer Science
Algorithms and Data Compression
article

Generating trees growing on the left for pattern-avoiding inversion sequences

Benjamin Testart
article en

Abstract

This work concerns a construction of pattern-avoiding inversion sequences from right to left we call the generating tree growing on the left. We first apply this construction to inversion sequences avoiding 201 and 210, resulting in a new way of computing their generating function. We then use a slightly modified construction to compute the generating function of inversion sequences avoiding 010 and 102, which was only conjectured before. These generating functions are algebraic in both instances. We end by discussing how the generating tree growing on the left can be applied in a more general setting. 23 pages, 3 figures, 1 table

Discrete Mathematics & Theoretical Computer ScienceVol. vol. 27:1, Permutation...(Special issues)
Sustainable cities and communities
Openalex Percentile: Top 100%
Algorithms and Data Compression
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.

Generating trees growing on the left for pattern-avoiding inversion sequences — Benjamin Testart · Discrete Mathematics & Theoretical Computer Science (2025) | TGRS Research Map | TGRS