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

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

2007-05-18

arxiv.org/abs/0705.2689v1

Mathematics

Combinatorics

11 pages, submitted to the Electronic Journal of Combinatorics on February 2007

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Binary Search Tree insertion, the Hypoplactic insertion, and Dual Graded Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Binary Search Tree insertion, the Hypoplactic insertion, and Dual Graded Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Binary Search Tree insertion, the Hypoplactic insertion, and Dual Graded Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-439162