• Publications
  • Influence
Computation of the Decomposition Group of a Triangular Ideal
TLDR
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
  • 9
  • 1
  • PDF
Nonlinear synchronization on connected undirected networks
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 andExpand
  • 6
  • 1
  • PDF
Note sur les relations entre les racines d'un polynéme réductible (Text in French)
TLDR
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
  • 1
  • 1
Computation schemes for splitting fields of polynomials
TLDR
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
  • 3
  • PDF
A systematic approach for doing an a priori identifiability study of dynamical nonlinear models.
TLDR
This paper presents a method for investigating, through an automatic procedure, the (lack of) structural identifiability of dynamical models parameters. Expand
  • 2
Efficient Arithmetic in Successive Algebraic Extension Fields Using Symmetries
TLDR
We present new results for efficient arithmetic operations in a number field K represented by successive extensions. Expand
  • 2
Corps de décomposition d'un polynôme réductible
Dans cet article, nous exploitons la reductibilite d'un polynome d'une variable pour calculer efficacement son corps de decomposition.
DYNAMICAL SYSTEMS OF SIMPLICES IN DIMENSION 2 OR 3
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 itsExpand
A strategic algorithmic tool for doing an a priori identifiability study of dynamical nonlinear models
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 ourExpand
...
1
2
...