相关论文: A Maple Package for Computing Groebner Bases for L…

One studies a particular algebraic system where the unknowns are matrices. We solve this system according to the parameters values thanks to the theory of Grobner basis.

We study the problem of the computation of Groebner basis for the ideal of linear recurring relations of a doubly periodic array. We find a set of indexes such that, along with some conditions, guarantees that the set of polynomials…

Here we study the problem of generalizing one of the main tools of Groebner basis theory, namely the flat deformation to the leading term ideal, to the border basis setting. After showing that the straightforward approach based on the…

In this paper, we propose a multiscale empirical interpolation method for solving nonlinear multiscale partial differential equations. The proposed method combines empirical interpolation techniques and local multiscale methods, such as the…

Some recent results on evaluating Feynman integrals are reviewed. The status of the method based on Mellin-Barnes representation as a powerful tool to evaluate individual Feynman integrals is characterized. A new method based on Groebner…

We consider the problem of computing critical points of the restriction of a polynomial map to an algebraic variety. This is of first importance since the global minimum of such a map is reached at a critical point. Thus, these points…

In this article, we present a constructive procedure for determining all ideals of the Borel subalgebra of a complex semisimple Lie algebra from its root system or, equivalently, its Dynkin diagram. The proposed algorithmic approach has…

Given a planar curve defined by means of a real rational parametrization, we prove that the affine values of the parameter generating the real singularities of the offset are real roots of a univariate polynomial that can be derived from…

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

Polyhedral affinoid algebras have been introduced by Einsiedler, Kapranov and Lind to connect rigid analytic geometry (analytic geometry over non-archimedean fields) and tropical geometry. In this article, we present a theory of Gr{\"o}bner…

We argue that the Mellin-Barnes representations of Feynman diagrams can be used for obtaining linear systems of homogeneous differential equations for the original Feynman diagrams with arbitrary powers of propagators without recourse to…

Let $I$ be an ideal of the polynomial ring $A[x]=A[x_1,...,x_n]$ over the commutative, noetherian ring $A$. Geometrically $I$ defines a family of affine schemes over $\Spec(A)$: For $\p\in\Spec(A)$, the fibre over $\p$ is the closed…

We describe a new method of calculation of generic multi-loop master integrals based on the numerical solution of systems of difference equations in one variable. We show algorithms for the construction of the systems using…

A package of Maple 5.3 commands for doing calculations with anticommutative variables is presented.

It is the aim of this work to identify and illustrate the potential and weaknesses of the computer algebra system Maple in the area of the Calculus of Variations: a classical area of mathematics that studies the methods for finding maximum…

Bayesian nonparametric mixtures and random partition models are powerful tools for probabilistic clustering. However, standard independent mixture models can be restrictive in some applications such as inference on cell lineage due to the…

This paper discusses an efficient implementation of the generation of order conditions for the construction of exponential integrators like exponential splitting and Magnus-type methods in the computer algebra system Maple. At the core of…

Using evaluation at appropriately chosen points, we propose a Gr\"obner basis free approach for calculating the secondary invariants of a finite permutation group. This approach allows for exploiting the symmetries to confine the…

In this work we announce the Maple package conley to compute connection and C-connection matrices. conley is based on our abstract homological algebra package homalg. We emphasize that the notion of braids is irrelevant for the definition…

Linear exact modeling is a problem coming from system identification: Given a set of observed trajectories, the goal is find a model (usually, a system of partial differential and/or difference equations) that explains the data as precisely…