Related papers: Completion of Linear Differential Systems to Invol…

In this paper, we give decision criteria for normal binomial difference polynomial ideals in the univariate difference polynomial ring F{y} to have finite difference Groebner bases and an algorithm to compute the finite difference Groebner…

We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…

We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes…

In this work we present a novel framework for the computation of finite dimensional invariant sets of infinite dimensional dynamical systems. It extends a classical subdivision technique [Dellnitz/Hohmann 1997] for the computation of such…

A general expression for a relative invariant of a linear ordinary differential equations is given in terms of the fundamental semi-invariant and an absolute invariant. This result is used to established a number of properties of relative…

Differential-elimination algorithms apply a finite number of differentiations and eliminations to systems of partial differential equations. For systems that are polynomially nonlinear with rational number coefficients, they guarantee the…

In the last chapter of his book "The Algebraic Theory of Modular Systems " published in 1916, F. S. Macaulay developped specific techniques for dealing with " unmixed polynomial ideals " by introducing what he called " inverse systems ".…

This paper is concerned with linear parameter-dependent systems and considers the notion uniform ensemble reachability. The focus of this work is on constructive methods to compute suitable parameter-independent open-loop inputs for such…

This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…

A novel approach is introduced for deriving exact solutions to nonlinear systems of ordinary differential equations. This method consists of four parts. In the initial part, the examined nonlinear differential equation system is transformed…

Full set of autonomous completely solvable differential systems of equations in total differentials is built by basis of infinitesimal operators, universal invariant, and structure constants of admited multiparametric Lie group (abelian and…

In this paper we introduce a method of characteristic sets with respect to several term orderings for difference-differential polynomials. Using this technique, we obtain a method of computation of multivariate dimension polynomials of…

We consider an arbitrary representation of the additive group over a field of characteristic zero and give an explicit description of a finite separating set in the corresponding ring of invariants.

We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…

Dynamical systems with quadratic or polynomial drift exhibit complex dynamics, yet compared to nonlinear systems in general form, are often easier to analyze, simulate, control, and learn. Results going back over a century have shown that…

In this article, we introduce the notion of differential flatness by pure prolongation: loosely speaking, a system admits this property if, and only if, there exists a pure prolongation of finite order such that the prolonged system is…

In this paper, we describe a new method to compute the minimum of a real polynomial function and the ideal defining the points which minimize this polynomial function, assuming that the minimizer ideal is zero-dimensional. Our method is a…

We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…

The main purpose of this paper is to formulate new conditions for smooth linearization of nonautonomous systems with discrete and continuous time. Our results assume that the linear part admits a nonuniform polynomial dichotomy and that the…

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…