c语言中case1 case3 n =1,(n 1)-Step Derivations on n-Groupoids: The Case n = 3
摘要:
We define a ranked trigroupoid as a natural followup on the idea of a ranked bigroupoid. We consider the idea of a derivation on such a trigroupoid as representing a two-step process on a pair of ranked bigroupoids where the mapping d is a self-derivation at each step. Following up on this idea we obtain several results and conclusions of interest. We also discuss the notion of a couplet (D, d) on X, consisting of a two-step derivation d and its square D = d d, for example, whose defining property leads to further observations on the underlying ranked trigroupoids also.
展開
總結
以上是生活随笔為你收集整理的c语言中case1 case3 n =1,(n 1)-Step Derivations on n-Groupoids: The Case n = 3的全部內容,希望文章能夠幫你解決所遇到的問題。
- 上一篇: java有没有number数据类型_Ja
- 下一篇: java周期_java 周期时期计算