Supersolvable LL-lattices of binary trees

Details Supersolvable LL-lattices of binary trees Supersolvable LL-lattices of binary trees

2003-04-09

arxiv.org/abs/math/0304132v1

Mathematics

Combinatorics

16 pages, 6 figures

Scientific paper

Some posets of binary leaf-labeled trees are shown to be supersolvable
lattices and explicit EL-labelings are given. Their characteristic polynomials
are computed, recovering their known factorization in a different way.

Affiliated with

Also associated with

No associations

Rating

Supersolvable LL-lattices of binary trees 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 Supersolvable LL-lattices of binary trees, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Supersolvable LL-lattices of binary trees will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-274276