The Preisach graph and longest increasing subsequences

DOI10.4171/AIHPD/151MaRDI QIDQ2693181

M. Mert Terzi, Muhittin Mungan, Patrik Lino Ferrari

Publication date: 17 March 2023

Published in: Annales de l'Institut Henri Poincaré D. Combinatorics, Physics and their Interactions (AIHPD) (Search for Journal in Brave)

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

zbMATH Keywords

permutationslongest increasing subsequence

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Planar graphs; geometric and topological aspects of graph theory (05C10) Statistical mechanics of random media, disordered materials (including liquid crystals and spin glasses) (82D30) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Realization of arbitrary hysteresis by a low-dimensional gradient flow
• The longest increasing subsequence in a random permutation and a unitary random matrix model
• An extension of Schensted's theorem
• A variational problem for random Young tableaux
• Level-spacing distributions and the Airy kernel
• Hammersley's interacting particle process and longest increasing subsequences
• Hysteresis and phase transitions
• The structure of state transition graphs in systems with return point memory. I. General theory
• Permutations, matrices, and generalized Young tableaux
• Longest Increasing and Decreasing Subsequences
• On the distribution of the length of the longest increasing subsequence of random permutations
• Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem
• Commentary on “Longest increasing subsequences: from patience sorting to the Baik–Deift–Johansson theorem” by David Aldous and Persi Diaconis
• Discrete orthogonal polynomial ensembles and the Plancherel measure

This page was built for publication: The Preisach graph and longest increasing subsequences