Matching forcing polynomials of constructable hexagonal systems
Shuang Zhao
TL;DR
This paper derives recurrence relations for forcing polynomials in specific types of constructable hexagonal systems, aiding in understanding their combinatorial properties.
Contribution
It introduces recurrence relations for forcing polynomials in monotonic and one-turn constructable hexagonal systems, advancing combinatorial analysis of these structures.
Findings
Derived recurrence relations for monotonic CHS
Established recurrence relations for CHS with one turning
Enhanced understanding of forcing polynomials in hexagonal systems
Abstract
In this paper, we derive recurrence relations of forcing polynomials for monotonic CHS and the other is CHS with one turning.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Matrix Theory and Algorithms · Advanced Topics in Algebra