A Simple Transformation for Mahonian Statistics on Labelings of Rake Posets

A Simple Transformation for Mahonian Statistics on Labelings of Rake Posets We present a simple transformation for the inversion number and major index statistics on the labelings of a rooted tree with n vertices in the form of a rake with k teeth. The special case $$k=0$$ k = 0 provides a simple transformation for the Mahonian statistics on the set $$\mathfrak {S}_n$$ S n of permutations of $$\{1,2,\dots ,n\}$$ { 1 , 2 , ⋯ , n } . We also extend the transformation to a bijective interpretation of the fact that the major index of the equivalence classes of the labelings is equidistributed with the major index of the permutations in $$\mathfrak {S}_n$$ S n satisfying the condition that the elements $$1,2,\dots ,k$$ 1 , 2 , ⋯ , k appear in increasing order. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Graphs and Combinatorics Springer Journals

A Simple Transformation for Mahonian Statistics on Labelings of Rake Posets

Loading next page...
 
/lp/springer_journal/a-simple-transformation-for-mahonian-statistics-on-labelings-of-rake-V89B2v2pAD
Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer Japan KK, part of Springer Nature
Subject
Mathematics; Combinatorics; Engineering Design
ISSN
0911-0119
eISSN
1435-5914
D.O.I.
10.1007/s00373-018-1882-z
Publisher site
See Article on Publisher Site

Abstract

We present a simple transformation for the inversion number and major index statistics on the labelings of a rooted tree with n vertices in the form of a rake with k teeth. The special case $$k=0$$ k = 0 provides a simple transformation for the Mahonian statistics on the set $$\mathfrak {S}_n$$ S n of permutations of $$\{1,2,\dots ,n\}$$ { 1 , 2 , ⋯ , n } . We also extend the transformation to a bijective interpretation of the fact that the major index of the equivalence classes of the labelings is equidistributed with the major index of the permutations in $$\mathfrak {S}_n$$ S n satisfying the condition that the elements $$1,2,\dots ,k$$ 1 , 2 , ⋯ , k appear in increasing order.

Journal

Graphs and CombinatoricsSpringer Journals

Published: Feb 26, 2018

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off