A Natural Rank Problem for Homogeneous Polynomials and Connections with the Theory of Functions of Several Complex Variables

Document Type

Presentation Abstract

Presentation Date

5-6-2020

Abstract

We study a natural extremal problem about the vector space consisting of all homogeneous polynomials of degree d in n+1 variables with complex coefficients, together with the zero polynomial. We define the rank of a polynomial to be the number of distinct monomials appearing in the polynomial with non-zero coefficient. We are particularly interested in those homogeneous polynomials whose quotient with the homogeneous polynomial x0+x1+⋯+xn is a polynomial of degree d−1 with maximal rank. For each degree d, we seek the minimum rank for an element of this subfamily and we seek to describe those polynomials with minimum rank. We call such polynomials sharp polynomials.

These problems have a simple solution for polynomials in one and two variables. The three-variable case is interesting and non-trivial, but well-understood. This research question has its roots in the study of proper polynomial mappings between balls in complex Euclidean spaces of different dimensions and the degree estimates problem. D'Angelo, Kos and Riehl and Lebl and Peters used a graph-theoretic approach to solve this problem in the case of proper monomial mappings. Lebl and Peters give a minimum rank estimate that answers our question in the three variable case. A family of sharp polynomials was described by D'Angelo and has been extensively studied. Brooks and Grundmeier provided a new proof of the minimum rank theorem in the three-variable case using a commutative algebra approach. They reformulate the problem as a question about homogeneous ideals and address it by studying the Hilbert function and the graded Betti number of certain ideals.

Using the same method as Brooks and Grundmeier, we give a sharp estimate for the minimum rank of homogeneous polynomials of our subfamily in four variables as well as a family of sharp polynomials. Moreover, we state a general result on the minimum rank for polynomials in n+1

variables. Although this estimate is sharp in the three- and four- variable cases, the estimate is not sharp when the number of variables is greater than four.

Additional Details

Doctoral Dissertation Defense. Link to the presenter's dissertation.

May 6, 2020 at 10:00 a.m. in Zoom

This document is currently not available here.

Share

COinS