# Randomized Verblunsky Parameters in Steklov's Problem

## TL;DR

This paper investigates the use of randomized Verblunsky parameters in orthogonal polynomials on the unit circle to address Steklov's problem of bounding polynomial norms independently of degree.

## Contribution

It introduces a novel approach using randomness in Verblunsky parameters to study uniform bounds in Steklov's problem.

## Key findings

- Randomized Verblunsky parameters can be used to establish bounds on polynomial norms.
- The approach provides new insights into Steklov's problem.
- Potential for improved bounds in orthogonal polynomial theory.

## Abstract

We consider randomized Verblunsky parameters for orthogonal polynomials on the unit circle as they relate to the problem of Steklov, bounding the polynomials' uniform norm independent of $n$.