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)
An infinite structure $M $ is minimal if every definable subset (using param-eters in $M$) is finite...
International audienceWe describe an algorithm which computes all subfields of an effectively given ...
AbstractWe present methods to construct representations of finitely presented groups. In well-condit...
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...
Redundant number systems (e.g., signed binary representations) have been utilized to efficiently imp...
We present an algorithm to compute a full set of irreducible representations of a supersolvable grou...
In this paper we describe how to use the algorithmic methods provided by Hunter and Pohst in order t...
Minimal discriminants of number fields are presently known for 22 signatures. For 20 of these we giv...
AbstractA new method of determining algebraic number fields with discriminants of small absolute val...
A representation field for a non-maximal order in a central simple algebra is a subfield of the spin...
Determining whether a number field admits a power integral basis is a classical problem in algebraic...
Determining whether a number field admits a power integral basis is a classical problem in algebraic...
The authors are grateful to Mathieu Florence, Roberto Pirisi and Julia Pevtsova for helpful comments...
An infinite structure $M $ is minimal if every definable subset (using param-eters in $M$) is finite...
International audienceWe describe an algorithm which computes all subfields of an effectively given ...
AbstractWe present methods to construct representations of finitely presented groups. In well-condit...
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...
Redundant number systems (e.g., signed binary representations) have been utilized to efficiently imp...
We present an algorithm to compute a full set of irreducible representations of a supersolvable grou...
In this paper we describe how to use the algorithmic methods provided by Hunter and Pohst in order t...
Minimal discriminants of number fields are presently known for 22 signatures. For 20 of these we giv...
AbstractA new method of determining algebraic number fields with discriminants of small absolute val...
A representation field for a non-maximal order in a central simple algebra is a subfield of the spin...
Determining whether a number field admits a power integral basis is a classical problem in algebraic...
Determining whether a number field admits a power integral basis is a classical problem in algebraic...
The authors are grateful to Mathieu Florence, Roberto Pirisi and Julia Pevtsova for helpful comments...
An infinite structure $M $ is minimal if every definable subset (using param-eters in $M$) is finite...
International audienceWe describe an algorithm which computes all subfields of an effectively given ...
AbstractWe present methods to construct representations of finitely presented groups. In well-condit...