English
Related papers

Related papers: Generators of maximal orders

200 papers

The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…

Group Theory · Mathematics 2014-06-09 Robert D. Gray

We give an algorithm to determine finitely many generators for a subgroup of finite index in the unit group of an integral group ring $\mathbb{Z} G$ of a finite nilpotent group $G$, this provided the rational group algebra $\mathbb{Q} G$…

We determine the minimal number of generators of the homological Goldman Lie algebra of a surface consisting of elements of the first homology group of the surface.

Geometric Topology · Mathematics 2012-07-20 Nariya Kawazumi , Yusuke Kuno , Kazuki Toda

We establish upper bounds for the smallest height of a generator of a number field $k$ over the rational field $\Q$. Our first bound applies to all number fields $k$ having at least one real embedding. We also give a second conditional…

Number Theory · Mathematics 2012-03-23 Jeffrey D. Vaaler , Martin Widmer

We explore the question concerning the number of distinct resonant algebras depending on the generator content, which consists of the Lorentz generator, translation, and new additional Lorentz-like and translation-like generators. Such…

High Energy Physics - Theory · Physics 2020-06-23 Remigiusz Durka , Kamil Grela

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

Algebraic Geometry · Mathematics 2015-05-27 Adam S. Sikora

A method to construct in explicit form the generators of the simple roots of an arbitrary finite-dimensional representation of a quantum or standard semisimple algebra is found. The method is based on general results from the global theory…

Mathematical Physics · Physics 2009-10-31 A. N. Leznov

We study Lie algebras generated by extremal elements (i.e., elements spanning inner ideals of L) over a field of characteristic distinct from 2. We prove that any Lie algebra generated by a finite number of extremal elements is finite…

Rings and Algebras · Mathematics 2007-05-23 Arjeh M. Cohen , Anja Steinbach , Rosane Ushirobira , David B. Wales

We study graded rings of modular forms over congruence subgroups, with coefficients in a subring $A$ of $\mathbb{C}$, and specifically the highest weight needed to generate these rings as $A$-algebras. In particular, we determine upper…

Number Theory · Mathematics 2016-03-07 Nadim Rustom

In this paper we bring together results about the density of subsemigroups of abelian Lie groups, the minimal number of topological generators of abelian Lie groups and a result about actions of algebraic groups. We find the minimal number…

Functional Analysis · Mathematics 2011-08-05 Herbert Abels , Antonios Manoussos

Suppose that G is a linearly reductive group. We study the minimal free resolution of the invariant ring. If G is a finite linearly reductive group, then the ring of invariants is generated in degree at most |G|, the group order. We prove…

Commutative Algebra · Mathematics 2007-05-23 Harm Derksen

This is a revised version of ANT-0045. If K is a number field of degree n with discriminant D, if K=Q(a) then H(a)>c(n)|D|^(1/(2n-2)) where H(a) is the height of the minimal polynomial of a. We ask if one can always find a generator a of K…

Number Theory · Mathematics 2008-02-03 Wolfgang M. Ruppert

The ring of invariant polynomials ${\mathbb C}[V]^G$ over a given finite dimensional representation space $V$ of a complex reductive group $G$ is known, by a famous theorem of Hilbert, to be finitely generated. The general proof being…

Representation Theory · Mathematics 2018-11-30 Valdemar V. Tsanov

To constitute atoms of a $\sigma$ algebra is not a easy task due to the large number of its elements. However, determining them via generators seems a feasible and simple way since most $\sigma$ algebras are generated by their smaller…

Probability · Mathematics 2008-12-11 Jinshan Zhang

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

Group Theory · Mathematics 2008-07-01 Willem de Graaf , Andrea Pavan

A minimal (by inclusion) generating set for the algebra of semi-invariants of a quiver of dimension (2,...,2) is established over an infinite field of arbitrary characteristic. The mentioned generating set consists of the determinants of…

Representation Theory · Mathematics 2011-07-13 A. A. Lopatin

We consider the operation of division in Pimenov algebras. We obtain necessary and sufficient conditions for prime elements in Pimenov algebras with a number of generators less than five. We adduce examples of the factorization of elements…

Rings and Algebras · Mathematics 2013-03-22 Dmitriy Efimov

Let $F=\mathbb{F}_q(T)$ be the field of rational functions with $\mathbb{F}_q$-coefficients, and $A=\mathbb{F}_q[T]$ be the subring of polynomials. Let $D$ be a division quaternion algebra over $F$ which is split at $1/T$. Given an…

Number Theory · Mathematics 2010-06-17 Mihran Papikian

Let $\mathcal O$ be a holomorphy ring in a global field $K$, and $R$ a classical maximal $\mathcal O$-order in a central simple algebra over $K$. We study sets of lengths of factorizations of cancellative elements of $R$ into atoms…

Rings and Algebras · Mathematics 2013-08-15 Daniel Smertnig

We describe a deterministic algorithm for finding a generating element of the multiplicative group of the finite field $\mathbb{F}_{p^n}$ where $p$ is a prime. In time polynomial in $p$ and $n$, the algorithm either outputs an element that…

Discrete Mathematics · Computer Science 2013-11-05 Ming-Deh Huang , Anand Kumar Narayanan