Abstract
A partition of a given set is said to be uniform if all the partition classes have the same cardinality. In this paper, we will introduce the concepts of rooted n-lattice path and rooted cyclic permutation and prove some fundamental theorems concerning the actions of rooted cyclic permutations on rooted lattice n-paths. The main results obtained have important applications in finding new uniform partitions. Many uniform partitions of combinatorial structures are special cases or consequences of our main theorems.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
