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:2306.16237

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2306.16237 (math)
[Submitted on 28 Jun 2023 (v1) , last revised 7 Feb 2024 (this version, v2)]

Title: Genus Permutations and Genus Partitions

Title: 基因排列与基因分割

Authors:Alexander Hock
Abstract: For a given permutation or set partition there is a natural way to assign a genus. Counting all permutations or partitions of a fixed genus according to cycle lengths or block sizes, respectively, is the main content of this article. After a variable transformation, the generating series are rational functions with poles located at the ramification points in the new variable. The generating series for any genus is given explicitly for permutations and up to genus 2 for set partitions. Extending the topological structure not just by the genus but also by adding more boundaries, we derive the generating series of non-crossing partitions on the cylinder from known results of non-crossing permutations on the cylinder. Most, but not all, outcomes of this article are special cases of already known results, however they are not represented in this way in the literature, which however seems to be the canonical way. To make the article as accessible as possible, we avoid going into details into the explicit connections to Topological Recursion and Free Probability Theory, where the original motivation came from.
Abstract: 对于给定的排列或集合划分,有一种自然的方式来分配一个亏格。 根据循环长度或块大小,分别统计固定亏格的排列或划分的数量是本文的主要内容。 经过变量变换后,生成级数是具有极点位于新变量中的分支点的有理函数。 对于排列,任何亏格的生成级数都明确给出,而对于集合划分,仅给出到亏格2的生成级数。 通过不仅扩展亏格的拓扑结构,还通过添加更多的边界,我们从圆柱面上已知的非交叉排列的结果中推导出圆柱面上非交叉划分的生成级数。 本文的大多数但不是全部结果都是已知结果的特例,然而这些结果在文献中并未以这种方式表示,尽管这似乎是标准的方式。 为了使文章尽可能易于理解,我们避免深入探讨与拓扑递归和自由概率论的显式联系,这些是原始动机的来源。
Comments: 27 pages, 4 figures, comments are appreciated, minor corrections in version 2
Subjects: Combinatorics (math.CO) ; Mathematical Physics (math-ph); Operator Algebras (math.OA); Probability (math.PR)
MSC classes: 05Axx, 14N10, 46L54, 60C05
Cite as: arXiv:2306.16237 [math.CO]
  (or arXiv:2306.16237v2 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2306.16237
arXiv-issued DOI via DataCite
Journal reference: Enumerative Combinatorics and Applications 5:1 (2025) Article S2R5
Related DOI: https://doi.org/10.54550/eca2025v5s1r5
DOI(s) linking to related resources

Submission history

From: Alexander Hock [view email]
[v1] Wed, 28 Jun 2023 14:01:01 UTC (40 KB)
[v2] Wed, 7 Feb 2024 11:30:13 UTC (40 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
license icon view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2023-06
Change to browse by:
math
math-ph
math.MP
math.OA
math.PR

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号