arXiv math/04033162004-03math.COmath.AT

Inversion of integral series enumerating planar trees

Jean-Louis Loday

备注：: Minor modifications and reference to further work
发表信息：: Sém. Lothar. Combin. 53 (2004/05), Art. B53d, 16 pp.

英文摘要：

We consider an integral series f(X,t) which depends on the choice of a set X of labelled planar rooted trees. We prove that its inverse for composition is of the form f(Z,t) for another set Z of trees, deduced from X. The proof is self-contained, though inspired by the Koszul duality theory of quadratic operads.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Enumerating the Derangements of an $n$-Cube via Möbius Inversion

In $\mathcal L$, the semilattice of faces of an $n$-cube, we count the number of automorphisms of $\mathcal L$ that fix a given subalgebra -- either pointwise or as a subalgebra. By using Möbius inversion we get a formula for the number of derangements on the $n$-cube in terms of the Möbius function on the lattice of MR-subalgebras. We compute this Möbius function.

2009-02-06math.CO

枚举具有少量逆序的1324-避免者

Enumerating 1324-avoiders with few inversions

本文基于新的几乎可分解性概念，枚举了具有少量逆序的1324-避免排列，验证了相关猜想的一半，并指出完全证明可将指数增长率上界从13.5改进至约13.002。

2024-08-27math.CO

一种基于生成树的枚举模式避免反转序列的算法方法

An algorithmic approach based on generating trees for enumerating pattern-avoiding inversion sequences

提出基于生成树的算法以刻画模式避免反转序列的后继规则，结合核方法得到多个模式类的生成函数与枚举公式，并解决六个 Wilf 分类未决情形。

2023-09-27math.CO

平面填充地图的计数作为移动超树

Enumerating planar stuffed maps as hypertrees of mobiles

University of Waterloo（滑铁卢大学）

本文提出将双色平面填充地图与超移动体之间的双射，推广了平面地图与移动体的双射，并研究了生成函数的代数与函数方程。

2026-02-11math.CO

Applications of Graphical Condensation for Enumerating Matchings and Tilings

A technique called graphical condensation is used to prove various combinatorial identities among numbers of (perfect) matchings of planar bipartite graphs and tilings of regions. Graphical condensation involves superimposing matchings of a graph onto matchings of a smaller subgraph, and then re-partitioning the united matching (actually a multigraph) into matchings of two other subgraphs, in one of two possible ways. This technique can be used to enumerate perfect matchings of a wide variety of bipartite planar graphs. Applications include domino tilings of Aztec diamonds and rectangles, diab…

2003-09-11math.CO

Enumerating five families of pattern-avoiding inversion sequences; and introducing the powered Catalan numbers

The first problem addressed by this article is the enumeration of some families of pattern-avoiding inversion sequences. We solve some enumerative conjectures left open by the foundational work on the topics by Corteel et al., some of these being also solved independently by Lin, and Kim and Lin. The strength of our approach is its robustness: we enumerate four families $F_1 \subset F_2 \subset F_3 \subset F_4$ of pattern-avoiding inversion sequences ordered by inclusion using the same approach. More precisely, we provide a generating tree (with associated succession rule) for each family $F_i…

2018-12-14cs.DMmath.CO

更多相关论文收起更多论文

按逆序数计数的模式避免排列

Pattern Avoiding Permutations Enumerated by Inversions

该论文以逆序数为计数参数，研究长度不超过3的排列模式组合的避免计数，并聚焦于不可分解排列，扩展了Simion和Schmidt的经典方法。

2025-05-23math.CO

平面图的逆直径

Inversion Diameter of Planar Graphs

Tsinghua University（清华大学）；Beijing University of Posts and Telecommunications（北京邮电大学）

该研究针对平面图，证明了其逆直径的严格上界，将一般平面图的逆直径上界从12优化至8，还给出了围长至少为4、5、6的平面图对应的更紧上界7、5、4。

2026-08-20math.CO

A few words about maps

In this paper, we survey some properties, encoding, and bijections involving combinatorial maps, double occurrence words, and chord diagrams. We particularly study quasi-trees from a purely combinatorial point of view and derive a topological representation of maps with a given spanning quasi-tree using two fundamental polygons, which extends the representation of planar maps based on the equivalence with bipartite circle graphs. Then, we focus on Depth-First Search trees and their connection with a poset we define on the spanning quasi-trees of a map. We apply the bijections obtained in the f…

2022-11-15math.CO

通过可积系统计数 mobiles

Counting mobiles by integrable systems

Université Paris-Saclay（巴黎萨克雷大学）；CEA（法国原子能及替代能源委员会）；CNRS（法国国家科学研究中心）；Institut de physique théorique（理论物理研究所）；CRM Centre de Recherches Mathématiques de Montréal（蒙特利尔数学研究中心）

本文研究与平面欧拉地图对应的一般mobiles的计数问题，利用可积系统领域的递推方程得到其生成函数的显式行列式比值表达式，复现已知结果并证明相关猜想公式。

2023-12-13math-phmath.COmath.MP

平面超图的切分解

The slice decomposition of planar hypermaps

Université Paris Cité（巴黎西岱大学）；CNRS（法国国家科学研究中心）；IRIF（IRIF实验室）；Sorbonne Université（索邦大学）；IMJ-PRG（IMJ-PRG实验室）；Université Paris-Saclay（巴黎萨克雷大学）；CEA（法国原子能和替代能源委员会）；Institut de physique théorique（理论物理研究所）

本文通过扩展切分解方法，研究了超图的枚举问题，揭示了超图与双矩阵模型及Ising模型的关系，并提供了新的双射分解证明。

2025-09-08math-phmath.COmath.MP

Combinatorics of bicubic maps with hard particles

We present a purely combinatorial solution of the problem of enumerating planar bicubic maps with hard particles. This is done by use of a bijection with a particular class of blossom trees with particles, obtained by an appropriate cutting of the maps. Although these trees have no simple local characterization, we prove that their enumeration may be performed upon introducing a larger class of "admissible" trees with possibly doubly-occupied edges and summing them with appropriate signed weights. The proof relies on an extension of the cutting procedure allowing for the presence on the maps o…

2005-05-09cond-mat.stat-mechhep-thmath-ph