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

双射:类停车结构和类树结构

Bijection: Parking-like structures and Tree-like structures

Jean-Baptiste Priez

摘要:

我们回顾Konheim & Weiss在1966年引入的占用问题,我们认为停车场函数是散列映射。每个汽车$c_i$优选停车位$p_i$(散列映射$c_i \mapsto p_i$,其中$c_i$是关键字,$p_i$是数组的索引),如果$p_i$被占用,则$c_i$是下一个可用停车位(散列表实现使用开放寻址策略)。本文考虑了其他一些哈希表实现,如带有链表的哈希表(带有停车函数作为哈希映射)。利用物种理论,我们通过拉格朗日反演枚举的哈希表结构通过双射与树状结构。这个双射提供了停车函数和有根树(的森林)之间的Foata-Riordan双射的推广。最后我们证明了在一组基数为$n$的键上的链表的哈希表的个数为$n!C_n$,因此有$n$节点的标记二叉树的个数。

英文摘要:

We recall the occupancy problem introduced by Konheim & Weiss in 1966 and we consider parking functions as hash maps. Each car $c_i$ prefers parking space $p_i$ (the hash map $c_i \mapsto p_i$ with $c_i$ is a key and $p_i$ an index into an array), if $p_i$ is occupied then $c_i$ the next available parking space (the hash table implementation using an open addressing strategy). This paper considers some others hash table implementations like hash tables with linked lists (with parking functions as hash maps). Using the Species Theory, we enumerate by Lagrange inversion those hash tables structures via a bijection with tree-like structures. This bijection provides a generalization of the Foata-Riordan bijection between parking functions and (forests of) rooted trees. Finally we show the number of hash tables with linked lists on a set of keys of cardinality $n$ is $n!C_n$, so the number of labeled binary trees with $n$ nodes.

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

↑