Generalized Number Systems and Application to Hyperoctahedral Groups
classification
🧮 math.NT
keywords
groupscodeelementshyperoctahedralspecialanalogousapplicationbasis
read the original abstract
In this work, we generalize the integer enumeration basis. We also construct bijections between the elements of special sets and the elements of some groups, and treat the special case of the hyperoctohedral groups. Then, we find a code analogous to the Lehmer code for the hyperoctahedral groups.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.