skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Award ID contains: 2155033

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; ; (, Proceedings of the American Mathematical Society)
    Motivated by recent work on optimal approximation by polynomials in the unit disk, we consider the following noncommutative approximation problem: for a polynomial f f in d d freely noncommuting arguments, find a free polynomial p n p_n , of degree at most n n , to minimize c n ≔ ‖<#comment/> p n f −<#comment/> 1 ‖<#comment/> 2 c_n ≔\|p_nf-1\|^2 . (Here the norm is the ℓ<#comment/> 2 \ell ^2 norm on coefficients.) We show that c n →<#comment/> 0 c_n\to 0 if and only if f f is nonsingular in a certain nc domain (the row ball), and prove quantitative bounds. As an application, we obtain a new proof of the characterization of polynomials cyclic for the d d -shift. 
    more » « less
    Full Text Available