Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 588

The DOI matches its Crossref record.

Longest Increasing and Decreasing Subsequences

Schensted, C.·2009·Classic Papers in Combinatorics

Abstract

This paper deals with finite sequences of integers. Typical of the problems we shall treat is the determination of the number of sequences of length n , consisting of the integers 1,2, ... , m , which have a longest increasing subsequence of length α. Throughout the first part of the paper we will deal only with sequences in which no numbers are repeated. In the second part we will extend the results to include the possibility of repetition. Our results will be stated in terms of standard Young tableaux.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/978-0-8176-4842-8_21

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 588

Metadata

Authors
Schensted, C.
Venue
Classic Papers in Combinatorics
Published
2009
Pages
299-311
OpenAlex
W2014678176
Cited by
588
References
0
FWCI
31.78
Type
book chapter
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Longest Increasing and Decreasing Subsequences. https://app.cochat.ai/papers/10.1007/978-0-8176-4842-8_21
The paper
Schensted, C. (2009). Longest Increasing and Decreasing Subsequences. Classic Papers in Combinatorics. https://doi.org/10.1007/978-0-8176-4842-8_21

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.