SearcharxivSearch

arXiv · 1812.05311

Sequences over finite fields defined by OGS and BN-pair decompositions of PSL2(q) recursively

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 showed that PSL_{2}(q) and PSL_{3}(q) can be expressed as a product of cyclic groups. In this paper, we consider an OGS decomposition of PSL_{2}(q) from a point of view different than that of Holt and Rowley. We look at its connection to the BN-pair decomposition of the group. This connection leads to sequences over F_{q}, which can be defined recursively, with very interesting properties, and which are closely connected to the Dickson and to the Chebyshev polynomials. Since every finite simple group of Lie-type has $BN-pair$ decomposition, the ideas of the paper might be generalized to further simple groups of Lie-type.

Explore related subjects

Keep this discovery

BibTeXRIS

Robert Shwartz, Hadas Yadayi. 2018-12-13. Sequences over finite fields defined by OGS and BN-pair decompositions of PSL2(q) recursively. https://arxiv.org/abs/1812.05311

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR