Related papers: Rota's Classification Problem, rewriting systems a…
In this article we continue to explore the notion of Rota-Baxter algebras in the context of the Hopf algebraic approach to renormalization theory in perturbative quantum field theory. We show in very simple algebraic terms that the…
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…
We propose a functional description of rewriting systems where reduction rules are represented by linear maps called reduction operators. We show that reduction operators admit a lattice structure. Using this structure we define the notion…
We study a question which can be roughly stated as follows: Given a (unital or nonunital) algebra $A$ together with a Gr\"obner-Shirshov basis $G$, consider the free operated algebra $B$ over $A$, such that the operator satisfies some…
Koopman operator theory is shown to be directly related to the renormalization group. This observation allows us, with no assumption of translational invariance, to compute the critical exponents $\eta$ and $\delta$, as well as ratios of…
In this paper, we obtain respectively some new linear bases of free unitary (modified) weighted differential algebras and free nonunitary (modified) Rota-Baxter algebras, in terms of the method of Gr\"{o}bner-Shirshov bases.
This thesis concentrates on the development and application of rewriting and Groebner basis methods to a range of combinatorial problems. Chapter Two contains the most important result, which is the application of Knuth-Bendix procedures to…
We establish the Gr\"obner-Shirshov bases theory for differential Lie $\Omega$-algebras. As an application, we give a linear basis of a free differential Lie Rota-Baxter algebra on a set.
This paper introduces the structure of operated polygraphs as a categorical model for rewriting in operated algebras, generalizing Gr\"obner-Shirshov bases with non-monomial termination orders. We provide a combinatorial description of…
This paper deals with the notion of Gr\"obner $\delta$-base for some rings of linear differential operators by adapting the works of W. Trinks, A. Assi, M. Insa and F. Pauer. We compare this notion with the one of Gr\"obner base for such…
We begin by defining Temperley-Lieb algebra, in two different ways: as a presented algebra or as a diagrammatic algebra. Next, we look for a basis algorithmically, using rewriting theory. Finally, we introduce a generalization of the…
Families of operator identities appeared as a consequence of an existence of finite-dimensional representation of (super) Lie algebras of first-order differential operators and $q$-deformed (quantum) algebras of first-order…
In this paper, we establish the Composition-Diamond lemma for associative algebras with multiple linear operators. As applications, we obtain Groebner-Shirshov bases of free Rota-Baxter algebra, $\lambda$-differential algebra and…
In this paper, we propose to consider various models of pattern recognition. At the same time, it is proposed to consider models in the form of two operators: a recognizing operator and a decision rule. Algebraic operations are introduced…
Recently, inverse problems have attracted more and more attention in computational mathematics and become increasingly important in engineering applications. After the discretization, many of inverse problems are reduced to linear systems.…
This thesis is devoted to the study of a calculus that describes the application of conditional rewriting rules and the obtained results at the same level of representation. We introduce the rewriting calculus, also called the rho-calculus,…
We introduce the notion of syzygy for a set of reduction operators and relate it to the notion of syzygy for presentations of algebras. We give a method for constructing a linear basis of the space of syzygies for a set of reduction…
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 main purpose of the present work is solving the characterization problem which consist of identification of necessary and sufficient conditions on the scattering data ensuring that the reconstructed potential belongs to a particular…
Open-set classification is a problem of handling `unknown' classes that are not contained in the training dataset, whereas traditional classifiers assume that only known classes appear in the test environment. Existing open-set classifiers…