#### Date of Degree

9-2017

#### Document Type

Dissertation

#### Degree Name

Ph.D.

#### Program

Mathematics

#### Advisor

Kevin O'Bryant

#### Committee Members

Cormac O'Sullivan

Melvyn Nathanson

#### Subject Categories

Discrete Mathematics and Combinatorics | Number Theory

#### Abstract

The first chapter establishes results concerning equidistributed sequences of numbers. For a given $d\in\mathbb{N}$, $s(d)$ is the largest $N\in\mathbb{N}$ for which there is an $N$-regular sequence with $d$ irregularities. We compute lower bounds for $s(d)$ for $d\leq 10000$ and then demonstrate lower and upper bounds $\left\lfloor\sqrt{4d+895}+1\right\rfloor\leq s(d)< 24801d^{3} + 942d^{2} + 3$ for all $d\geq 1$. In the second chapter we ask if $Q(x)\in\mathbb{R}[x]$ is a degree $d$ polynomial such that for $x\in[x_k]=\{x_1,\cdots,x_k\}$ we have $|Q(x)|\leq 1$, then how big can its lead coefficient be? We prove that there is a unique polynomial, which we call $L_{d,[x_k]}(x)$, with maximum lead coefficient under these constraints and construct an algorithm that generates $L_{d,[x_k]}(x)$.

#### Recommended Citation

Levy, Karl, "Some Results in Combinatorial Number Theory" (2017). *CUNY Academic Works.*

https://academicworks.cuny.edu/gc_etds/2182