Richard M. Low

collaborators

4 papers

math.RA2026

Corrigendum to "A Characterization of the Unit Group in Z[T x C_2]"

Richard M. Low

We correct Lemma 3.6 and Theorem 3.7 of T.~Bilgin, O.~Kusmus, and R.~M.~Low, \emph{A Characterization of the Unit Group in $Z [T \times C_{2}]$ }, Bull.\ Korean Math.\ Soc.\ \te…

math.CO2026

All Polyominoes are $C_{4}$ -face-magic

Parikshit Chalise, Richard M. Low, Arman Eisenkolb-Vaithyanathan

For a planar graph $G = (V, E)$ embedded in $R^{2}$ , let $F (G)$ denote the set of faces of $G$ . Then $G$ is called a \textit{ $C_{n}$ -face-magic} graph if there exist…

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

Application of the Combinatorial Nullstellensatz to magic-type graph labelings

Parikshit Chalise, Richard M. Low

Let $G = (V, E)$ be a simple graph, and let $k \geq 2$ be an integer. For an edge labeling $h : E (G) \to Z_{k} \ {0}$ , define the induced vertex label by \[ h^+(v)=\su…

Corrigendum to "A Characterization of the Unit Group in Z[T x C_2]"

All Polyominoes are C4​-face-magic

Floridian Solitaire: A New Variant of Bulgarian Solitaire

Application of the Combinatorial Nullstellensatz to magic-type graph labelings

All Polyominoes are $C_{4}$ -face-magic