{"title":"关于循环子因子平面代数及其他代数的Ore定理","authors":"S. Palcoux","doi":"10.2140/pjm.2018.292.203","DOIUrl":null,"url":null,"abstract":"Ore proved that a finite group is cyclic if and only if its subgroup lattice is distributive. Now, since every subgroup of a cyclic group is normal, we call a subfactor planar algebra cyclic if all its biprojections are normal and form a distributive lattice. The main result generalizes one side of Ore's theorem and shows that a cyclic subfactor is singly generated in the sense that there is a minimal 2-box projection generating the identity biprojection. We conjecture that this result holds without assuming the biprojections to be normal, and we show that it is true for small lattices. We finally exhibit a dual version of another theorem of Ore and a non-trivial upper bound for the minimal number of irreducible components for a faithful complex representation of a finite group.","PeriodicalId":351745,"journal":{"name":"arXiv: Operator Algebras","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Ore's theorem on cyclic subfactor planar algebras and beyond\",\"authors\":\"S. Palcoux\",\"doi\":\"10.2140/pjm.2018.292.203\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Ore proved that a finite group is cyclic if and only if its subgroup lattice is distributive. Now, since every subgroup of a cyclic group is normal, we call a subfactor planar algebra cyclic if all its biprojections are normal and form a distributive lattice. The main result generalizes one side of Ore's theorem and shows that a cyclic subfactor is singly generated in the sense that there is a minimal 2-box projection generating the identity biprojection. We conjecture that this result holds without assuming the biprojections to be normal, and we show that it is true for small lattices. We finally exhibit a dual version of another theorem of Ore and a non-trivial upper bound for the minimal number of irreducible components for a faithful complex representation of a finite group.\",\"PeriodicalId\":351745,\"journal\":{\"name\":\"arXiv: Operator Algebras\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-02-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv: Operator Algebras\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2140/pjm.2018.292.203\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv: Operator Algebras","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2140/pjm.2018.292.203","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Ore's theorem on cyclic subfactor planar algebras and beyond
Ore proved that a finite group is cyclic if and only if its subgroup lattice is distributive. Now, since every subgroup of a cyclic group is normal, we call a subfactor planar algebra cyclic if all its biprojections are normal and form a distributive lattice. The main result generalizes one side of Ore's theorem and shows that a cyclic subfactor is singly generated in the sense that there is a minimal 2-box projection generating the identity biprojection. We conjecture that this result holds without assuming the biprojections to be normal, and we show that it is true for small lattices. We finally exhibit a dual version of another theorem of Ore and a non-trivial upper bound for the minimal number of irreducible components for a faithful complex representation of a finite group.