Related papers: Mathematical Theory Exploration in Theorema: Reduc…
We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…
In this paper we present an algorithm for computing Groebner bases of linear ideals in a difference polynomial ring over a ground difference field. The input difference polynomials generating the ideal are also assumed to be linear. The…
When improving results about generalized inverses, the aim often is to do this in the most general setting possible by eliminating superfluous assumptions and by simplifying some of the conditions in statements. In this paper, we use…
A general overview of the existing difference ring theory for symbolic summation is given. Special emphasis is put on the user interface: the translation and back translation of the corresponding representations within the term algebra and…
In this paper we discuss the basic problems of algorithmic algebraic number theory. The emphasis is on aspects that are of interest from a purely mathematical point of view, and practical issues are largely disregarded. We describe what has…
Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…
The present paper shall provide a framework for working with Gr\"obner bases over arbitrary rings $k$ with a prescribed finite standard set $\Delta$. We show that the functor associating to a $k$-algebra $B$ the set of all reduced Gr\"obner…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
Insa and Pauer presented a basic theory of Groebner basis for differential operators with coefficients in a commutative ring in 1998, and a criterion was proposed to determine if a set of differential operators is a Groebner basis. In this…
This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.
Signature-based algorithms have brought large improvements in the performances of Gr\"obner bases algorithms for polynomial systems over fields. Furthermore, they yield additional data which can be used, for example, to compute the module…
We describe a method for inverting Gentzen's cut-elimination in classical first-order logic. Our algorithm is based on first computign a compressed representation of the terms present in the cut-free proof and then cut-formulas that realize…
Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…
In this paper, we generalize the notion of border bases of zero-dimensional polynomial ideals to the module setting. To this end, we introduce order modules as a generalization of order ideals and module border bases of submodules with…
We construct a Gr\"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M\"oller algorithm. We present a situation…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
Proving statements about linear operators expressed in terms of identities often leads to finding elements of certain form in noncommutative polynomial ideals. We illustrate this by examples coming from actual operator statements and…
We encode the binomials belonging to the toric ideal $I_A$ associated with an integral $d \times n$ matrix $A$ using a short sum of rational functions as introduced by Barvinok \cite{bar,newbar}. Under the assumption that $d,n$ are fixed,…
One studies a particular algebraic system where the unknowns are matrices. We solve this system according to the parameters values thanks to the theory of Grobner basis.
We develop a rewriting theory suitable for diagrammatic algebras and lay down the foundations of a systematic study of their higher structures. In this paper, we focus on the question of finding bases. As an application, we give the first…