Compositions constrained by graph Laplacian minors

Details Compositions constrained by graph Laplacian minors Compositions constrained by graph Laplacian minors

2012-02-09

arxiv.org/abs/1202.2013v1

Mathematics

Combinatorics

Scientific paper

Motivated by examples of symmetrically constrained compositions, super convex partitions, and super convex compositions, we initiate the study of partitions and compositions constrained by graph Laplacian minors. We provide a complete description of the multivariate generating functions for such compositions in the case of trees. We answer a question due to Corteel, Savage, and Wilf regarding super convex compositions, which we describe as compositions constrained by Laplacian minors for cycles; we extend this solution to the study of compositions constrained by Laplacian minors of leafed cycles. Connections are established and conjectured between compositions constrained by Laplacian minors of leafed cycles of prime length and algebraic/combinatorial properties of reflexive simplices.

Affiliated with

Also associated with

No associations

Rating

Compositions constrained by graph Laplacian minors 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 Compositions constrained by graph Laplacian minors, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compositions constrained by graph Laplacian minors will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-157402