On the smallest number of generators and the probability of generating an algebra

preprint2010arXivOpen access

Abstract

In this paper we study algebraic and asymptotic properties of generating sets of algebras over orders in number fields. Let AA be an associative algebra over an order RR in an algebraic number field. We assume that AA is a free RR-module of finite rank. We develop a technique to compute the smallest number of generators of AA. For example, we prove that the ring M3(Z)kM_3(\mathbb{Z})^{k} admits two generators if and only if k≤768k\leq 768. For a given positive integer mm, we define the density of the set of all ordered mm-tuples of elements of AA which generate it as an RR-algebra. We express this density as a certain infinite product over the maximal ideals of RR, and we interpret the resulting formula probabilistically. For example, we show that the probability that 2 random 3×33\times 3 matrices generate the ring M3(Z)M_3(\mathbb{Z}) is equal to (ζ(2)2ζ(3))−1(ζ(2)^2 ζ(3))^{-1}, where ζζ is the Riemann zeta-function.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.