International audienceEhrhart polynomials are amazing mathematical objects that I discovered in the early 90's and that have many applications in computer science. This retrospective relates my personal and scientific experience regarding this research work, my meeting with the mathematician Eugène Ehrhart, and addresses some extensions and perspectives of further developments
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
For many of us, modern-day linear programming (LP) started with the work of George Dantzig in 1947. ...
Polynomials are well known for their ability to improve their properties and for their applicability...
International audienceEhrhart polynomials are amazing mathematical objects that I discovered in the ...
Many optimization techniques, including several targeted specifically at embedded systems, depend on...
Several scientific problems are represented as sets of linear (or affine) con-straints over a set of...
To John Shareshian, for being an excellent advisor and valued mentor; I could not have done this wit...
ABSTRACT. Most of the “extremal problems ” of Harmonic (or Fourier) Analysis which emerged before th...
This article focuses on those problems about extremal properties of polynomials that were considered...
At the beginning of the 13th century Fibonacci described the rules for making mixtures of all kinds,...
AbstractIn collecting material for an autobiographical statement, I realized that I had been privile...
17 pages, 2 figuresInternational audienceOne considers weighted sums over points of lattice polytope...
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version o...
2This version of the thesis was updated in October 2014. The update only concerns the presentation a...
Rapid advances in the physical and biological sciences and in related technologies have brought abou...
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
For many of us, modern-day linear programming (LP) started with the work of George Dantzig in 1947. ...
Polynomials are well known for their ability to improve their properties and for their applicability...
International audienceEhrhart polynomials are amazing mathematical objects that I discovered in the ...
Many optimization techniques, including several targeted specifically at embedded systems, depend on...
Several scientific problems are represented as sets of linear (or affine) con-straints over a set of...
To John Shareshian, for being an excellent advisor and valued mentor; I could not have done this wit...
ABSTRACT. Most of the “extremal problems ” of Harmonic (or Fourier) Analysis which emerged before th...
This article focuses on those problems about extremal properties of polynomials that were considered...
At the beginning of the 13th century Fibonacci described the rules for making mixtures of all kinds,...
AbstractIn collecting material for an autobiographical statement, I realized that I had been privile...
17 pages, 2 figuresInternational audienceOne considers weighted sums over points of lattice polytope...
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version o...
2This version of the thesis was updated in October 2014. The update only concerns the presentation a...
Rapid advances in the physical and biological sciences and in related technologies have brought abou...
This habilitation thesis deals with polynomial system solving through Gröbner bases computations. I...
For many of us, modern-day linear programming (LP) started with the work of George Dantzig in 1947. ...
Polynomials are well known for their ability to improve their properties and for their applicability...