Skip to main content
Journal ArticleOPEN ACCESS

Permutations which are the union of an increasing and a decreasing subsequence

Electronic Journal of Combinatorics (1998) 5(1)
DOI: 10.37236/1344
27Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

It is shown that there are (n2n) - ∑m=0n-1 2n-m-1(m2m) permutations which are the union of an increasing sequence and a decreasing sequence.

References Powered by Scopus

Forbidden subsequences

Discrete Mathematics
103Citations
N/AReaders
Get full text

Partitioning permutations into increasing and decreasing subsequences

Journal of Combinatorial Theory. Series A
29Citations
N/AReaders
Get full text
View more at Scopus

Cited by Powered by Scopus

Simple permutations and pattern restricted permutations

Discrete Mathematics
99Citations
N/AReaders
Get full text

Geometric grid classes of permutations

Transactions of the American Mathematical Society
50Citations
N/AReaders
Get full text

Restricted permutations and the wreath product

Discrete Mathematics
48Citations
N/AReaders
Get full text
View more at Scopus

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Atkinson, M. D. (1998). Permutations which are the union of an increasing and a decreasing subsequence. Electronic Journal of Combinatorics, 5(1). https://doi.org/10.37236/1344

Readers' Seniority

Tooltip

Professor / Associate Prof. 3

50%

Lecturer / Post doc 1

17%

PhD / Post grad / Masters / Doc 1

17%

Researcher 1

17%

Readers' Discipline

Tooltip

Computer Science 3

60%

Mathematics 2

40%

Article Metrics

Tooltip
Mentions
References: 2

Save time finding and organizing research with Mendeley

Sign up for free