Skip to content →

Category: featured

hints for micro-sudoku

As a
quick reply to last posts comment :

Another
interesting question: How many clues (numbers allready in the grid) do
we need a Sudoku puzzle to have in the beginning in order to obtain a
unique solution? Comment by A.R.Ray

At
least one student proved that in micro-Sudoku (on a 4×4 grid)
one needs just 4 hints to get any unique solution (and that 4 is
minimal). It is an application of the fact that the micro-Sudoku group
acts on the set of all solutions with just two orbits so one needs to
check just these two solutions…

Leave a Comment

micro-sudoku

One
cannot fight fashion… Following ones own research interest is a
pretty frustrating activity. Not only does it take forever to get a
paper refereed but then you have to motivate why you do these things
and what their relevance is to other subjects. On the other hand,
following fashion seems to be motivation enough for most…
Sadly, the same begins to apply to teaching. In my Geometry 101 course I
have to give an introduction to graphs&groups&geometry. So,
rather than giving a standard intro to graph-theory I thought it would
be more fun to solve all sorts of classical graph-problems (Konigsberger
bridges
, Instant
Insanity
, Gas-
water-electricity
, and so on…) Sure, these first year
students are (still) very polite, but I get the distinct feeling that
they think “Why on earth should we be interested in these old
problems when there are much more exciting subjects such as fractals,
cryptography or string theory?” Besides, already on the first day
they made it pretty clear that the only puzzle they are interested in is
Sudoku.
Next week I’ll have to introduce groups and I was planning to do
this via the Rubik
cube
but I’ve learned my lesson. Instead, I’ll introduce
symmetry by considering micro-
sudoku
that is the baby 4×4 version of the regular 9×9
Sudoku. The first thing I’ll do is work out the number of
different solutions to micro-Sudoku. Remember that in regular Sudoku
this number is 6,670,903,752,021,072,936,960 (by a computer search
performed by Bertram
Felgenhauer
). For micro-Sudoku there is an interesting
(but ratther confused) thread on the
Sudoku forum
and after a lot of guess-work the consensus seems to be
that there are precisely 288 distinct solutions to micro-Sudoku. In
fact, this is easy to see and uses symmetry. The symmetric group $S_4$
acts on the set of all solutions by permuting the four numbers, so one
may assume that a solution is in the form where the upper-left 2×2
block is 12 and 34 and the lower right 2×2 block consists of the
rows ab and cd. One quickly sees that either this leeds to a
unique solution or so does the situation with the roles of b and c
changed. So in all there are $4! \\times \\frac{1}{2} 4!=24 \\times 12 =
288$ distinct solutions. Next, one can ask for the number of
_essentially_ different solutions. That is, consider the action
of the _Sudoku-symmetry group_ (including things such as
permuting rows and columns, reflections and rotations of the grid). In
normal 9×9 Sudoku this number was computed by Ed Russell
and Frazer Jarvis
to be 5,472,730,538 (again,heavily using the
computer). For micro-Sudoku the answer is that there are just 2
essentially different solutions and there is a short nice argument,
given by ‘Nick70′ at the end of the above mentioned thread. Looking a bit closer one verifies easily that the
two Sudoku-group orbits have different sizes. One contains 96 solutions,
the other 192 solutions. It will be interesting to find out how these
calculations will be received in class next week…

One Comment

the Klein stack

Klein’s
quartic $X$is the smooth plane projective curve defined by
$x^3y+y^3z+z^3x=0$ and is one of the most remarkable mathematical
objects around. For example, it is a Hurwitz curve meaning that the
finite group of symmetries (when the genus is at least two this group
can have at most $84(g-1)$ elements) is as large as possible, which in
the case of the quartic is $168$ and the group itself is the unique
simple group of that order, $G = PSL_2(\mathbb{F}_7)$ also known as
Klein\’s group. John Baez has written a [beautiful page](http://math.ucr.edu/home/baez/klein.html) on the Klein quartic and
its symmetries. Another useful source of information is a paper by Noam
Elkies [The Klein quartic in number theory](www.msri.org/publications/books/Book35/files/elkies.pd).
The quotient map $X \rightarrow X/G \simeq \mathbb{P}^1$ has three
branch points of orders $2,3,7$ in the points on $\mathbb{P}^1$ with
coordinates $1728,0,\infty$. These points correspond to the three
non-free $G$-orbits consisting resp. of $84,56$ and $24$ points.
Now, remove from $X$ a couple of $G$-orbits to obtain an affine open
subset $Y$ such that $G$ acts on its cordinate ring $\mathbb{C}[Y]$ and
form the Klein stack (or hereditary order) $\mathbb{C}[Y] \bigstar G$,
the skew group algebra. In case the open subset $Y$ contains all
non-free orbits, the [one quiver](www.matrix.ua.ac.be/master/coursenotes/onequiver.pdf) of this
qurve has the following shape $\xymatrix{\vtx{} \ar@/^/[dd] \\
\\ \vtx{} \ar@/^/[uu]} $ $\xymatrix{& \vtx{} \ar[ddl] & \\
& & \\ \vtx{} \ar[rr] & & \vtx{} \ar[uul]} $ $\xymatrix{& &
\vtx{} \ar[dll] & & \\ \vtx{} \ar[d] & & & & \vtx{} \ar[ull] \\ \vtx{}
\ar[dr] & & & & \vtx{} \ar[u] \\ & \vtx{} \ar[rr] & & \vtx{} \ar[ur]
&} $ Here, the three components correspond to the three
non-free orbits and the vertices correspond to the isoclasses of simple
$\mathbb{C}[Y] \bigstar G$ of dimension smaller than $168$. There are
two such of dimension $84$, three of dimension $56$ and seven of
dimension $24$ which I gave the non-imaginative names \’twins\’,
\’trinity\’ and \’the dwarfs\’. As we want to spice up later this
Klein stack to a larger group, we need to know the structure of these
exceptional simples as $G$-representations. Surely, someone must have
written a paper on the general problem of finding the $G$-structure of
simples of skew-group algebras $A \bigstar G$, so if you know a
reference please let me know. I used an old paper by Idun Reiten and
Christine Riedtmann to do this case (which is easier as the stabilizer
subgroups are cyclic and hence the induced representations of their
one-dimensionals correspond to the exceptional simples).

Leave a Comment