无限维Grassmann代数的自同构算法

Creative Mathematics and Informatics Pub Date : 2021-09-30 DOI:10.37193/cmi.2021.02.01

Nazan Akdoğan

{"title":"无限维Grassmann代数的自同构算法","authors":"Nazan Akdoğan","doi":"10.37193/cmi.2021.02.01","DOIUrl":null,"url":null,"abstract":"\"Let G be the infinite dimensional Grassmann algebra. In this study, we determine a subgroup of the automorphism group Aut(G) of the algebra G which is of an importance in the description of the group Aut(G). We give an infinite generating set for this subgroup and suggest an algorithm which shows how to express each automorphism as compositions of generating elements.\"","PeriodicalId":112946,"journal":{"name":"Creative Mathematics and Informatics","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"\\\"An algorithm for automorphisms of infinite dimensional Grassmann algebras\\\"\",\"authors\":\"Nazan Akdoğan\",\"doi\":\"10.37193/cmi.2021.02.01\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\\\"Let G be the infinite dimensional Grassmann algebra. In this study, we determine a subgroup of the automorphism group Aut(G) of the algebra G which is of an importance in the description of the group Aut(G). We give an infinite generating set for this subgroup and suggest an algorithm which shows how to express each automorphism as compositions of generating elements.\\\"\",\"PeriodicalId\":112946,\"journal\":{\"name\":\"Creative Mathematics and Informatics\",\"volume\":\"43 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Creative Mathematics and Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.37193/cmi.2021.02.01\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Creative Mathematics and Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.37193/cmi.2021.02.01","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

设G是无限维的格拉斯曼代数。本文确定了代数G的自同构群Aut(G)的一个子群，这对描述Aut(G)群具有重要意义。我们给出了这个子群的无限生成集，并给出了一个算法，该算法将每个自同构表示为生成元素的组合。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

"An algorithm for automorphisms of infinite dimensional Grassmann algebras"

"Let G be the infinite dimensional Grassmann algebra. In this study, we determine a subgroup of the automorphism group Aut(G) of the algebra G which is of an importance in the description of the group Aut(G). We give an infinite generating set for this subgroup and suggest an algorithm which shows how to express each automorphism as compositions of generating elements."

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Creative Mathematics and Informatics

自引率

0.00%

发文量