3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2023
Some extensions of Delete Nim
Tomoaki Abuku, Ko Sakai, Masato Shinoda +1
Nim is a well-known combinatorial game with several variants, e.g., Delete Nim and Variant Delete Nim. In Variant Delete Nim, the player deletes one of the two heaps of stones and…
math.PR2013★ 3 cited
Uniform spanning trees on Sierpinski graphs
Masato Shinoda, Elmar Teufl, Stephan Wagner
We study spanning trees on Sierpinski graphs (i.e., finite approximations to the Sierpinski gasket) that are chosen uniformly at random. We construct a joint probability space for…