相关论文: Normal Systems of Algebraic and Partial Differenti…

We discuss the formal aspects of the factorial polynomials and of the associated series. We develop the theory using the formalism of quasi-monomials and prove the usefulness of the method for the solutions of nontrivial difference…

In this paper are examined general classes of linear and non-linear analytical systems of partial differential equations. Indeed the integrability conditions are found and if they are satisfied, the solutions are given as functional series…

We give explicit formulas as well as a quadratic time algorithm to solve (so called) generalized Vandermonde's systems of p linear equations and n variables. It allows in particular to find all (so called Lagrange's) interpolation polynoms…

In this paper we derive an upper bound for the degree of the strict invariant algebraic curve of a polynomial system in the complex project plane under generic condition. The results are obtained through the algebraic multiplicities of the…

A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…

The set of non-linear equations describing the Standard Model kinematics of the top quark antiqark production system in the dilepton decay channel has at most a four-fold ambiguity due to two not fully reconstructed neutrinos. Its most…

The Poincare'-Dulac normal form of a given resonant system is in general non unique; given a specific normal form, one would like to further reduce it to a simplest normal form. In this note we give an algorithm, based on the Lie algebraic…

In this paper we generalize the involutive methods and algorithms devised for polynomial ideals to differential ones generated by a finite set of linear differential polynomials in the differential polynomial ring over a zero characteristic…

Geometric modeling by constraints leads to large systems of algebraic equations. This paper studies bipartite graphs underlaid by systems of equations. It shows how these graphs make possible to polynomially decompose these systems into…

We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…

Normal forms allow the use of a restricted class of coordinate transformations (typically homogeneous polynomials) to put the bifurcations found in nonlinear dynamical systems into a few standard forms. We investigate here the consequences…

Positively graded algebras are fairly natural objects which are arduous to be studied. In this article we query quotients of non-standard graded polynomial rings with combinatorial and commutative algebra methods.

In this note, we use a natural desingularization of the conormal variety of the variety of n x n symmetric matrices of rank at most r to find a general formula for the algebraic degree in semidefinite programming.

On the base of Lie algebraic and differential geometry methods, a wide class of multidimensional nonlinear systems is obtained, and the integration scheme for such equations is proposed.

A generalization of the reduction technique for ODEs recently introduced by Gao and Liu is given. It is shown that the use of algebraic methods allows the extension of the procedure to much more general flows, as well as the derivation of…

We introduce the multigraded Hilbert scheme, which parametrizes all homogeneous ideals with fixed Hilbert function in a polynomial ring that is graded by any abelian group. Our construction is widely applicable, it provides explicit…

This paper is a short introduction to orthogonal polynomials, both the general theory and some special classes. It ends with some remarks about the usage of computer algebra for this theory.

A new class of integrable mappings and chains is introduced. Corresponding $(1+2)$ integrable systems invariant with respect to such discrete transformations are presented in an explicit form. Their soliton-type solutions are constructed in…

We consider a generalization of polynomial programs: algebraic programs, which are optimization or feasibility problems with algebraic objectives or constraints. Algebraic functions are defined as zeros of multivariate polynomials. They are…

Bilinear systems of equations are defined, motivated and analyzed for solvability. Elementary structure is mentioned and it is shown that all solutions may be obtained as rank one completions of a linear matrix polynomial derived from…