相关论文: On the Chevalley-Bass number of a field

We present a new algorithm for constructing a Chevalley basis for any Chevalley Lie algebra over a finite field. This is a necessary component for some constructive recognition algorithms of exceptional quasisimple groups of Lie type. When…

We give upper and lower bounds on the number of points on abelian varieties over finite fields, and lower bounds specific to Jacobian varieties. We also determine exact formulas for the maximum and minimum number of points on Jacobian…

Let L be the Lie algebra of a simple algebraic group defined over a field F and let H be a split Cartan subalgebra of L. Then L has a Chevalley basis with respect to H. If the characteristic of F is not 2 or 3, it is known how to find it.…

Claude Chevalley provided a basis for a {finite dimensional} simple complex Lie algebra called the Chevalley basis. This basis has the distinguishing property that all the structure constants are integers. Chevalley groups, which are…

In this paper, a method for constructing a near optimal normal basis for algebraic extensions of a finite field is described. In each extension, except for the squares of basis elements, the product of two distinct normal basis elements can…

We give an efficient algorithm for Lang's Theorem in split connected reductive groups defined over finite fields of characteristic greater than 3. This algorithm can be used to construct many important structures in finite groups of Lie…

We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.

We compute lower bounds for Kazhdan constants of Chevalley groups over the integers, endowed with the standard Steinberg generators. For types other than $\mathtt{A}_{n}$, these are the first explicit asymptotically sharp such bounds. The…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…

We generalize the explicit quadratic Chabauty techniques for integral points on odd degree hyperelliptic curves and for rational points on genus 2 bielliptic curves to arbitrary number fields using restriction of scalars. This is achieved…

The defect of valued field extensions is a major obstacle in open problems in resolution of singularities and in the model theory of valued fields, whenever positive characteristic is involved. We continue the detailed study of defect…

It follows from the Grothendieck-Ogg-Shafarevich formula that the rank of an abelian variety (with trivial trace) defined over the function field of a curve is bounded by a quantity which depends on the genus of the base curve and on bad…

We obtain a uniform linear bound for the Chevalley function at a point in the source of an analytic mapping that is regular in the sense of Gabrielov. There is a version of Chevalley's lemma also along a fibre, or at a point of the image of…

We establish asymptotic formulae for the number of biquadratic number fields of bounded discriminant that can be embedded into a quaternionic or a dihedral extension. To prove these results, we express the solvability of these inverse…

The Shapley value has become a popular method to attribute the prediction of a machine-learning model on an input to its base features. The use of the Shapley value is justified by citing [16] showing that it is the \emph{unique} method…

We discuss various computational issues around the problem of determining the character values of finite Chevalley groups, in the framework provided by Lusztig's theory of character sheaves. Some of the remaining open questions (concerning…

We extend to the general codimension a lower bound for the essential minimum on abelian varieties found in a previous work, under a conjecture about ordinary primes in abelian varieties. This lower bound is the best expected, ``up to an…

Class field theory furnishes an intrinsic description of the abelian extensions of a number field that is in many cases not of an immediate algorithmic nature. We outline the algorithms available for the explicit computation of such…

In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Groebner…