Sequences over finite fields defined by OGS and BN-pair decompositions of PSL2(q) recursively
Robert Shwartz, Hadas Yadayi

TL;DR
This paper explores a novel recursive sequence-based decomposition of PSL2(q) linked to BN-pair structures, connecting group factorizations with polynomial sequences and potentially extending to other Lie-type simple groups.
Contribution
It introduces a new OGS decomposition approach for PSL2(q) based on BN-pair theory, connecting group factorizations with recursive polynomial sequences.
Findings
Sequences over F_q defined recursively with interesting properties
Connection between OGS decomposition and BN-pair structure
Potential generalization to other simple groups of Lie-type
Abstract
Factorization of groups into Zappa-Szep product, or more generally into k-fold Zappa-Szep product of its subgroups, is an interesting problem, since it eases the multiplication of two elements in a group, and has recently been applied for public-key cryptography as well. We give a generalization of the k-fold Zappa-Szep product of cyclic groups, which we call OGS decomposition. It is easy to see that existence of an OGS decomposition for all the composition factors of a non-abelian group G implies the existence of an OGS for G itself. Since the composition factors of a soluble group are cyclic groups, it obviously has an OGS decomposition. Therefore, the question of the existence of an OGS decomposition is interesting for non-soluble groups. The Jordan-Holder Theorem motivates us to consider an existence of an OGS decomposition for the finite simple groups. In 1993, Holt and Rowley…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · Finite Group Theory Research · graph theory and CDMA systems
