jsteinman (at) umass.edu

I am a fourth-year undergraduate majoring in pure math and computer science at UMass Amherst. Some of my hobbies include watching movies, playing table tennis, and speedcubing.

with Andreas Buttenschön. Published on arXiv, 2024.

**Abstract:**
Off-lattice agent-based models (or cell-based models) of
multicellular systems are increasingly used to create in-silico
models of in-vitro and in-vivo experimental setups of cells and
tissues, such as cancer spheroids, neural crest cell migration,
and liver lobules. These applications, which simulate thousands to
millions of cells, require robust and efficient numerical methods.
At their core, these models necessitate the solution of a large
friction-dominated equation of motion, resulting in a sparse,
symmetric, and positive definite matrix equation. The conjugate
gradient method is employed to solve this problem, but this
requires a good preconditioner for optimal performance. In this
study, we develop a graph-based preconditioning strategy that can
be easily implemented in such agent-based models. Our approach
centers on extending support graph preconditioners to
block-structured matrices. We prove asymptotic bounds on the
condition number of these preconditioned friction matrices. We
then benchmark the conjugate gradient method with our support
graph preconditioners and compare its performance to other common
preconditioning strategies.

One of my passions is math and computer science exposition, and I have found that making videos is an excellent outlet. I make videos on whatever topics in math and computer science I believe I can meaningfully explain in around 10–20 minutes. My primary inspiration is 3Blue1Brown, and I use the community edition of his animation library Manim. Perhaps my greatest accolade is this 4-second shoutout. While I wish that I could create more videos, the animation process takes many hours that I do not have.

I am the founder and president of the UMass Recreational Math Club (RMC). We host weekly meetings where we solve puzzles and problem sets, do crafts and origami, play games, create animations, and anything else that's even remotely mathematical. The club is open to all students of all majors in the Five College Consortium, so if this sounds like your thing, join our Discord or follow us on Instagram @umass_rmc for updates.

As an avid SET player, it is natural to ask how many cards can be on the table before there has to be a set. If we treat each of the 81 cards as points in \(\mathbb{F}_3^4\), then the question becomes how many points can be taken before 3 of them have to be colinear (i.e., in arithmetic progression). This is the cap set problem, and it is surprisingly difficult to answer. In fact, we do not know the exact solution in dimensions greater than 6. This repository has some of my experiments in generating cap sets. One is a randomized greedy approach, and the other generates all cap sets up to automorphism using an orderly algorithm. With this, I managed to prove that there are no complete cap sets in 4 dimensions of size 19.

One of my favorite games to speedrun is Minesweeper. I made this Chrome extension not only to cheat, but also to teach myself when I have to guess and what the optimal guess is. Minesweeper is actually NP-complete, so the best way to solve it is to reduce the problem to an instance of 0-1 integer programming.

This website is a big reason for my love of algorithms today. I made it at the end of highschool, and it was my first real exposure to graph theory. I was blown away by how many ways there are to generate a maze. I strongly recommend this as a project for anyone who wants a fun and intuitive introduction to graph algorithms.

Every semester I would find myself doing the same grade calculations in Desmos to figure out what I needed on an exam. So I made a website for it.