The Park City Math Institute 2016 Summer Undergraduate Faculty Program met for the purpose of composing guidelines for undergraduate programs in data science. The group consisted of 25 undergraduate faculty from a variety of institutions in the United States, primarily from the disciplines of mathematics, statistics, and computer science. These guidelines are meant to provide some structure for institutions planning for or revising a major in data science.

In an atomic, cancellative, commutative monoid $S$, the elasticity of an element provides a coarse measure of its non-unique factorizations by comparing the largest and smallest values in its set of factorization lengths (called its length set). In this paper, we show that the set of length sets $\mathcal L(S)$ for any arithmetical numerical monoid $S$ can be completely recovered from its set of elasticities $R(S)$; therefore, $R(S)$ is as strong a factorization invariant as $\mathcal L(S)$ in this setting. For general numerical monoids, we describe the set of elasticities as a specific collection of monotone increasing sequences with a common limit point of $\max R(S)$

Abstract. Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and ω-primality. While progress in this field has been accelerated by the use of computer algebra systems, many existing algorithms are computationally infeasible for numerical monoids with several irreducible elements. In this paper, we present dynamic algorithms for the factorization set, length set, delta set, and ω-primality in numerical monoids and demonstrate that these algorithms give significant improvements in runtime and memory usage. In describing our dynamic approach to computing ω-primality, we extend the usual definition of this invariant to the quotient group of the monoid and show that several useful results naturally extend to this broader setting.

A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid S, consider the family of "shifted" monoids M n obtained by adding n to each generator of S. In this paper, we examine minimal relations among the generators of M n when n is sufficiently large, culminating in a description that is periodic in the shift parameter n. We explore several applications to computation, combinatorial commutative algebra, and factorization theory.

In an atomic, cancellative, commutative monoid, the ω-value measures how far an element is from being prime. In numerical monoids, we show that this invariant exhibits eventual quasilinearity (i.e., periodic linearity). We apply this result to describe the asymptotic behavior of the ω-function for a general numerical monoid and give an explicit formula when the monoid has embedding dimension 2.