Matthew Junge, University of Washington

*The frog model on trees*

On a *d*-ary tree, place some number (random or otherwise) of sleeping frogs at each site, as well as one awake frog at the root.
Awake frogs perform simple random walk and wake any "sleepers" they encounter.
A longstanding open problem: Does every frog wake up?
It turns out this depends on *d* and the number of frogs.
The proof uses two different recursions and two different versions of stochastic domination.
Joint work with Christopher Hoffman and Tobias Johnson.

Ewan Kummel, Portland State University

*The "100 prisoners" problem: part 2*

I will (re)introduce the "100 prisoners" problem and its solution and explore more of the problem's combinatorial properties.
Then I will present an unusual proof, due to Eugene Curtin and Max Warshauer, that the purported solution is in fact optimal.
This talk will not presuppose the content of my previous talk on this problem.

Pieter VandenBerge, Portland State University

*The "dice summing problem"*

In this talk I tell you about my search for a general formula for the "dice summing problem".
Given a finite set of dice with a set number of sides, how many different ways are there to roll a given sum?
This search almost entirely involves techniques presented in our 300-level discrete class, elaborated appropriately.
We will go over these techniques and explore the problem and solutions.
I will also provide some analysis of how the exploring this problem has shaped my ideas of best practice in problem solving over the course of my first year as a Master's student.

Ronni Atchley, Portland State University

*TBA*