On increasing subsequences of minimal Erdös-Szekeres permutations

被引：0

作者：

Zhong Gen Su

机构：

[1] Zhejiang University,Department of Mathematics

来源：

Acta Mathematica Sinica, English Series | 2011年 / 27卷

关键词：

Large deviation; minimal Erdös-Szekeres permutation; Robinson-Schensted-Knuth correspondence; Young tableaux; 60C05; 60F10;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Let π be a minimal Erdös-Szekeres permutation of 1, 2, ..., n2, and let ln,k be the length of the longest increasing subsequence in the segment (π(1), ..., π(k)). Under uniform measure we establish an exponentially decaying bound of the upper tail probability for ln,k, and as a consequence we obtain a complete convergence, which is an improvement of Romik’s recent result. We also give a precise lower exponential tail for ln,k.

引用

页码：1573 / 1580

页数：7

共 50 条

[41] Minimal actions of the group S(Z) of permutations of the integers
Glasner, E
Weiss, B
GEOMETRIC AND FUNCTIONAL ANALYSIS, 2002, 12 (05) : 964 - 988
[42] Inverse problems of the Erdős-Ko-Rado type theorems for families of vector spaces and permutations
Xiangliang Kong
Yuanxiao Xi
Bingchen Qian
Gennian Ge
Science China Mathematics, 2022, 65 : 1081 - 1108
[43] Inverse problems of the Erd?s-Ko-Rado type theorems for families of vector spaces and permutations
Xiangliang Kong
Yuanxiao Xi
Bingchen Qian
Gennian Ge
Science China(Mathematics), 2022, 65 (05) : 1081 - 1108
[44] On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph
Bradac, Domagoj
JOURNAL OF GRAPH THEORY, 2025, 108 (04) : 817 - 818
[45] A NOTE ON THE STRONG ERDŐS-HAJNAL PROPERTY FOR GRAPHS WITH BOUNDED VC-MINIMAL COMPLEXITY
Fu, Yayi
JOURNAL OF SYMBOLIC LOGIC, 2024,
[46] Minimal actions of the group \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$ {\Bbb S(Z)} $\end{document} of permutations of the integers
E. Glasner
B. Weiss
Geometric & Functional Analysis GAFA, 2002, 12 (5): : 964 - 988
[47] Erdős–Gyárfás conjecture for P8\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$P_8$$\end{document}-free graphs
Yuping Gao
Songling Shan
Graphs and Combinatorics, 2022, 38 (6)
[48] Towards a de Bruijn–Erdős Theorem in the \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$L_1$$\end{document}-Metric
Ida Kantor
Balázs Patkós
Discrete & Computational Geometry, 2013, 49 (3) : 659 - 670
[49] Induced Subgraphs of Kr\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$K_r$$\end{document}-Free Graphs and the Erdős–Rogers Problem
Lior Gishboliner
Oliver Janzer
Benny Sudakov
Combinatorica, 2025, 45 (2)
[50] k-partial permutations and the center of the wreath product Sk≀Sn\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathcal {S}}_k\wr {\mathcal {S}}_n$$\end{document} algebra
Omar Tout
Journal of Algebraic Combinatorics, 2021, 53 (2) : 389 - 412

← 1 2 3 4 5 →