4 papers
The pebbling threshold spectrum and paths
David Moews
Given a distribution of pebbles on the vertices of a graph, say that we can pebble a vertex if a pebble is left on it after some sequence of moves, each of which takes two pebbles…
The motif problem
E. Rodney Canfield, Ron Fertig, R. Daniel Mauldin +1
Fix a choice and ordering of four pairwise non-adjacent vertices of a parallelepiped, and call a motif a sequence of four points in R^3 that coincide with these vertices for some,…
The probability that a random monic p-adic polynomial splits into linear factors
Joe Buhler, Daniel Goldstein, David Moews +1
Let n be a positive integer and let p be a prime. We calculate the probability that a random monic polynomial of degree n with coefficients in the ring Z_p of p-adic integers split…
The identity is the most likely exchange shuffle for large n
Daniel Goldstein, David Moews
Let a deck of n cards be shuffled by successively exchanging the cards in positions 1, 2, ..., n with cards in randomly chosen positions. We show that for n equal to 18 or greater,…