• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Advances in Applied Mathematics >A context-free grammar for the Ramanujan-Shor polynomials
【24h】

A context-free grammar for the Ramanujan-Shor polynomials

机译：ramanujan-shor多项式的无背景语法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The polynomials psi(k) (r, x) were introduced by Ramanujan. Berndt, Evans and Wilson obtained a recurrence relation for psi(k) (r, x). Shor introduced polynomials related to improper edges of a rooted tree, leading to a refinement of Cayley's formula. Zeng realized that the polynomials of Ramanujan coincide with the polynomials of Shor, and that the recurrence relation of Shor coincides with the recurrence relation of Berndt, Evans and Wilson. These polynomials also arise in the work of Wang and Zhou on the orbifold Euler characteristics of the moduli spaces of stable curves. Dumont and Ramamonjisoa found a context-free grammar G to generate the number of rooted trees on n vertices with k improper edges. Based on the grammar G, we find a grammar H for the Ramanujan-Shor polynomials. This leads to a formal calculus for these polynomials. In particular, we obtain a grammatical derivation of the Berndt-Evans-Wilson-Shor recursion. We also provide a grammatical approach to the Abel identities and a grammatical explanation of the Lacasse identity. (C) 2019 Elsevier Inc. All rights reserved.
机译：None

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号