Abstract
A groupoid is a set closed with respect to a binary operation. It is commutative and entropic if xy = yx and xy.zw = xz.yw hold for all its elements. It is cyclic if it is generated by one element. Let x be the generator of the free commutative entropic cyclic groupoid . Then any element of can be written in the form xP where x1 = x and xQ+R = xQxR. Two indices P, Q are equal (called “concordant” in (3)) if and only if xP = xQ. The groupoid of these indices, the free additive commutative entropic logarithmetic (cf. (3)), is clearly isomorphic to .
Publisher
Cambridge University Press (CUP)
Reference4 articles.
1. XV.—On Non-Associative Combinations
2. Enumeration of indices of given altitude and potency;Mine;Proc. Edin. Math. Soc.,1959
3. The free commutative entropic logarithmetic;Mine;Proc. Roy. Soc. Edin.,1959
4. Index polynomials and bifurcating root-trees;Mine;Proc. Roy. Soc. Edin.,1957
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献