scientific article; zbMATH DE number 795114
From MaRDI portal
Publication:4845263
zbMATH Open0832.60012MaRDI QIDQ4845263FDOQ4845263
Publication date: 13 February 1996
Title of this publication is not available (Why is that?)
Recommendations
derandomizationlimit theorypartial orderingirrational numbersmonotone subsequencepseudo-random permutationsunimodal subsequence
Cited In (36)
- Title not available (Why is that?)
- Erdős-Szekeres theorem for multidimensional arrays
- The symmetry in the martingale inequality
- Fast and longest rollercoasters
- Nonexistence of bigeodesics in planar exponential last passage percolation
- Enumeration formulæ for pattern restricted Stirling permutations
- A positive fraction Erdős-Szekeres theorem and its applications
- Discrete geometry. Abstracts from the workshop held January 21--26, 2024
- Exponential Erdős-Szekeres theorem for matrices
- The parallel stack loading problem to minimize blockages
- The matching, birthday and the strong birthday problem: a contemporary review
- Empirical scaling of the length of the longest increasing subsequences of random walks
- A strengthening of the Erdős-Szekeres theorem
- Monotone Subsequences in High-Dimensional Permutations
- Decomposing Random Permutations into Order-Isomorphic Subpermutations
- Ramsey theory, integer partitions and a new proof of the Erdős-Szekeres theorem
- A linear time approximation algorithm for permutation flow shop scheduling
- Ramsey numbers of cliques versus monotone paths
- Combinatorial generation via permutation languages. II. Lattice congruences
- The asymptotics of monotone subsequences of involutions
- On minimum \(k\)-modal partitions of permutations
- Fast computation of a longest increasing subsequence and application
- Representing point sets on the plane as permutations
- Erdős-Szekeres-type statements: Ramsey function and decidability in dimension 1
- Rollercoasters and Caterpillars
- Monotone subsets in lattices and the Schensted shape of a Sós permutation
- Erdős-Szekeres tableaux
- Rollercoasters: Long Sequences without Short Runs
- Online Ramsey numbers of ordered paths and cycles
- On increasing subsequences of minimal Erdős-Szekeres permutations
- Higher-order Erdős-Szekeres theorems
- Bounds on half graph orders in powers of sparse graphs
- Three-monotone interpolation
- Semi-algebraic Ramsey numbers
- On Erdős' theorem for monotonic subsequences
- Sequential selection of an increasing sequence from a multidimensional random sample.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4845263)
