A Counter Example to the Shuffle Compatiblity Conjecture

Clicks: 76
ID: 283441
2018
Free PDF
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #579 of 803 articles by views in arXiv

Most read Least read

Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 803 in total.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Sign in to mint
Abstract
The shuffle product has a connection with several useful permutation statistics such as descent and peak, and corresponds to the multiplication operation in the corresponding descent and peak algebras. In their recent work, Gessel and Zhuang formalized the notion of shuffle-compatibility and studied various permutation statistics from this viewpoint. They further conjectured that any shuffle compatible permutation statistic is a descent statistic. In this note we construct a counter-example to this conjecture.
Reference Key
oğuz2018a Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors Ezgi Kantarcı Oğuz
Journal arXiv
Year 2018
DOI
DOI not found
URL
http://arxiv.org/abs/1807.01398v1
Keywords
math.co

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

Comments

No comments yet. Be the first to comment on this article.