Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2503.00181

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2503.00181 (math)
[Submitted on 28 Feb 2025 ]

Title: Rational parking functions and $(m, n)$-invariant sets

Title: 有理停车函数和$(m, n)$-不变集

Authors:Garrett Nelson
Abstract: An $(m, n)$-parking function can be characterized as function $f:[n] \to [m]$ such that the partition obtained by reordering the values of $f$ fits inside a right triangle with legs of length $m$ and $n$. Recent work by McCammond, Thomas, and Williams define an action of words in $[m]^n$ on $\mathbb{R}^n$. They show that rational parking functions are exactly the words that admit fixed points under that action. An $(m, n)$-invariant set is a set $\Delta \subset \mathbb{Z}$ such that $\Delta + m \subset \Delta$ and $\Delta + n \subset \Delta$. In this work we define an action of words in $[m]^n $ on $(m, n)$-invariant sets by removing the $j$th $m$-generator from $\Delta$. We show this action also characterizes $(m, n)$-parking functions. Further we show that each $(m, n)$-invariant set is fixed by a unique monotone parking function. By relating the actions on $\mathbb{R}^m$ and on $(m, n)$-invariant sets we prove that the set of all the points in $\mathbb{R}^m$ that can be fixed by a parking function is a union of points fixed by monotone parking functions. In the case when $\gcd(m, n) =1$ we characterize the set of periodic points of the action defined on $\mathbb{R}^m$ and show that the algorithm reversing the Pak-Stanley map proposed by Gorsky, Mazin, and Vazirani converges in a finite amount of steps.
Abstract: 一个$(m, n)$-停车函数可以被描述为函数$f:[n] \to [m]$,使得通过重新排列$f$的值所得到的分区适合于一条直角边长分别为$m$和$n$的直角三角形内。 McCammond、Thomas 和 Williams 的近期工作定义了$[m]^n$中单词在$\mathbb{R}^n$上的作用。他们表明,有理停车函数恰好是那些在这个作用下具有不动点的单词。 一个$(m, n)$-不变集是一个集合$\Delta \subset \mathbb{Z}$,使得$\Delta + m \subset \Delta$和$\Delta + n \subset \Delta$。 在这项工作中,我们通过从$\Delta$中去掉第$j$个$m$-生成元,定义了$[m]^n $上的单词在$(m, n)$-不变集上的作用。 我们证明这种作用同样刻画了$(m, n)$-parking 函数。 进一步地,我们证明每个$(m, n)$-不变集由唯一的单调 parking 函数固定。 通过关联作用于 $\mathbb{R}^m$ 和作用于 $(m, n)$-不变集上的操作,我们证明了 $\mathbb{R}^m$ 中能被停车函数固定的点的集合是单调停车函数固定的点的集合的并集。 当 $\gcd(m, n) =1$ 成立时,我们刻画了定义在 $\mathbb{R}^m$ 上的作用的周期点集合,并且证明了 Gorsky、Mazin 和 Vazirani 提出的反转 Pak-Stanley 映射的算法在有限步内收敛。
Comments: 21 pages, 7 figures
Subjects: Combinatorics (math.CO)
Cite as: arXiv:2503.00181 [math.CO]
  (or arXiv:2503.00181v1 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2503.00181
arXiv-issued DOI via DataCite

Submission history

From: Garrett Nelson [view email]
[v1] Fri, 28 Feb 2025 20:56:17 UTC (66 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2025-03
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号