AbstractFinding minimal fields of definition for representations is one of the most important unsolved problems of computational representation theory. While good methods exist for representations over finite fields, it is still an open question in the case of number fields. In this paper we give a practical method for finding minimal defining subfields for absolutely irreducible representations. We illustrate the new algorithm by determining a minimal field for each absolutely irreducible representation of Sz(8)
AbstractThe aim of this paper is to give new upper bounds for Euclidean minima of algebraic number f...
An infinite structure $M $ is minimal if every definable subset (using param-eters in $M$) is finite...
AbstractThe purpose of this article is to determine all subfields Q(β) of fixed degree of a given al...
AbstractFinding minimal fields of definition for representations is one of the most important unsolv...
AbstractFinding minimal fields of definition for representations of finite groups is one of the most...
AbstractFinding minimal fields of definition for representations of finite groups is one of the most...
The authors are grateful to Mathieu Florence, Roberto Pirisi and Julia Pevtsova for helpful comments...
AbstractWe apply class field theory to the computation of the minimal discriminants for certain solv...
We present an algorithm to compute a full set of irreducible representations of a supersolvable grou...
AbstractAn algorithm is presented to compute the minimal associated primes of an ideal in a polynomi...
AbstractLet F be a number field. Given a continuous representation ρ¯:GF→GL2(F¯ℓ) with insoluble ima...
We present a method for computing complete lists of number fields in cases where the Galois group, a...
We present a method for computing complete lists of number fields in cases where the Galois group, a...
We present a method for computing complete lists of number fields in cases where the Galois group, a...
AbstractLet G be a finite group. It is easy to compute the character of G corresponding to a given c...
AbstractThe aim of this paper is to give new upper bounds for Euclidean minima of algebraic number f...
An infinite structure $M $ is minimal if every definable subset (using param-eters in $M$) is finite...
AbstractThe purpose of this article is to determine all subfields Q(β) of fixed degree of a given al...
AbstractFinding minimal fields of definition for representations is one of the most important unsolv...
AbstractFinding minimal fields of definition for representations of finite groups is one of the most...
AbstractFinding minimal fields of definition for representations of finite groups is one of the most...
The authors are grateful to Mathieu Florence, Roberto Pirisi and Julia Pevtsova for helpful comments...
AbstractWe apply class field theory to the computation of the minimal discriminants for certain solv...
We present an algorithm to compute a full set of irreducible representations of a supersolvable grou...
AbstractAn algorithm is presented to compute the minimal associated primes of an ideal in a polynomi...
AbstractLet F be a number field. Given a continuous representation ρ¯:GF→GL2(F¯ℓ) with insoluble ima...
We present a method for computing complete lists of number fields in cases where the Galois group, a...
We present a method for computing complete lists of number fields in cases where the Galois group, a...
We present a method for computing complete lists of number fields in cases where the Galois group, a...
AbstractLet G be a finite group. It is easy to compute the character of G corresponding to a given c...
AbstractThe aim of this paper is to give new upper bounds for Euclidean minima of algebraic number f...
An infinite structure $M $ is minimal if every definable subset (using param-eters in $M$) is finite...
AbstractThe purpose of this article is to determine all subfields Q(β) of fixed degree of a given al...