Angle duality and a gap principle for convex combinations of incomplete polynomials on the unit circle

TL;DR

This paper introduces a geometric framework involving angle duality and a gap principle for convex combinations of incomplete polynomials on the unit circle, extending prior results and providing uniform bounds despite complex root distributions.

Contribution

It develops a novel angle gain mechanism and geometric analysis to establish separation phenomena for convex combinations of incomplete polynomials, extending previous work.

Findings

Established an angle duality and gap principle for incomplete polynomials.

Provided a uniform lower bound for convex combinations.

Extended results of Ge and Gonek to more general polynomial configurations.

Abstract

In this paper, we establish an angle duality and a gap principle for convex combinations of incomplete polynomials, extending two results of Ge and Gonek in [IMRN, 2024].Our approach is geometric: we introduce an ``angle gain'' mechanism for points inside the lune region and quantify how moving away from the unit circle forces a definite increase in the relevant angle functional.This yields a robust lower bound that is uniform under convex mixing and leads to the desired separation phenomenon.The main difficulty is that incomplete polynomials and their convex combinations may have highly nonuniform root distributions on the unit circle, so classical convex-hull type constraints are too coarse; one must instead control the local geometry of chords and boundary arcs and relate it to critical-point behavior through sharp trigonometric inequalities.