首页> 外文期刊>Theoretical computer science >Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti
【24h】

Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti

机译:Good-Lagrange公式的树状形式的两个双射证明以及对有色生根树木和仙人掌的某些应用

获取原文
获取原文并翻译 | 示例
           

摘要

Goulden and Kulkarni (J. Combin. Theory Ser. A 80 (2) (1997) 295) give a bijective proof of an arborescent form of the Good-Lagrange multivariable inversion formula, This formula was first stated explicitly by Bender and Richmond (Electron. J. Combin. 5 (1) (1998) 4pp) but is implicit in Goulden and Kulkarni (1997). In this paper, we propose two new simple bijective proofs of this formula and we illustrate the interest of these proofs by applying them to the enumeration and random generation of colored rooted trees and rooted m-ary cacti. (C) 2003 Elsevier B.V. All rights reserved. [References: 35]
机译:Goulden and Kulkarni(J. Combin。Theory Ser。A 80(2)(1997)295)提供了Good-Lagrange多变量反演公式的树状形式的双射证明,该公式首先由Bender和Richmond(Electron J. Combin。5(1)(1998)4pp),但隐含在Goulden和Kulkarni(1997)中。在本文中,我们提出了该公式的两个新的简单双射证明,并通过将其应用于彩色有根树木和有核m-ary仙人掌的枚举和随机生成来说明这些证明的兴趣。 (C)2003 Elsevier B.V.保留所有权利。 [参考:35]

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号