We consider permutations of 1,2,...,n^2 whose longest monotone subsequence is of length n and are therefore extremal for the Erdős-Szekeres Theorem. Such permutations correspond via the Robinson-Schensted correspondence to pairs of square n× n Young tableaux. We show that all the bumping sequences are constant and therefore these permutations have a simple description in terms of the pair of square tableaux. We deduce a limit shape result for the plot of values of the typical such permutation, which in particular implies that the first value taken by such a permutation is with high probability (1+o(1))n^2/2.
from HAL : Dernières publications http://ift.tt/1DQQOoU
Home » Informatique » [hal-01184378] Permutations with short monotone subsequences
vendredi 14 août 2015
[hal-01184378] Permutations with short monotone subsequences
lainnya dari HAL : Dernières publications, Informatique
- [hal-01133948] Modélisations de textures par champ gaussien à orientation locale prescrite
- [hal-01170063] A Day-ahead Centralized Unit Commitment Algorithm for A Multi-agent Smart Grid
- [hal-01202398] L’Internet des objets : un nouveau champ d’action pour la cybercriminalité
- [hal-01185255] About Interface Conditions for Coupling Hydrostatic and Nonhydrostatic Navier-Stokes Flows
- [hal-00982087] Towards optimized Schwarz methods for the Navier-Stokes equations
- [hal-01343348] D.1.3 – Protocols for emergent localities
- [hal-01316014] A Methodology for Quality Assessment in Collaborative Score Libraries
- [hal-01343121] Impact de la recherche d'amorces mutées sur les résultats d'analyses métagénomiques
- [hal-01313749] Temperature dependence of the particle/gas partition coefficient: An application to predict indoor gas-phase concentrations of semi-volatile organic compounds
- [hal-01308004] Impact of the French 3rd and 4th generation pill scare in women seeking termination of pregnancy
- [hal-01290932] An Extension of SPARQL with Fuzzy Navigational Capabilities for Querying Fuzzy RDF Data
- [hal-01343753] Frederic Lee and post-Keynesian pricing theory
- [hal-01108627] From complexity to algebra and back: digraph classes, collapsibility and the PGP
- [hal-01134194] Optimal Transport using Helmholtz-Hodge Decomposition and First-Order Primal-Dual Algorithms
Ditulis Oleh : Unknown // 13:09
Kategori:
Informatique
Inscription à :
Publier les commentaires (Atom)
0 commentaires:
Enregistrer un commentaire