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

Simple item page
dc.creatorNzeutchap, Janvier
dc.date2007-05-18
dc.date.accessioned2026-07-07T08:02:15Z
dc.date.available2026-07-07T08:02:15Z
dc.descriptionFomin (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.
dc.description11 pages, submitted to the Electronic Journal of Combinatorics on February 2007
dc.identifierhttps://arxiv.org/abs/0705.2689
dc.identifierhttp://arxiv.org/abs/0705.2689
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/129172
dc.subjectCombinatorics
dc.subject05-06 ; 05E99
dc.titleBinary Search Tree insertion, the Hypoplactic insertion, and Dual Graded Graphs
dc.typetext

Files

Collections

arXiv