Related papers: On Computing Groebner Basis in the Rings of Differ…
We present a survey on the developments related to Groebner bases, and show explicit examples in CoCoA. The CoCoA project dates back to 1987: its aim was to create a "mathematician"-friendly computational laboratory for studying Commutative…
Formal verification techniques based on computer algebra have proven highly effective for circuit verification. The circuit, given as an and-inverter graph, is encoded as a set of polynomials that automatically generates a Gr\"obner basis…
We introduce new concepts in order to develop a general formalism for twisted differential operators in several variables. We investigate the notion of twisted coordinates on Huber rings that allows us to build various rings of twisted…
Starting out from a new description of a class of parameter-dependent pseudodifferential operators with finite regularity number due to G. Grubb, we introduce a calculus of parameter-dependent, poly-homogeneous symbols whose homogeneous…
This dissertation concerns the pseudo-differential operators of type 1,1. These have been known especially since around 1980, when it was shown that they play an important role in the treatment of fully non-linear partial differential…
We determine a Groebner basis for the secant ideal of the toric ideal associated to the second hypersimplex, with respect to any circular term order. The Groebner basis of the secant ideal requires polynomials of odd degree up to n. This…
A generalized criterion for signature related algorithms to compute Gr\"obner basis is proposed in this paper. Signature related algorithms are a popular kind of algorithms for computing Gr\"obner basis, including the famous F5 algorithm,…
The Gr\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if "yes" find- a term order such that the set of polynomials is a Gr\"obner basis. This problem was shown to be NP-hard…
This paper presents an algebraic approach to characterizing higher-order differential operators. While the foundational Leibniz rule addresses first-order derivatives, its extension to higher orders typically involves identities relating…
A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…
In this paper, we establish a condition on the coefficients of differential operators generated in the space of square-integrable functions on the entire real line by an ordinary differential expression with periodic, complex-valued…
In this paper we present a Java implementation of the algorithm that computes Buchbereger's and reduced Groebner's basis step by step. The Java application enables graphical representation of the intersection of two surfaces in…
We introduce a detection algorithm for SAGBI basis in polynomial rings, analogous to a Gr\"obner basis detection algorithm previously proposed by Gritzmann and Sturmfels. We also present two accompanying software packages named…
We generalize signature Gr\"obner bases, previously studied in the free algebra over a field or polynomial rings over a ring, to ideals in the mixed algebra $R[x_1,...,x_k]\langle y_1,\dots,y_n \rangle$ where $R$ is a principal ideal…
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.…
Two known computation methods and one new computation method for matrix determinant over an integral domain are discussed. For each of the methods we evaluate the computation times for different rings and show that the new method is the…
The Chevalley-Eilenberg differential calculus and differential operators over N-graded commutative rings are constructed. This is a straightforward generalization of the differential calculus over commutative rings, and it is the most…
We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential…
In this paper we will define analogs of Gr\"obner bases for $R$-subalgebras and their ideals in a polynomial ring $R[x_1,\ldots,x_n]$ where $R$ is a noetherian integral domain with multiplicative identity and in which we can determine ideal…
A general classification of linear differential and finite-difference operators possessing a finite-dimensional invariant subspace with a polynomial basis (the generalized Bochner problem) is given. The main result is that any operator with…