Abstract
On the basis of an initial interest in symmetric cryptography, in the present work we study a chain of subgroups. Starting from a Sylow -subgroup of AGL(2,n), each term of the chain is defined as the normalizer of the previous one in the symmetric group on letters. Partial results and computational experiments lead us to conjecture that, for large values of , the index of a normalizer in the consecutive one does not depend on . Indeed, there is a strong evidence that the sequence of the logarithms of such indices is the one of the partial sums of the numbers of partitions into at least two distinct parts.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.