Oakley Edens

activity

20242026

collaborators

3 papers

math.CO2026

Exact Bounds for Forbidden Configurations and the Extremal Matrices

Richard P. Anstee, Oakley Edens, Arvin Sahami +2

Let $F$ be a $k \times ℓ$ (0,1)-matrix. A matrix is simple if it is a (0,1)-matrix with no repeated columns. A (0,1)-matrix $A$ is said to have a $F$ as a configuration if there…

math.CO2025

Forbidden Configurations and Boundary Cases

Richard P. Anstee, Oakley Edens, Arvin Sahami +1

Let $F$ be a $k \times ℓ$ (0,1)-matrix. Define a (0,1)-matrix $A$ to have a $F$ as a \emph{configuration} if there is a submatrix of $A$ which is a row and column permutation of…

math.AG2024

Hilbert's 13th problem in prime characteristic

Oakley Edens, Zinovy Reichstein

The resolvent degree $rd_{C} (n)$ is the smallest integer $d$ such that a root of the general polynomial $f (x) = x^{n} + a_{1} x^{n - 1} + \dots + a_{n}$ can be express…