An area-bounce exchanging bijection on a large subset of Dyck paths

It is a longstanding open problem to find a bijection exchanging area and bounce statistics on Dyck paths. We settle this problem for an exponentially large subset of Dyck paths via an explicit bijection. Moreover, we prove that this bijection is natural by showing that it maps what we call bounce-m...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ayyer, Arvind, Sundaravaradan, Naren
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator Ayyer, Arvind
Sundaravaradan, Naren
description It is a longstanding open problem to find a bijection exchanging area and bounce statistics on Dyck paths. We settle this problem for an exponentially large subset of Dyck paths via an explicit bijection. Moreover, we prove that this bijection is natural by showing that it maps what we call bounce-minimal paths to area-minimal paths. As a consequence of the proof ideas, we show combinatorially that a path with area $a$ and bounce $b$ exists if and only if a path with area $b$ and bounce $a$ exists. We finally show that the number of distinct values of the sum of the area and bounce statistics is the number of nonzero coefficients in Johnson's $q$-Bell polynomial.
doi_str_mv 10.48550/arxiv.2401.14668
format Article
fullrecord <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2401_14668</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2401_14668</sourcerecordid><originalsourceid>FETCH-LOGICAL-a678-69e056e3a08f7724dbb48588100bfa5323751dacfad3dddce68504a72452803c3</originalsourceid><addsrcrecordid>eNotj8tuwjAURL1hUdF-QFf1DyS140fMEoXSVkJiwz66tq-DC3WQExD8fVNaaaTZjI7mEPLMWSmNUuwV8jVeykoyXnKptXkgzTJRyAiF7c_JIcWr20PqYuqojV_oxtgnOgXoEXKHdDjbAUfaB7q6uQM9wbgfHskswHHAp_-ek936bdd8FJvt-2ez3BSga1PoBTKlUQAzoa4r6a2dThnDGbMBlKhErbgHF8AL771DbRSTMC1VZZhwYk5e_rB3i_aU4zfkW_tr095txA-GV0P6</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>An area-bounce exchanging bijection on a large subset of Dyck paths</title><source>arXiv.org</source><creator>Ayyer, Arvind ; Sundaravaradan, Naren</creator><creatorcontrib>Ayyer, Arvind ; Sundaravaradan, Naren</creatorcontrib><description>It is a longstanding open problem to find a bijection exchanging area and bounce statistics on Dyck paths. We settle this problem for an exponentially large subset of Dyck paths via an explicit bijection. Moreover, we prove that this bijection is natural by showing that it maps what we call bounce-minimal paths to area-minimal paths. As a consequence of the proof ideas, we show combinatorially that a path with area $a$ and bounce $b$ exists if and only if a path with area $b$ and bounce $a$ exists. We finally show that the number of distinct values of the sum of the area and bounce statistics is the number of nonzero coefficients in Johnson's $q$-Bell polynomial.</description><identifier>DOI: 10.48550/arxiv.2401.14668</identifier><language>eng</language><subject>Mathematics - Combinatorics</subject><creationdate>2024-01</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,778,883</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2401.14668$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2401.14668$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Ayyer, Arvind</creatorcontrib><creatorcontrib>Sundaravaradan, Naren</creatorcontrib><title>An area-bounce exchanging bijection on a large subset of Dyck paths</title><description>It is a longstanding open problem to find a bijection exchanging area and bounce statistics on Dyck paths. We settle this problem for an exponentially large subset of Dyck paths via an explicit bijection. Moreover, we prove that this bijection is natural by showing that it maps what we call bounce-minimal paths to area-minimal paths. As a consequence of the proof ideas, we show combinatorially that a path with area $a$ and bounce $b$ exists if and only if a path with area $b$ and bounce $a$ exists. We finally show that the number of distinct values of the sum of the area and bounce statistics is the number of nonzero coefficients in Johnson's $q$-Bell polynomial.</description><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotj8tuwjAURL1hUdF-QFf1DyS140fMEoXSVkJiwz66tq-DC3WQExD8fVNaaaTZjI7mEPLMWSmNUuwV8jVeykoyXnKptXkgzTJRyAiF7c_JIcWr20PqYuqojV_oxtgnOgXoEXKHdDjbAUfaB7q6uQM9wbgfHskswHHAp_-ek936bdd8FJvt-2ez3BSga1PoBTKlUQAzoa4r6a2dThnDGbMBlKhErbgHF8AL771DbRSTMC1VZZhwYk5e_rB3i_aU4zfkW_tr095txA-GV0P6</recordid><startdate>20240126</startdate><enddate>20240126</enddate><creator>Ayyer, Arvind</creator><creator>Sundaravaradan, Naren</creator><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20240126</creationdate><title>An area-bounce exchanging bijection on a large subset of Dyck paths</title><author>Ayyer, Arvind ; Sundaravaradan, Naren</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a678-69e056e3a08f7724dbb48588100bfa5323751dacfad3dddce68504a72452803c3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Ayyer, Arvind</creatorcontrib><creatorcontrib>Sundaravaradan, Naren</creatorcontrib><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ayyer, Arvind</au><au>Sundaravaradan, Naren</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An area-bounce exchanging bijection on a large subset of Dyck paths</atitle><date>2024-01-26</date><risdate>2024</risdate><abstract>It is a longstanding open problem to find a bijection exchanging area and bounce statistics on Dyck paths. We settle this problem for an exponentially large subset of Dyck paths via an explicit bijection. Moreover, we prove that this bijection is natural by showing that it maps what we call bounce-minimal paths to area-minimal paths. As a consequence of the proof ideas, we show combinatorially that a path with area $a$ and bounce $b$ exists if and only if a path with area $b$ and bounce $a$ exists. We finally show that the number of distinct values of the sum of the area and bounce statistics is the number of nonzero coefficients in Johnson's $q$-Bell polynomial.</abstract><doi>10.48550/arxiv.2401.14668</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier DOI: 10.48550/arxiv.2401.14668
ispartof
issn
language eng
recordid cdi_arxiv_primary_2401_14668
source arXiv.org
subjects Mathematics - Combinatorics
title An area-bounce exchanging bijection on a large subset of Dyck paths
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T01%3A13%3A47IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20area-bounce%20exchanging%20bijection%20on%20a%20large%20subset%20of%20Dyck%20paths&rft.au=Ayyer,%20Arvind&rft.date=2024-01-26&rft_id=info:doi/10.48550/arxiv.2401.14668&rft_dat=%3Carxiv_GOX%3E2401_14668%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true