Minimizing blossoms under symmetric linear constraints

Rachid Ait Haddou*, L. Biard, M. A. Slawinski

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

In this paper, we show that there exists a close dependence between the control polygon of a polynomial and the minimum of its blossom under symmetric linear constraints. We consider a given minimization problem P, for which a unique solution will be a point δ on the Bézier curve. For the minimization function f, two sufficient conditions exist that ensure the uniqueness of the solution, namely, the concavity of the control polygon of the polynomial and the characteristics of the Polya frequency-control polygon where the minimum coincides with a critical point of the polynomial. The use of the blossoming theory provides us with a useful geometrical interpretation of the minimization problem. In addition, this minimization approach leads us to a new method of discovering inequalities about the elementary symmetric polynomials.

Original languageEnglish (US)
Pages (from-to)421-431
Number of pages11
JournalComputer Aided Geometric Design
Volume19
Issue number6
DOIs
StatePublished - Jan 1 2002

Keywords

  • Blossom
  • Bézier curve
  • Elementary symmetric function
  • Permanent
  • Polya frequency sequences

ASJC Scopus subject areas

  • Modeling and Simulation
  • Automotive Engineering
  • Aerospace Engineering
  • Computer Graphics and Computer-Aided Design

Fingerprint Dive into the research topics of 'Minimizing blossoms under symmetric linear constraints'. Together they form a unique fingerprint.

Cite this