arXiv subjects

Benjamin Klopsch

Publications and source records attributed to Benjamin Klopsch.

41 records · Page 3Linked to original sources

arXiv2009

How long does it take to generate a group?

The diameter of a finite group $G$ with respect to a generating set $A$ is the smallest non-negative integer $n$ such that every element of $G$ can be written as a product of at most $n$ elements of $A \cup A^{-1}$. We denote this invariant by $\diam_A(G)$. It can be interpreted as the diameter of the Cayley graph induced by $A$ on $G$ and arises, for instance, in the context of efficient communication networks. In this paper we study the diameters of a finite abelian group $G$ with respect to its various generating sets $A$. We determine the maximum possible value of $\diam_A(G)$ and classify all generating sets for which this maximum value is attained. Also, we determine the maximum possible cardinality of $A$ subject to the condition that $\diam_A(G)$ is "not too small". Connections with caps, sum-free sets, and quasi-perfect codes are discussed.

math.GR↗

arXiv2009

Automorphism groups of cyclic codes

In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated wreath products of several symmetric groups. Interestingly, some of the codes we consider also arise in the context of regular lattice graphs and permutation decoding.

math.CO↗

arXiv2008

Igusa-type functions associated to finite formed spaces and their functional equations

We study symmetries enjoyed by the polynomials enumerating non-degenerate flags in finite vector spaces, equipped with a non-degenerate alternating bilinear, hermitian or quadratic form. To this end we introduce Igusa-type rational functions encoding these polynomials and prove that they satisfy certain functional equations. Some of our results are achieved by expressing the polynomials in question in terms of what we call parabolic length functions on Coxeter groups of type $A$. While our treatment of the orthogonal case exploits combinatorial properties of integer compositions and their refinements, we formulate a precise conjecture how in this situation, too, the polynomials may be described in terms of parabolic length functions.

math.GR↗

arXiv2008

Analytic pro-p groups of small dimensions

According to Lazard, every p-adic Lie group contains an open pro-p subgroup which is saturable. This can be regarded as the starting point of p-adic Lie theory, as one can naturally associate to every saturable pro-p group G a Lie lattice L(G) over the p-adic integers. Essential features of saturable pro-p groups include that they are torsion-free and p-adic analytic. In the present paper we prove a converse result in small dimensions: every torsion-free p-adic analytic pro-p group of dimension less than p is saturable. This leads to useful consequences and interesting questions. For instance, we give an effective classification of 3-dimensional soluble torsion-free p-adic analytic pro-p groups for p > 3. Our approach via Lie theory is comparable with the use of Lazard's correspondence in the classification of finite p-groups of small order.

math.GR↗

arXiv2007

Zeta functions of 3-dimensional p-adic Lie algebras

We give an explicit formula for the subalgebra zeta function of a general 3-dimensional Lie algebra over the p-adic integers $\mathbb{Z}_p$. To this end, we associate to such a Lie algebra a ternary quadratic form over $\mathbb{Z}_p$. The formula for the zeta function is given in terms of Igusa's local zeta function associated to this form.

math.GR↗