Related papers: Rota's Classification Problem, rewriting systems a…
In this paper, we push forward the idea of machine learning systems whose operators can be modified and fine-tuned for each problem. This allows us to propose a learning paradigm where users can write (or adapt) their operators, according…
We introduce a class of linear bounded invertible operators on Banach spaces, called shift operators, which comprises weighted backward shifts and models finite products of weighted backward shifts and dissipative composition operators. We…
This note deals with a problem of the probabilistic Ramsey theory in functional analysis. Given a linear operator $T$ on a Hilbert space with an orthogonal basis, we define the isomorphic structure $\Sigma(T)$ as the family of all subsets…
For the solution of full-rank ill-posed linear systems a new approach based on the Arnoldi algorithm is presented. Working with regularized systems, the method theoretically reconstructs the true solution by means of the computation of a…
In this paper, we construct free Lie Rota-Baxter superalgebra by using Gr\"{o}bner-Shirshov bases theory. We firstly construct free operated Lie superalgebras by the operated super-Lyndon-Shirshov monomials. Secondly, we establish…
We present an implementation of the algorithm for computing Groebner bases for operads due to the first author and A. Khoroshkin. We discuss the actual algorithms, the choices made for the implementation platform and the data…
The boundary-value problem on semi-axis for one class operator-differential equations of the fourth order, the main part of which has the multiple characteristic is investigated in this paper in Sobolev type weighted space. Correctness and…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
The reduction operators, i.e., the operators of nonclassical (conditional) symmetry, of (1+1)-dimensional second order linear parabolic partial differential equations and all the possible reductions of these equations to ordinary…
We establish Gr\"{o}bner-Shirshov bases theory for Gelfand-Dorfman-Novikov algebras over a field of characteristic $0$. As applications, a PBW type theorem in Shirshov form is given and we provide an algorithm for solving the word problem…
This paper focuses on scattered data fitting problems on spheres. We study the approximation performance of a class of weighted spectral filter algorithms, including Tikhonov regularization, Landaweber iteration, spectral cut-off, and…
This paper investigates algebraic objects equipped with an operator, such as operated monoids, operated algebras etc. Various free object functors in these operated contexts are explicitly constructed. For operated algebras whose operator…
Modern algorithms for binary classification rely on an intermediate regression problem for computational tractability. In this paper, we establish a geometric distinction between classification and regression that allows risk in these two…
A commutative Rota-Baxter algebra can be regarded as a commutative algebra that carries an abstraction of the integral operator. With the motivation of generalizing the study of algebraic geometry to Rota-Baxter algebra, we extend the…
In this paper, we concern the kernel of linear operator for a class of Grushin equation. First, we study the kernel space of linear operator for a general Grushin equation. Then, we provide an exact expression for the kernel space of linear…
In this work, we propose a high-order regularization method to solve the ill-conditioned problems in robot localization. Numerical solutions to robot localization problems are often unstable when the problems are ill-conditioned. A typical…
A central problem in proof-theory is that of finding criteria for identity of proofs, that is, for when two distinct formal derivations can be taken as denoting the same logical argument. In the literature one finds criteria which are…
In this note we show how to apply the Gr\"obner--Shirshov bases (GSB) method for modules over an associative algebra to the study of vertex algebras defined by generators and relations. We compute GSBs for a series of vertex algebras and…
Logically constrained term rewriting systems (LCTRSs) are a program analyzing formalism with native support for data types which are not (co)inductively defined. As a first-order formalism, LCTRSs have accommodated only analysis of…
In this paper we show how string rewriting methods can be applied to give a new method of computing double cosets. Previous methods for double cosets were enumerative and thus restricted to finite examples. Our rewriting methods do not…