activity
20082026
most citedDe Finetti theorems for easy quantum groups

60 citations · 80 across the 19 of their papers we have counts for

collaborators

21 papers

math.CO2026

Floridian Solitaire: A New Variant of Bulgarian Solitaire

Aaron Meyerowitz, Stephen J. Curran, Stephen C. Locke +1

Bulgarian solitaire is a well-studied, no-choice, no-loss, one-player game involving stacks of cards. More formally, it is a self-map on the set of partitions of a fixed integer $n…

math.CO2026

Two-pile and three-pile games of a new variant of Nim known as Halve Nim

Stephen C. Locke, Stephen J. Curran, Richard M. Low

We investigate a variant of Nim called Halve Nim, which in addition to the standard moves of Nim, we allow replacing each pile of coins with half its amount. We determine the P-pos…

math.CO2026

C4-face-magic labeling on a 4x4 Klein bottle grid graph

Timothy Myers, Stephen J. Curran

For a graph G = (V, E) embedded in the Klein bottle, let F(G) denote the set of faces of G. A C_4-face-magic Klein bottle labeling on G is a bijection f: V(G) to {1, 2,..., |V(G)|}…

math.CO2023★ 1 cited

A Comment on Dean's Construction of Prime Labelings on Ladders

Stephen J. Curran, M. A. Ollis

A prime labeling on a graph of order is an assignment of to the vertices of the graph such that each pair of adjacent vertices has coprime labels. The l…

math.CO2022

Odd order -face-magic projective grid graphs having -face-magic value or

Stephen J. Curran

For a graph embedded in the projective plane, let denote the set of faces of . Then, is called a -face-magic projective graph if there exi…

math.CO2022

Equatorially balanced C4-face-magic labelings on Klein bottle grid graphs

Stephen J. Curran, Richard M. Low, Stephen C. Locke

For a graph embedded in the Klein bottle, let denote the set of faces of . Then, is called a -face-magic Klein bottle graph if there exist…