Related papers: From analytical mechanical problems to rewriting t…
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…
In this paper, we study the averaging operator by assigning a rewriting system to it. We obtain some basic results on the kind of rewriting system we used. In particular, we obtain a sufficient and necessary condition for the confluence. We…
The goal of this paper is to present an algebraic approach to the basic results of the theory of linear recurrence relations. This approach is based on the ideas from the theory of representations of one endomorphisms (a special case of…
In this paper we consider an algorithmic technique more general than that proposed by Zharkov and Blinkov for the involutive analysis of polynomial ideals. It is based on a new concept of involutive monomial division which is defined for a…
In this expository style of writing I will give an introduction of Gr\"{o}bner bases and compute it for some algebras and then show how to use it to compute Hilbert series for algebras from chains.
In this paper we present an algorithm for construction of minimal involutive polynomial bases which are Groebner bases of the special form. The most general involutive algorithms are based on the concept of involutive monomial division…
In commutative algebra, the theory of Gr\"obner bases enables one to compute in any finitely generated algebra over a given computable field. For non-finitely generated algebras however, other methods have to be pursued. For instance, it…
Many possible definitions have been proposed for fractional derivatives and integrals, starting from the classical Riemann-Liouville formula and its generalisations and modifying it by replacing the power function kernel with other kernel…
A method of G. Wilson for generating commutative algebras of ordinary differential operators is extended to higher dimensions. Our construction, based on the theory of D-modules, leads to a new class of examples of commutative rings of…
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…
In this paper we apply the methods of rewriting systems and Gr\"obner-Shirshov bases to give a unified approach to a class of linear operators on associative algebras. These operators resemble the classic Rota-Baxter operator, and they are…
This is an introduction to linear algebra and group theory. We first review the linear algebra basics, namely the determinant, the diagonalization procedure and more, and with the determinant being constructed as it should, as a signed…
Multiobjective discrete programming is a well-known family of optimization problems with a large spectrum of applications. The linear case has been tackled by many authors during the last years. However, the polynomial case has not been…
The first part of these notes is devoted to an introduction to algebraic $D$-modules. Several basic notions are introduced. In the second part, $D$-modules with group action are treated. Several important examples in this situation are…
We study rewriting systems whose underlying set of terms is equipped with a vector space structure over a given field. We introduce parallel rewriting relations, which are rewriting relations compatible with the vector space structure, as…
Given graphs as input, Graph Neural Networks (GNNs) support the inference of nodes, edges, attributes, or graph properties. Graph Rewriting investigates the rule-based manipulation of graphs to model complex graph transformations. We…
During the last months or so we had the opportunity to read two papers trying to relate the study of Macaulay (1916) inverse systems with the so-called Riquier (1910)-Janet (1920) initial conditions for the integration of linear analytic…
We develop algebraic tools for statistical inference from samples of rotation matrices. This rests on the theory of D-modules in algebraic analysis. Noncommutative Gr\"obner bases are used to design numerical algorithms for maximum…
Motivated by better understanding the bideterminant (=product of minors) basis on the polynomial ring in $n \times m$ variables, we develop theory \& algorithms for Gr\"obner bases in not only algebras with straightening law (ASLs or Hodge…
We generalize the Gr\"obner basis method for free D-modules to the case of several term orderings induced by a partition of the set of basic variables. Using this generalized Gr\"obner basis technique we prove the existence and give a…