# Lower bounds on the $L_p$ discrepancy of digital NUT sequences

## TL;DR

This paper establishes lower bounds on the $L_p$ discrepancy for digital NUT sequences, a significant subclass of digital sequences, contributing to the understanding of their uniformity properties.

## Contribution

It provides the first known lower bounds for the $L_p$ discrepancy of specific subclasses of digital NUT sequences, advancing discrepancy theory.

## Key findings

- Lower bounds for $L_p$ discrepancy of digital NUT sequences
- Identification of subclasses with provable discrepancy limits
- Enhancement of theoretical understanding of digital sequence uniformity

## Abstract

We study the $L_p$ discrepancy of digital NUT sequences which are an important sub-class of digital $(0,1)$-sequences in the sense of Niederreiter. The main result is a lower bound for certain sub-classes of digital NUT sequences.