3 papers
math.CO2020
Toward a Combinatorial Theory of SET and Related Card Games
Jonathan Schneider
We define a natural equivalence relation on collections of cards from the card game SET, and enumerate some of the equivalence classes, vastly generalizing the standard game. On th…
math.GT2018
A spinning construction for virtual 1-knots and 2-knots, and the fiberwise and welded equivalence of virtual 1-knots
Louis H. Kauffman, Eiji Ogasa, Jonathan Schneider
We succeed to generalize spun knots of classical 1-knots to the virtual 1-knot case by using the `spinning construction'. That, is, we prove the following: Let be a spun knot o…
math.CO2012
Polynomial sequences of binomial-type arising in graph theory
Jon Schneider
In this paper, we show that the solution to a large class of "tiling" problems is given by a polynomial sequence of binomial type. More specifically, we show that the number of way…