Longest alternating subsequences of permutations

被引:36
|
作者
Stanley, Richard P. [1 ]
机构
[1] MIT, Dept Math 2 375, Cambridge, MA 02139 USA
基金
美国国家科学基金会;
关键词
D O I
10.1307/mmj/1220879431
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
[No abstract available]
引用
收藏
页码:675 / 687
页数:13
相关论文
共 50 条
  • [21] LIL for the Length of the Longest Increasing Subsequences
    Zhong-gen SU
    Acta Mathematicae Applicatae Sinica, 2020, 36 (02) : 283 - 293
  • [22] LIL for the Length of the Longest Increasing Subsequences
    Zhong-gen Su
    Acta Mathematicae Applicatae Sinica, English Series, 2020, 36 : 283 - 293
  • [23] The Preisach graph and longest increasing subsequences
    Ferrari, Patrik L.
    Mungan, Muhittin
    Terzi, M. Mert
    ANNALES DE L INSTITUT HENRI POINCARE D, 2022, 9 (04): : 643 - 657
  • [24] Longest increasing subsequences in sliding windows
    Albert, MH
    Golynski, A
    Hamel, AM
    López-Ortiz, A
    Rao, SS
    Safari, MA
    THEORETICAL COMPUTER SCIENCE, 2004, 321 (2-3) : 405 - 414
  • [25] LONGEST COMMON SUBSEQUENCES IN SETS OF WORDS
    Bukh, Boris
    Ma, Jie
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (04) : 2042 - 2049
  • [26] Computing Longest (Common) Lyndon Subsequences
    Bannai, Hideo
    Tomohiro, I
    Kociumaka, Tomasz
    Koppl, Dominik
    Puglisi, Simon J.
    COMBINATORIAL ALGORITHMS (IWOCA 2022), 2022, 13270 : 128 - 142
  • [27] Posets of Matrices and Permutations with Forbidden Subsequences
    Nigel Ray
    Julian West
    Annals of Combinatorics, 2003, 7 (1) : 55 - 88
  • [28] COMPUTING LENGTH OF LONGEST INCREASING SUBSEQUENCES
    FREDMAN, ML
    DISCRETE MATHEMATICS, 1975, 11 (01) : 29 - 35
  • [29] Longest Increasing Subsequences and Log Concavity
    Miklós Bóna
    Marie-Louise Lackner
    Bruce E. Sagan
    Annals of Combinatorics, 2017, 21 : 535 - 549
  • [30] Small Longest Tandem Scattered Subsequences
    Russo, Luis M. S.
    Francisco, Alexandre P.
    SCIENTIFIC ANNALS OF COMPUTER SCIENCE, 2021, 31 (01) : 79 - 110