This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in perfect field when those ideals are generated by a triangular system of generators.Expand

In this paper, we give sufficient conditions to have a complete synchronization of oscillators in connected undirected networks. The oscillators we are considering are not necessarily identical and… Expand

Dans cet article, nous exploitons la reductibilite d'un polynome d'une variable pour calculer efficacement l'ideal des relations algebriques entre ses racines.Expand

We present new results about the computation of a general shape of a triangular basis generating the splitting ideal of an irreducible polynomial given with the permutation representation of its Galois group G.Expand

This paper presents a method for investigating, through an automatic procedure, the (lack of) structural identifiability of dynamical models parameters.Expand

Let T0 = (A 0 ··· A d) be a d-simplex, G0 its centroid, S its circumsphere, O the center of S. Let (A i) be the points where S intersects the lines (G0A i), T1 the d-simplex (A 0 ··· A d), and G1 its… Expand

The identifiability's study of a parametrized model is one of the last step of the modeling and consists in insuring that each of its output corresponds to a unique parameter vector. Actually, at our… Expand