Math 2.0

Resources / preprint

Motzkin Numbers Count 2-Stack-Sortable Permutations Ending in Their Least Entry GCQ5YCQQHD

URIm2://res/GCQ5YCQQHD
Kindpreprint
CreatorsRyota Inagaki, Michael Luo
Date2026-10-02
MSC05-XX
Subjectsarxiv math.CO
Scopein

Expressions

e1: version, preprint

Languageen
Date2026-10-02
IdsarXiv 2610.02756, zbl_id 903195302

Items in this resource

The mentions of the inventory that name this resource. Each name links to the card of its inventory row.

ItemKindWhereSource
2P09J7QFR2statementproposition 2.2arxiv
661ZQ7Y61Jstatementtheorem 3.3arxiv
BWXT6MN4XFstatementlemma 3.2arxiv
C50EMG21PAexampleexample 2.4arxiv
EQYYZKMQGZexampleexample 3.4arxiv
HMQ3SWTPQEstatementlemma 2.3arxiv
RZ1Q3A0KCWstatementlemma 3.1arxiv
Y47DEC1CFGstatementlemma 3.6arxiv
YMV0WEQ0X7exampleexample 2.1arxiv
Z5A6YN6HKCexampleexample 3.5arxiv
ZKMFXKNZZZstatementtheorem 1.1arxiv

Catalogue records