Arman Eisenkolb-Vaithyanathan

collaborators

2 papers

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…

cs.AI2025

Project Patti: Why can You Solve Diabolical Puzzles on one Sudoku Website but not Easy Puzzles on another Sudoku Website?

Arman Eisenkolb-Vaithyanathan

In this paper we try to answer the question "What constitutes Sudoku difficulty rating across different Sudoku websites?" Using two distinct methods that can both solve every Sudok…

All Polyominoes are C4​-face-magic

Project Patti: Why can You Solve Diabolical Puzzles on one Sudoku Website but not Easy Puzzles on another Sudoku Website?

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