Decomposing replicable functions
John McKay, David Sevilla
TL;DR
This paper presents an algorithm for decomposing rational functions and analyzing the structure of groups that fix these functions, contributing to understanding their symmetries.
Contribution
It introduces a novel algorithm for decomposing rational functions and determining the poset of groups fixing them, advancing the study of function symmetries.
Findings
Algorithm successfully decomposes rational functions.
Poset of groups fixing functions is characterized.
Provides new insights into function symmetries.
Abstract
We describe an algorithm to decompose rational functions from which we determine the poset of groups fixing these functions.
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 · Computability, Logic, AI Algorithms · DNA and Biological Computing