Counting near-perfect matchings on \(C_m \times C_n\) tori of odd order in the Maple system

DOI10.1134/S0361768819020075zbMath1459.05127OpenAlexW2947435302MaRDI QIDQ2216912

S. N. Perepechko

Publication date: 18 December 2020

Published in: Programming and Computer Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0361768819020075

zbMATH Keywords

generating functionsperfect matchings

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Exact enumeration problems, generating functions (05A15) Enumeration in graph theory (05C30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Uses Software

• Maple
• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of systems of linear equations by the \(p\)-adic method
• Symbolic computation with sequences
• The Complexity of Enumeration and Reliability Problems
• Some Remarks on the Cayley-Hamilton Theorem
• A mechanical counting method and combinatorial applications

This page was built for publication: Counting near-perfect matchings on \(C_m \times C_n\) tori of odd order in the Maple system