473 research outputs found

    Syzygies among reduction operators

    Get PDF
    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 operators. We interpret these syzygies in terms of the confluence property from rewriting theory. This enables us to optimise the completion procedure for reduction operators based on a criterion for detecting useless reductions. We illustrate this criterion with an example of construction of commutative Gr{\"o}bner basis

    Reduction Operators and Completion of Rewriting Systems

    Get PDF
    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 of confluence and we show that this notion is equivalent to the Church-Rosser property of reduction operators. In this paper we give an algebraic formulation of completion using the lattice structure. We relate reduction operators and Gr\"obner bases. Finally, we introduce generalised reduction operators relative to non total ordered sets

    Reduction Operators of Linear Second-Order Parabolic Equations

    Full text link
    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 differential ones are exhaustively described. This problem proves to be equivalent, in some sense, to solving the initial equations. The ``no-go'' result is extended to the investigation of point transformations (admissible transformations, equivalence transformations, Lie symmetries) and Lie reductions of the determining equations for the nonclassical symmetries. Transformations linearizing the determining equations are obtained in the general case and under different additional constraints. A nontrivial example illustrating applications of reduction operators to finding exact solutions of equations from the class under consideration is presented. An observed connection between reduction operators and Darboux transformations is discussed.Comment: 31 pages, minor misprints are correcte

    Reduction operators of Burgers equation

    Get PDF
    The solution of the problem on reduction operators and nonclassical reductions of the Burgers equation is systematically treated and completed. A new proof of the theorem on the special "no-go" case of regular reduction operators is presented, and the representation of the coefficients of operators in terms of solutions of the initial equation is constructed for this case. All possible nonclassical reductions of the Burgers equation to single ordinary differential equations are exhaustively described. Any Lie reduction of the Burgers equation proves to be equivalent via the Hopf-Cole transformation to a parameterized family of Lie reductions of the linear heat equation.Comment: 11 pages, minor correction

    Image reduction with local reduction operators

    Full text link
    In this work we propose an image reduction algorithm based on weak local reduction operators. We use several averaging functions to build these operators and we analyze their properties. We present experimental results where we apply the algorithm and weak local reduction operators in procedures of reduction, and later, reconstruction of images. We analyze these results over natural images and noisy images.<br /

    A lattice formulation of the F4 completion procedure

    Get PDF
    We write a procedure for constructing noncommutative Groebner bases. Reductions are done by particular linear projectors, called reduction operators. The operators enable us to use a lattice construction to reduce simultaneously each S-polynomial into a unique normal form. We write an implementation as well as an example to illustrate our procedure. Moreover, the lattice construction is done by Gaussian elimination, which relates our procedure to the F4 algorithm for constructing commutative Groebner bases
    corecore