Abstract
The process of replacing an arbitrary Boolean function by a bijective one, a fundamental tool in reversible computing and in cryptography, is interpreted algebraically as a particular instance of a certain group homomorphism from the [Formula: see text]-fold cartesian power of a group [Formula: see text] into the automorphism group of the free [Formula: see text]-set over the set [Formula: see text]. It is shown that this construction not only can be generalized from groups to monoids but, more generally, to internal categories in arbitrary finitely complete categories where it becomes a cartesian isomorphism between certain discrete fibrations.
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.
