1 citations · 1 across the 6 of their papers we have counts for
7 papers
Mixed thresholds in the Lonely Runner Conjecture
Alathea Jensen
The Lonely Runner Conjecture states that if runners start at the same point on a unit-length circular track and run with distinct constant speeds, then each runner is at some…
A combinatorial bound on the number of distinct eigenvalues of a graph
Sarah Allred, Craig Erickson, Kevin Grace +2
The smallest possible number of distinct eigenvalues of a graph , denoted by , has a combinatorial bound in terms of unique shortest paths in the graph. In particular, $q(…
Numerical Semigroups Generated by Quadratic Sequences
Mara Hashuga, Megan Herbine, Alathea Jensen
We investigate numerical semigroups generated by any quadratic sequence with initial term zero and an infinite number of terms. We find an efficient algorithm for calculating the A…
Stochastic Enumeration with Importance Sampling
Alathea Jensen
Many hard problems in the computational sciences are equivalent to counting the leaves of a decision tree, or, more generally, summing a cost function over the nodes. These problem…
Self-Polar Polytopes
Alathea Jensen
Self-polar polytopes are convex polytopes that are equal to an orthogonal transformation of their polar sets. These polytopes were first studied by Lovász as a means of establishin…
A Sequential Importance Sampling Algorithm for Estimating Linear Extensions
Isabel Beichl, Alathea Jensen
In recent decades, a number of profound theorems concerning approximation of hard counting problems have appeared. These include estimation of the permanent, estimating the volume…
Intersections, circuits, and colorability of line segments
Boris Brimkov, Jesse Geneson, Alathea Jensen +2
We derive sharp upper and lower bounds on the number of intersection points and closed regions that can occur in sets of line segments with certain structure, in terms of the numbe…