SearcharxivSearch

arXiv subjects

Richard Gustavson

Publications and source records attributed to Richard Gustavson.

6 recordsLinked to original sources

Generalized Reynolds algebras from Volterra integrals and their free construction by complete shuffle product

This paper introduces algebraic structures for Volterra integral operators with separable kernels, in the style of differential algebra for derivations and Rota-Baxter algebra for operators with kernels dependent solely on a dummy variable. We demonstrate that these operators satisfy a generalization of the algebraic identity defining the classical Reynolds operator, which is rooted in Reynolds's influential work on fluid mechanics. To study Volterra integral operators and their integral equations through this algebraic lens, particularly in providing a general form of these integral equations, we construct free objects in the category of algebras equipped with generalized Reynolds operators and the associated differential operators, termed differential Reynolds algebras. Due to the cyclic nature of the Reynolds identity, the natural rewriting rule derived from it does not terminate. To address this challenge, we develop a completion for the underlying space, where a complete shuffle product is defined for the free objects. We also include examples and applications related to Volterra integral equations.

math.RA

A reduction algorithm for Volterra integral equations

An integral equation is a way to encapsulate the relationships between a function and its integrals. We develop a systematic way of describing Volterra integral equations -- specifically an algorithm that reduces any separable Volterra integral equation into an equivalent one in operator-linear form, i.e. one that only contains iterated integrals. This serves to standardize the presentation of such integral equations so as to only consider those containing iterated integrals. We use the algebraic object of the integral operator, the twisted Rota-Baxter identity, and vertex-edge decorated rooted trees to construct our algorithm.

math.FA

An algebraic study of Volterra integral equations and their operator linearity

The algebraic study of special integral operators led to the notions of Rota-Baxter operators and shuffle products which have found broad applications. This paper carries out an algebraic study of general integral operators and equations, and shows that there are rich algebraic structures underlying Volterra integral operators and the corresponding equations. First Volterra integral operators are shown to produce a matching twisted Rota-Baxter algebra satisfying twisted integration-by-parts operator identities. In order to provide a universal space to express general integral equations, free operated algebras are then constructed in terms of bracketed words and rooted trees with decorations on the vertices and edges. Further explicit constructions of the free objects in the category of matching twisted Rota-Baxter algebras are obtained by a twisted and decorated generalization of the shuffle product, providing a universal space for separable Volterra equations. As an application of these algebraic constructions, it is shown that any integral equation with separable Volterra kernels is operator linear in the sense that the equation can be simplified to a linear combination of iterated integrals.

math.RA

Effective bounds for the consistency of differential equations

One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the problem of determining the existence of regular realizations of differential kernels via their possible prolongations. In this paper we effectively compute an improved upper bound for the number of prolongations needed to guarantee the existence of such realizations, which ultimately produces solutions to many types of systems of partial differential equations. This bound has several applications, including an improved upper bound for the order of characteristic sets of prime differential ideals. We obtain our upper bound by proving a new result on the growth of the Hilbert-Samuel function, which may be of independent interest.

math.AC

New order bounds in differential elimination algorithms

We present a new upper bound for the orders of derivatives in the Rosenfeld-Groebner algorithm. This algorithm computes a regular decomposition of a radical differential ideal in the ring of differential polynomials over a differential field of characteristic zero with an arbitrary number of commuting derivations. This decomposition can then be used to test for membership in the given radical differential ideal. In particular, this algorithm allows us to determine whether a system of polynomial PDEs is consistent. Previously, the only known order upper bound was given by Golubitsky, Kondratieva, Moreno Maza, and Ovchinnikov for the case of a single derivation. We achieve our bound by associating to the algorithm antichain sequences whose lengths can be bounded using the results of Leon Sanchez and Ovchinnikov.

math.AC

New effective differential Nullstellensatz

We show new upper and lower bounds for the effective differential Nullstellensatz for differential fields of characteristic zero with several commuting derivations. Seidenberg was the first to address this problem in 1956, without giving a complete solution. The first explicit bounds appeared in 2009 in a paper by Golubitsky, Kondratieva, Szanto, and Ovchinnikov, with the upper bound expressed in terms of the Ackermann function. D'Alfonso, Jeronimo, and Solernó, using novel ideas, obtained in 2014 a new bound if restricted to the case of one derivation and constant coefficients. To obtain the bound in the present paper without this restriction, we extend this approach and use the new methods of Freitag and León Sánchez and of Pierce from 2014, which represent a model-theoretic approach to differential algebraic geometry.

math.AC