arXiv math/05033002005-03-15math.CO

Parity Reversing Involutions on Plane Trees and 2-Motzkin Paths

William Y. C. Chen, Louis W. Shapiro, Laura L. M. Yang

备注：: 8 pages, 4 figures

英文摘要：

The problem of counting plane trees with $n$ edges and an even or an odd number of leaves was studied by Eu, Liu and Yeh, in connection with an identity on coloring nets due to Stanley. This identity was also obtained by Bonin, Shapiro and Simion in their study of Schröder paths, and it was recently derived by Coker using the Lagrange inversion formula. An equivalent problem for partitions was independently studied by Klazar. We present three parity reversing involutions, one for unlabelled plane trees, the other for labelled plane trees and one for 2-Motzkin paths which are in one-to-one correspondence with Dyck paths.

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

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

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

继续探索

相关论文

Restricted involutions and Motzkin paths

We show how a bijection due to Biane between involutions and labelled Motzkin paths yields bijections between Motzkin paths and two families of restricted involutions that are counted by Motzkin numbers, namely, involutions avoiding 4321 and 3412. As a consequence, we derive characterizations of Motzkin paths corresponding to involutions avoiding either 4321 or 3412 together with any pattern of length 3. Furthermore, we exploit the described bijection to study some notable subsets of the set of restricted involutions, namely, fixed point free and centrosymmetric restricted involutions.

2008-12-17math.CO

Involutions under Bruhat order and labeled Motzkin Paths

In this note, we introduce a statistic on Motzkin paths that describes the rank generating function of Bruhat order for involutions. Our proof relies on a bijection introduced by Philippe Biane from permutations to certain labeled Motzkin paths and a recently introduced interpretation of this rank generating function in terms of visible inversions. By restricting our identity to fixed-point-free (FPF) involutions, we recover an identity due to Louis Billera, Lionel Levine and Karola Mészáros with a previous bijective proof by Matthew Watson. Our work sheds new light on the Ethiopian dinner gam…

2021-06-10math.CO

Crossings and nestings over some Motzkin objects and $q$-Motzkin numbers

We examine the enumeration of certain Motzkin objects according to the numbers of crossings and nestings. With respect to continued fractions, we compute and express the distributions of the statistics of the numbers of crossings and nestings over three sets, namely the set of $4321$-avoiding involutions, the set of $3412$-avoiding involutions, and the set of $(321,3\bar{1}42)$-avoiding permutations. To get our results, we exploit the bijection of Biane restricted to the sets of $4321$- and $3412$-avoiding involutions which was characterized by Barnabei et al.~ and the bijection between $(321,…

2021-07-17math.CO

一个关于Schur函数反置的符号反转自映射

A sign-reversing involution for the antipode of Schur functions

Sungkyunkwan University（成均馆大学）；Korea Institute for Advanced Study（韩国高等研究院）

本文通过构造符号反转自映射，解决Benedetti和Sagan的问题，以Schur基形式得到对称函数环的反置。

2026-03-04math.CO

A sign-reversing involution to count labeled lone-child-avoiding trees

We use a sign-reversing involution to show that trees on the vertex set [n], considered to be rooted at 1, in which no vertex has exactly one child are counted by 1/n sum_{k=1}^{n} (-1)^(n-k) {n}-choose-{k} (n-1)!/(k-1)! k^(k-1). This result corrects a persistent misprint in the Encyclopedia of Integer Sequences.

2014-06-30math.CO

A sign-reversing involution for an extension of Torelli's Pfaffian identity

We evaluate the hyperpfaffian of a skew-symmetric $k$-ary polynomial $f$ of degree $k/2 \cdot (n-1)$. The result is a product of the Vandermonde product and a certain expression involving the coefficients of the polynomial $f$. The proof utilizes a sign reversing involution on a set of weighted, oriented partitions. When restricting to the classical case when $k=2$ and the polynomial is $(x_{j} - x_{i})^{n-1}$, we obtain an identity due to Torelli.

2014-08-27math.CO

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

晶体与符号反转对合：集值斜杨表和五顶点模型的装饰态

Crystal operators and a sign-reversing involution on semistandard set-valued tableaux of skew shape

National Institute of Technology, Akashi College（明石国立技术大学学院）

本文构造了集值斜杨表、标记Gelfand-Tsetlin模式与五顶点模型装饰态之间的双射，保持权重并交织晶体算子，证明了纤维的布尔格结构及符号反转对合的性质。

2026-09-29math.CO

A sign-reversing involution for rooted special rim-hook tableaux

Egecioglu and Remmel gave an interpretation for the entries of the inverse Kostka matrix K^{-1} in terms of special rim-hook tableaux. They were able to use this interpretation to give a combinatorial proof that KK^{-1}=I but were unable to do the same for the equation K^{-1}K=I. We define a sign-reversing involution on rooted special rim-hook tableaux which can be used to prove that the last column of this second product is correct. In addition, following a suggestion of Chow we combine our involution with a result of Gasharov to give a combinatorial proof of a special case of the (3+1)-free …

2003-06-06math.CO

Matroid-minor Hopf algebra: a cancellation-free antipode formula and other applications of sign-reversing involutions

In this paper, we give a cancellation-free antipode formula for the matroid-minor Hopf algebra. We then explore applications of this formula. For example, the cancellation-free formula expresses the antipode of uniform matroids as a sum over certain ordered set partitions. We also prove that all matroids over any hyperfield (in the sense of Baker and Bowler) have cancellation-free antipode formulas; furthermore, the cancellations in the antipode are independent of the hyperfield structure and only depend on the underlying matroid.

2018-11-05math.CO

模曲线模空间中的符号反转自映射

Sign-reversing involutions in moduli spaces of curves

Northeastern University（东北大学）；Colorado State University（科罗拉多州立大学）；Université de Montréal（蒙特利尔大学）

本文利用符号反转自映射解决模曲线模空间几何中的两个计算问题，给出 genus 零多色空间上 ψ 类交积的组合公式，并研究图形模空间的热带欧拉特征。

2026-04-19math.AGmath.CO

Folding Phenomenon of Major-balance Identities on Restricted Involutions

In this paper we prove a refined major-balance identity on the $321$-avoiding involutions of length $n$, respecting the leading element of permutations. The proof is based on a sign-reversing involution on the lattice paths within a $\lfloor\frac{n}{2}\rfloor\times\lceil\frac{n}{2}\rceil$ rectangle. Moreover, we prove affirmatively a question about refined major-balance identity on the $123$-avoiding involutions, respecting the number of descents.

2017-11-13math.CO

一个Eğecioğlu--Remmel逆Kostka矩阵问题的新证明：通过涉及Sym和NSym的Garsia--Milne反演

A new proof of an Eğecioğlu--Remmel inverse Kostka matrix problem via a Garsia--Milne involution involving Sym and NSym

本文通过引入隧道钩覆盖和反向双射，给出了Eğecioğlu--Remmel逆Kostka矩阵问题的全新证明，不同于Loehr和Mendes的结果。

2025-11-22math.CO

Noncrossing Trees and Noncrossing Graphs

We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of Panholzer and Prodinger for noncrossing trees and find a correspondence between a class of noncrossing trees, called proper oncrossing trees, and the set of symmetric ternary trees. The second result of this paper is a parity reversing involution on connected noncrossing graphs which leads to a relation between the number of noncrossing trees with a given numbe…

2005-09-30math.CO

广义曲棍球棒定理

Generalized Hockey Stick Theorem

本文通过符号反转对合给出新恒等式的组合证明，该恒等式统一推广了曲棍球棒恒等式及大曲棍球棒与冰球恒等式。

2025-06-19math.CO

理查森表与莫茨金路径

Richardson tableaux and Motzkin paths

National Taiwan Normal University（台湾师范大学）；National Pingtung University（屏东大学）；National Cheng Kung University（国立成功大学）

本文从莫茨金路径视角研究理查森表，引入独立于RS算法的形状算法，构造局部双射并重新证明q计数公式，还证明了郭关于特定理查森表生成函数的猜想。

2026-09-11math.AGmath.CO

Simple Asymmetric Exclusion Model and Lattice Paths: Bijections and Involutions

We study the combinatorics of the change of basis of three representations of the stationary state algebra of the two parameter simple asymmetric exclusion process. Each of the representations considered correspond to a different set of weighted lattice paths which, when summed over, give the stationary state probability distribution. We show that all three sets of paths are combinatorially related via sequences of bijections and sign reversing involutions.

2012-09-07math-phmath.COmath.MP

排列深度与超位数的双射计数及符号不平衡

Bijective Enumeration and Sign-Imbalance for Permutation Depth and Excedances

本研究提出Biane双射的简化变体，通过带权3色Motzkin路径构造排列对合，证明了深度与超位数的奇偶计数性质，并给出按二者细化的排列及错位排列符号不平衡结果。

2024-06-24math.CO

The Delta Conjecture at $q=1$

We use a weight-preserving, sign-reversing involution to find a combinatorial expansion of $Δ_{e_k} e_n$ at $q=1$ in terms of the elementary symmetric function basis. We then use a weight-preserving bijection to prove the Delta Conjecture at $q=1$. The method of proof provides a variety of structures which can compute the inner product of $Δ_{e_k} e_n|_{q=1}$ with any symmetric function.

2016-09-15math.CO

不相交路径与树的距离矩阵的行列式

Non-intersecting paths and the determinant of the distance matrix of a tree

本文通过符号反转对合与Lindström-Gessel-Viennot引理，首次给出了树的距离矩阵行列式的Graham-Pollak公式的组合证明，并为理解其现有推广与$q$-模拟提供了统一框架。

2025-05-30math.CO

具有反射对称性的交错符号矩阵与平面分拆：$n+3$ 对等价统计量与一个柯西型恒等式

Alternating sign matrices with reflective symmetry and plane partitions: $n+3$ pairs of equivalent statistics and a Cauchy-type identity

本文推广了垂直对称交错符号矩阵与带洞六边形环面平铺的等数性，引入 $n+3$ 个参数并证明多变量生成函数一致，还给出辛特征展开，为构造双射和柯西型恒等式提供关键步骤。

2025-10-08math.CO