Binary Search Tree insertion, the Hypoplactic insertion, and Dual Graded Graphs

arXiv0705.2689MaRDI QIDQ6205649

Publication date: 18 May 2007

Abstract: Fomin (1994) introduced a notion of duality between two graded graphs on the same set of vertices. He also introduced a generalization to dual graded graphs of the classical Robinson-Schensted-Knuth algorithm. We show how Fomin's approach applies to the binary search tree insertion algorithm also known as sylvester insertion, and to the hypoplactic insertion algorithm.

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Algebraic combinatorics (05E99)

This page was built for publication: Binary Search Tree insertion, the Hypoplactic insertion, and Dual Graded Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6205649)