arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2410.22232math.CO
收藏

广义停车函数的素性

Primeness of generalized parking functions

Sam Armon, Joanne Beckford, Dillon Hanson, Naomi Krawzik, Olya Mandelshtam, Lucy Martinez, Catherine Yan

AI总结:

本文将经典素停车函数的素性概念推广至向量停车函数、$(p,q)$-停车函数和二维向量停车函数三类广义停车函数,并推导了特定情形下的素函数计数显式公式。

摘要:

经典停车函数是排列的一种推广,出现在众多组合结构中。素停车函数是不可分解的组分,任意经典停车函数都可唯一表示为若干素停车函数的直和。本文将素性的概念拓展至经典停车函数的三类推广形式:向量停车函数、$(p,q)$-停车函数以及二维向量停车函数。我们通过推导显式公式研究其计数问题,涵盖向量为等差数列时的素向量停车函数数目、素$(p,q)$-停车函数数目,以及权重矩阵为坐标仿射变换时的素二维向量停车函数数目。

英文摘要:

Classical parking functions are a generalization of permutations that appear in many combinatorial structures. Prime parking functions are indecomposable components such that any classical parking function can be uniquely described as a direct sum of prime ones. In this article, we extend the notion of primeness to three generalizations of classical parking functions: vector parking functions, $(p,q)$-parking functions, and two-dimensional vector parking functions. We study their enumeration by obtaining explicit formulas for the number of prime vector parking functions when the vector is an arithmetic progression, prime $(p,q)$-parking functions, and prime two-dimensional vector parking functions when the weight matrix is an affine transformation of the coordinates.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑