Related papers: Gr\"obner bases of Burchnall-Chaundy ideals for or…
Commuting pairs of ordinary differential operators (ODOs) have been related to plane algebraic curves since the work of Burchnall and Chaundy a century ago. We introduce now the concept of Burchnall-Chaundy (BC) ideal of a commuting pair,…
The correspondence between commutative rings of ordinary differential operators and algebraic curves has been extensively and deeply studied since the seminal works of Burchnall-Chaundy in 1923. This paper is an overview of recent…
Burchnall and Chaundy showed that if two ODOs $P$, $Q$ with analytic coefficients commute there exists a polynomial $f(\lambda ,\mu)$ with complex coefficients such that $f(P,Q)=0$, called the BC-polynomial. This polynomial can be computed…
The Burchnall-Chaundy theory concerns the classification of all pairs of commuting ordinary differential operators. We phrase this theory in the language of spectral data for integrable systems. In particular, we define spectral data for…
The Burchnall-Chaundy problem is classical in differential algebra, seeking to describe all commutative subalgebras of a ring of ordinary differential operators whose coefficients are functions in a given class. It received less attention…
We develop a theory of bicrystalline ideals, synthesizing Gr\"obner basis techniques and Kashiwara's crystal theory. This provides a unified algebraic, combinatorial, and computational approach that applies to ideals of interest, old and…
Blockwise determinantal ideals are those generated by the union of all the minors of specified sizes in certain blocks of a generic matrix, and they are the natural generalization of many existing determinantal ideals like the Schubert and…
Fractional differential (and difference) operators play a role in a number of diverse settings: integrable systems, mirror symmetry, Hurwitz numbers, the Bethe ansatz equations. We prove extensions of the three major results on algebras of…
The universal Gr\"obner basis of an ideal is a Gr\"obner basis with respect to all term orders simultaneously. The aim of this paper is to present an algorithmic approach to compute the universal Gr\"obner basis for the toric ideal…
In this paper we present an algorithm to compute a Standard Basis for a fractional ideal $\mathcal{I}$ of the local ring $\mathcal{O}$ of an $n$-space algebroid curve with several branches. This allows us to determine the semimodule of…
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…
We present an operator-coefficient version of Sato's infinite-dimensional Grassmann manifold, and tau-function. In this context, the Burchnall-Chaundy ring of commuting differential operators becomes a C*-algebra, to which we apply the…
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…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical…
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 consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…
We consider the problem of determining Gr\"obner bases of binomial ideals associated with linear error correcting codes. Computation of Gr\"obner bases of linear codes have become a topic of interest to many researchers in coding theory…
To compute difference Groebner bases of ideals generated by linear polynomials we adopt to difference polynomial rings the involutive algorithm based on Janet-like division. The algorithm has been implemented in Maple in the form of the…
In this paper, we present a first approach toward a Burchnall-Chaundy theory for the skew Ore polynomials of higher order generated by quadratic relations defined by Golovashkin and Maksimov \cite{GolovashkinMaksimov1998}.