Related papers: Computation of unirational fields (extended abstra…
A polynomial time algorithm to give a complete description of all subfields of a given number field was given in an article by van Hoeij et al. This article reports on a massive speedup of this algorithm. This is primary achieved by our new…
We present here algorithms for efficient computation of linear algebra problems over finite fields.
In this article we show the rough outline of a computer algorithm to generate lower bounds on the exponential function of (in principle) arbitrary precision. We implemented this to generate all necessary analytic terms for the Boltzmann…
By combining well-known techniques from both noncommutative algebra and computational commutative algebra, we observe that an algorithmic approach can be applied to the study of irreducible representations of finitely presented algebras. In…
A Maple package for computing Groebner bases of linear difference ideals is described. The underlying algorithm is based on Janet and Janet-like monomial divisions associated with finite difference operators. The package can be used, for…
It has been discovered that linear codes may be described by binomial ideals. This makes it possible to study linear codes by commutative algebra and algebraic geometry methods. In this paper, we give a decoding algorithm for binary linear…
It has been shown previously that a large class of monomial maps equivariant under the action of an infinite symmetric group have finitely generated kernels up to the symmetric action. We prove that these symmetric toric ideals also have…
We give an algorithm that constructs a minimal set of polynomials defining all extension of a $(\pi)$-adic field with given, inertia degree, ramification index, discriminant, ramification polygon, and residual polynomials of the segments of…
We determine an explicit triangular integral basis for any separable cubic extension of a rational function field over a finite field in any characteristic. We obtain a formula for the discriminant of every such extension in terms of a…
We describe an efficient algorithm to calculate generators of power integral bases in composites of totally real fields with imaginary quadratic fields. We show that the calculation can be reduced to solving index form equations in the…
We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…
We describe an algorithm for determining the algebraic subgroup of GL(n,C) that is defined as the closure of the group generated by a finite number of elements of GL(n,C). The algorithm avoids the use of Groebner bases and can be used on…
Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…
Let k be an imaginary quadratic number field (with class number 1). We describe a new, essentially linear-time algorithm, to list all isomorphism classes of cubic extensions L/k up to a bound X on the norm of the relative discriminant…
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…
A novel method for computation of the discrete Fourier transform over a finite field with reduced multiplicative complexity is described. If the number of multiplications is to be minimized, then the novel method for the finite field of…
In the present work, we determine explicitly the genus of any separable cubic extension of any global function field given the minimal polynomial of the extension. We give algorithms computing the ramification data and the genus of any…
A universal Gr\"obner basis of an ideal is the union of all its reduced Gr\"obner bases. It is contained in the Graver basis, the set of all primitive elements. Obtaining an explicit description of either of these sets, or even a sharp…
We propose a novel encoding scheme for algebraic codes such as codes on algebraic curves, multidimensional cyclic codes, and hyperbolic cascaded Reed-Solomon codes and present numerical examples. We employ the recurrence from the Gr\"obner…
This is the first of two articles devoted to a exposition of the generating-function method for computing fusion rules in affine Lie algebras. The present paper is entirely devoted to the study of the tensor-product (infinite-level) limit…