Polynomially contractible sets
This article introduces the notion of an n-contractible set (a generalization of the idea of a starlike set), suggests some problems concerning n-contractibility, gives some rudimentary results, and describes an application to a type of optimization problem. Definition: A nonempty connected planar set S will be called n- contractible if there exists a polynomial p(z) of degree n such that p(z) points inward on the boundary of S. As an example, a set which is starlike or radial about a point w is contractible by \(p(z)=w-z\) and so is 1-contractible. A theorem proved in an earlier work of ours implies the following: Theorem. Let D be a closed domain whose boundary curve is twice differentiable. Then D is n-contractible for some n. We address the following questions, for a given domain what is its minimal order of contractibility and what is a polynomial of that degree which contracts it. In the process we provide some guidelines for determining if a given domain is contractible by a specific polynomial. Then we prove: (1) All lunes are 2-contractible; (2) There exists a simply connected region (which we reproduce) that is not contractible by a polynomial of degree \(<7.\) We demonstrate the utility of the concept of n-contractibility with an application to an optimization problem. For this case we give an algorithm for minimizing an objective function based on the n- contractibility of its sublevel sets.
- scientific article; zbMATH DE number 5723943
- Contractible fibers of polynomial functions
- Contractibility of the solution sets in strictly quasiconcave vector maximization on noncompact domains
- Contractibility of efficient frontier of simply shaded sets
- Contractibility of the efficient set in strictly quasiconcave vector maximization
This page was built for publication: Polynomially contractible sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3769148)