2000 character limit reached
The identities of additive binary arithmetics
Published 27 Feb 2011 in cs.DM, math.GR, and math.RA | (1102.5555v3)
Abstract: Operations of arbitrary arity expressible via addition modulo 2n and bitwise addition modulo 2 admit a simple description. The identities connecting these two additions have finite basis. Moreover, the universal algebra with these two operations is rationally equivalent to a nilpotent ring and, therefore, generates a Specht variety.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
