Counting Near-Perfect Matchings on Cm × Cn Tori of Odd Order in the Maple System
- 作者: Perepechko S.1
-
隶属关系:
- Petrozavodsk State University
- 期: 卷 45, 编号 2 (2019)
- 页面: 65-72
- 栏目: Article
- URL: https://journals.rcsi.science/0361-7688/article/view/176764
- DOI: https://doi.org/10.1134/S0361768819020075
- ID: 176764
如何引用文章
详细
In the Maple computer algebra system, a set of recurrence relations and associated generating functions is derived for the number of near-perfect matchings on \({{C}_{m}} \times {{C}_{n}}\) tori of odd order at fixed values of the parameter m (\(3 \leqslant m \leqslant 11\)). The identity of the recurrence relations for the number of perfect and near-perfect matchings is revealed for the same value of m. An estimate for the number of near-perfect matchings is obtained at large odd m when \(n \to \infty \).
作者简介
S. Perepechko
Petrozavodsk State University
编辑信件的主要联系方式.
Email: persn@newmail.ru
俄罗斯联邦,
pr. Lenina 33, Petrozavodsk, Republic of Karelia, 185910