Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process

DOI10.1007/978-3-319-19929-0_22zbMath1432.68326arXiv1502.02045OpenAlexW2964037573MaRDI QIDQ2942262

Cosmin Bonchiş, Gabriel I. Istrate

Publication date: 20 August 2015

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.02045

zbMATH Keywords

Hammersley processheapable sequencesheap tableaux

Mathematics Subject Classification ID

Searching and sorting (68P10) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Algorithms on strings (68W32)

Related Items (5)

From Hammersley's lines to Hammersley's trees ⋮ Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process ⋮ Almost-sure asymptotics for the number of heaps inside a random sequence ⋮ Fixed-Parameter Algorithms for Longest Heapable Subsequence and Maximum Binary Tree ⋮ Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A variational problem for random Young tableaux
• Sorting shuffled monotone sequences
• A rapidly mixing stochastic system of finite interacting particles on the circle
• Hydrodynamical methods for analyzing longest increasing subsequences
• Hammersley's process with sources and sinks
• Hammersley's interacting particle process and longest increasing subsequences
• Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process
• Longest Increasing and Decreasing Subsequences
• The Hiring Problem and Lake Wobegon Strategies
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Heapable Sequences and Subseqeuences
• The Hook Graphs of the Symmetric Group

This page was built for publication: Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process