Related papers: Computation of unirational fields (extended abstra…
We describe an algorithm for splitting permutation representations of finite group over fields of characteristic zero into irreducible components. The algorithm is based on the fact that the components of the invariant inner product in…
Standard noncommutative Gr\"obner basis procedures are used for computing ideals of free noncommutative polynomial rings over fields. This paper describes Gr\"obner basis procedures for one-sided ideals in finitely presented noncommutative…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
We introduce the universal unitarily graded A-algebra for a commutative ring A and an arbitrary abelian extension U of the group of units of A, and use this concept to give simplified proofs of the main theorems of co-Galois theory in the…
We show how tropical varieties of ideals I over a field K with non-trivial valuation can be traced back to tropical varieties of ideals in R[[t]][x] over some dense subring R in its ring of integers. Moreover, for homogeneous ideals, we…
We consider the problem of characterizing all number fields $K$ such that all algebraic integers $\alpha\in K$ can be written as the sum of distinct units of $K$. We extend a method due to Thuswaldner and Ziegler that previously did not…
In this paper we introduce a binomial ideal derived from a binary linear code. We present some applications of a Gr\"obner basis of this ideal with respect to a total degree ordering. In the first application we give a decoding method for…
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…
Border bases, a generalization of Groebner bases, have actively been researched during recent years due to their applicability to industrial problems. A. Kehrein and M. Kreuzer formulated the so called Border Basis Algorithm, an algorithm…
In this article we present two new algorithms to compute the Groebner basis of an ideal that is invariant under certain permutations of the ring variables and which are both implemented in SINGULAR (cf. [DGPS12]). The first and major…
Let $I_1\subset I_2\subset\dots$ be an increasing sequence of ideals of the ring $\Bbb Z[X]$, $X=(x_1,\dots,x_n)$ and let $I$ be their union. We propose an algorithm to compute the Gr\"obner base of $I$ under the assumption that the…
In this paper, the tropical differential Gr\"obner basis is studied, which is a natural generalization of the tropical Gr\"obner basis to the recently introduced tropical differential algebra. Like the differential Gr\"obner basis, the…
Solving a polynomial system, or computing an associated Gr\"obner basis, has been a fundamental task in computational algebra. However, it is also known for its notorious doubly exponential time complexity in the number of variables in the…
In this note, we extend modular techniques for computing Gr\"obner bases from the commutative setting to the vast class of noncommutative $G$-algebras. As in the commutative case, an effective verification test is only known to us in the…
In this paper we present two algorithms for the computation of a diagonal form of a matrix over non-commutative Euclidean domain over a field with the help of Gr\"obner bases. This can be viewed as the pre-processing for the computation of…
To integer programming problems, computational algebraic approaches using Grobner bases or standard pairs via the discreteness of toric ideals have been studied in recent years. Although these approaches have not given improved time…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
Let $U/L$ be a finite abelian extension of number fields. We first construct a universal primitive generator of $U$ over $L$ whose relative trace to any intermediate field $F$ becomes a generator of $F$ over $L$, too. We also develop a…
We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…
We give an elementary construction of an arbitrary differentially closed field and of a universal differential extension of a differential field in terms of Nash function fields. We also give a characterization of any Archimedean ordered…