Return to Answer

In the general-size square Sudoku board, you have an $\kappa\times\kappa$ array of $\kappa\times\kappa$ local blocks for some (possibly infinite) cardinal $\kappa$. Every location on the Sudokou board has an address $(\alpha,\beta)$ in its local block, and the local block itself has coordinates $(\gamma,\delta)$. Thus, every location on the Sudoku board is specified by four coordinates: $$(\gamma,\delta,\alpha,\beta).$$ The boundaries between the local boards play no meaningful role. Every row, column and local block has size $\kappa^2$.

A Sudoku solution is a function $f:(\lambda\times\kappa)\times(\kappa\times\lambda)\to L$, where $L$ is the set of labels (of size $\lambda\times\kappa$) that obeys the three requirements:

• Every row is a bijection with $L$. So $f(\gamma,\delta,\alpha,\beta)$ is a bijection, if you fix $\delta<\kappa$ and $\beta<\lambda$.
• Every column is a bijection with $L$. So $f(\gamma,\delta,\alpha,\beta)$ is a bijection, if you fix $\gamma<\lambda$ and $\alpha<\kappa$.
• Every local board is a bijection with $L$. So $f(\gamma,\delta,\alpha,\beta)$ is a bijection, if you fix $\gamma<\lambda$ and $\delta<\kappa$.

Note that if $G$ is a group of size $\lambda$ and $H$ is a group of size $\kappa$, then we can use these groups as location coordinates, and define $f(g,h,h',g')=(gg',hh')$, taking $L=G\oplus H$ as the set of labels. This is a solution, because if you fix $h$ and $g'$, it is a bijection; and similarly if you fix $g$ and $h'$, or if you fix $g$ and $h$. So every assymmetric Sudoku board has a solution arising in this way. This answers a question asked by Gerhard in a comment on an earlier post.

In the group example, this extra condition corresponds to fixing $g'$ and $h'$, and this shows that any Sudoku solution arising from groups will indeed obey the extra requirement. However, one can easily find Sudoku solutions not fulfilling the extra requirement, and so these solutions cannot arise from groups in the way I described (e.g. perhaps the operation that they define is not associative). One can also find infinite solutions without the extra requirement, since the argument on my blog shows that any finite position not yet violating the Sudoku rules extends to a full solution on a countably infinite board. So one could start with two labels violating the extra requirement and extend it.

In the general-size square Sudoku board, you have an $\kappa\times\kappa$ array of $\kappa\times\kappa$ local blocks for some (possibly infinite) cardinal $\kappa$. Every location on the Sudokou board has an address $(\alpha,\beta)$ in its local block, and the local block itself has coordinates $(\gamma,\delta)$. Thus, every location on the Sudoku board is specified by four coordinates: $$(\alpha,\beta,\gamma,\delta).$$ This is (local address, global block coordinates). The boundaries between the local boards play no meaningful role. Every row, column and local block has size $\kappa^2$.

A Sudoku solution is a function $f:(\kappa\times\lambda)\times(\lambda\times\kappa)\to L$, where $L$ is the set of labels (of size $\lambda\times\kappa$) that obeys the three requirements:

• Every row is a bijection with $L$. So $f(\alpha,\beta,\gamma,\delta)$ is a bijection, if you fix $\delta<\kappa$ and $\beta<\lambda$.
• Every column is a bijection with $L$. So $f(\alpha,\beta,\gamma,\delta)$ is a bijection, if you fix $\gamma<\lambda$ and $\alpha<\kappa$.
• Every local board is a bijection with $L$. So $f(\alpha,\beta,\gamma,\delta)$ is a bijection, if you fix $\gamma<\lambda$ and $\delta<\kappa$.

Note that if $G$ is a group of size $\lambda$ and $H$ is a group of size $\kappa$, then we can use these groups as location coordinates, and define $f(h,g,g',h')=(gg',hh')$, taking $L=G\oplus H$ as the set of labels. This is a solution, because if you fix $g$ and $h'$, it is a bijection; and similarly if you fix $h$ and $g'$, or if you fix $g'$ and $h'$. So every assymmetric Sudoku board has a solution arising in this way. This answers a question asked by Gerhard in a comment on an earlier post.

In the group example, this extra condition corresponds to fixing $g$ and $h$, and this shows that any Sudoku solution arising from groups will indeed obey the extra requirement. However, one can easily find Sudoku solutions not fulfilling the extra requirement, and so these solutions cannot arise from groups in the way I described (e.g. perhaps the operation that they define is not associative). One can also find infinite solutions without the extra requirement, since the argument on my blog shows that any finite position not yet violating the Sudoku rules extends to a full solution on a countably infinite board. So one could start with two labels violating the extra requirement and extend it.

Thanks for you kind words about my blog.

In the general size square Sudoku board, you have an $\kappa\times\kappa$ array of $\kappa\times\kappa$ sub-arrays. I think of the local block as a kind of neighborhood, and every location in it having its local coordinates $(\alpha,\beta)$, for $\alpha,\beta<\kappa$. But we have the $\kappa\times\kappa$ array of those local boards, and so the whole local block has its own coordinates $(\gamma,\delta)$. Thus, every location on the Sudoku board is specified by giving the coordinates $(\gamma,\delta)$ of the neighborhood block and the local coordinates $(\alpha,\beta)$ within that block. So four coordinates in all $$(\gamma,\delta,\alpha,\beta)$$ The boundaries between the local boards play no meaningful role.

On the $\mathbb{Z}$-Sudoku board, for example, which I considered on my blog, we have a $\mathbb{Z}\times\mathbb{Z}$ array of $\mathbb{Z}\times\mathbb{Z}$ local boards, and there are no boundaries between these sub-boards.

Assymmetric Sudoku is somewhat more general, since it works with rectangular sub-boards. For any two cardinals $\kappa$ and $\lambda$, one may consider a $\lambda\times\kappa$ array of local boards with shape $\kappa\times\lambda$. Note that the order of the coordinates must swap, in order that the size of the rows and columns is the same (and the same as the size of the sub-boards. Think of a $6\times 6$ board as a $2\times 3$ array of $3\times 2$ matrices. In the general case, every location is specified by the coordinates $(\gamma,\delta)$ of the board, and the local coordinates $(\alpha,\beta)$ within that board, where now $\gamma,\beta<\lambda$ and $\delta,\alpha<\kappa$.

Actually, this way of thinking leads one to a fourth Sudoku-like condition, namely, requiring that $f(\gamma,\delta,\alpha,\beta)$ is a bijection when you fix $\alpha$ and $\beta$, which is the collection of locations, one per local block, each with the same local coordinates in those blocks. In the group example, this corresponds to fixing $g'$ and $h'$.

Thanks for your kind words about my blog.

In the general-size square Sudoku board, you have an $\kappa\times\kappa$ array of $\kappa\times\kappa$ local blocks for some (possibly infinite) cardinal $\kappa$. Every location on the Sudokou board has an address $(\alpha,\beta)$ in its local block, and the local block itself has coordinates $(\gamma,\delta)$. Thus, every location on the Sudoku board is specified by four coordinates: $$(\gamma,\delta,\alpha,\beta).$$ The boundaries between the local boards play no meaningful role. Every row, column and local block has size $\kappa^2$.

On the $\mathbb{Z}$-Sudoku board, for example, which I considered on my blog, we have a $\mathbb{Z}\times\mathbb{Z}$ array of $\mathbb{Z}\times\mathbb{Z}$ local boards. For example, each local $\mathbb{Z}\times\mathbb{Z}$ block has its own origin and its own address $(2,17)$ and so on. One needn't imagine any "boundaries" between the sub-boards.

Asymmetric Sudoku is somewhat more general, since it works with rectangular sub-boards, which may not be square. Indeed, for any two cardinals $\kappa$ and $\lambda$, one may consider a $\lambda\times\kappa$ array of local boards with shape $\kappa\times\lambda$. It is interesting to consider even the extreme case of a $1\times\kappa$ array of $\kappa\times 1$ blocks. Note that the order of the coordinates must swap, in order that the size of the rows and columns is the same, and the same as the size of the local blocks, since the Sudoku conditions require these to form bijections with the set of labels. Think of a $6\times 6$ board as a $2\times 3$ array of $3\times 2$ matrices. In the general case, every location is specified by the coordinates $(\gamma,\delta)$ of the board, and the address $(\alpha,\beta)$ within that local block, where now $\gamma,\beta<\lambda$ and $\delta,\alpha<\kappa$.

Actually, this way of thinking leads one to a fourth Sudoku-like condition, namely, requiring that $f(\gamma,\delta,\alpha,\beta)$ is a bijection when you fix $\alpha$ and $\beta$, which is the collection of locations, one per local block, each with the same local coordinates in those blocks. For example, the labels appearing in all the locations with local address $(2,17)$, over all the local blocks, would have to be a bijection with $L$.

In the group example, this extra condition corresponds to fixing $g'$ and $h'$, and this shows that any Sudoku solution arising from groups will indeed obey the extra requirement. However, one can easily find Sudoku solutions not fulfilling the extra requirement, and so these solutions cannot arise from groups in the way I described (e.g. perhaps the operation that they define is not associative). One can also find infinite solutions without the extra requirement, since the argument on my blog shows that any finite position not yet violating the Sudoku rules extends to a full solution on a countably infinite board. So one could start with two labels violating the extra requirement and extend it.

Thanks for you kind words about my blog.

In the general size square Sudoku board, you have an $\kappa\times\kappa$ array of $\kappa\times\kappa$ sub-arrays. I think of the local block as a kind of neighborhood, and every location in it having its local coordinates $(\alpha,\beta)$, for $\alpha,\beta<\kappa$. But we have the $\kappa\times\kappa$ array of those local boards, and so the whole local block has its own coordinates $(\gamma,\delta)$. Thus, every location on the Sudoku board is specified by giving the coordinates $(\gamma,\delta)$ of the neighborhood block and the local coordinates $(\alpha,\beta)$ within that block. So four coordinates in all $$(\gamma,\delta,\alpha,\beta)$$ The boundaries between the local boards play no meaningful role.

On the $\mathbb{Z}$-Sudoku board, for example, which I considered on my blog, we have a $\mathbb{Z}\times\mathbb{Z}$ array of $\mathbb{Z}\times\mathbb{Z}$ local boards, and there are essentially no boundaries between these sub-boards.

Assymmetric Sudoku is somewhat more general, since it works with rectangular sub-boards. For any two cardinals $\kappa$ and $\lambda$, one may consider a $\lambda\times\kappa$ array of local boards with shape $\kappa\times\lambda$. Thus, again, every location is specified by the coordinates $(\gamma,\delta)$ of the board, and the local coordinates $(\alpha,\beta)$ within that board, where now $\gamma,\beta<\lambda$ and $\delta,\alpha<\kappa$.

A Sudoku solution is a function $f:(\lambda\times\kappa)\times(\kappa\times\lambda)\to L$, where $L$ is the set of labels (of size $\lambda\times\kappa$) that obeys the three requirements:

• Every row is a bijection with $L$. So $f(\gamma,\delta,\alpha,\beta)$ is a bijection, if you fix $\delta<\kappa$ and $\beta<\lambda$.
• Every column is a bijection with $L$. So $f(\gamma,\delta,\alpha,\beta)$ is a bijection, if you fix $\gamma<\lambda$ and $\alpha<\kappa$.
• Every local board is a bijection with $L$. So $f(\gamma,\delta,\alpha,\beta)$ is a bijection, if you fix $\gamma<\lambda$ and $\delta<\kappa$.

Note that if $G$ is a group of size $\lambda$ and $H$ is a group of size $\kappa$, then we can use these groups as location coordinates, and define $f(g,h,h',g')=(gg',hh')$, taking $L=G\oplus H$ as the set of labels. This is a solution, because if you fix $h$ and $g'$, it is a bijection; and similarly if you fix $g$ and $h'$, or if you fix $g$ and $h$. So every assymmetric Sudoku board has a solution arising in this way. This answers a question asked by Gerhard in a comment on an earlier post.

Actually, this way of thinking leads one to a fourth Sudoku-like condition, namely, requiring that $f(\gamma,\delta,\alpha,\beta)$ is a bijection when you fix $\alpha$ and $\beta$, which is the collection of locations, one per local block, each with the same local coordinates in those blocks. In the group example, this corresponds to fixing $g'$ and $h'$.

Thanks for you kind words about my blog.

In the general size square Sudoku board, you have an $\kappa\times\kappa$ array of $\kappa\times\kappa$ sub-arrays. I think of the local block as a kind of neighborhood, and every location in it having its local coordinates $(\alpha,\beta)$, for $\alpha,\beta<\kappa$. But we have the $\kappa\times\kappa$ array of those local boards, and so the whole local block has its own coordinates $(\gamma,\delta)$. Thus, every location on the Sudoku board is specified by giving the coordinates $(\gamma,\delta)$ of the neighborhood block and the local coordinates $(\alpha,\beta)$ within that block. So four coordinates in all $$(\gamma,\delta,\alpha,\beta)$$ The boundaries between the local boards play no meaningful role.

On the $\mathbb{Z}$-Sudoku board, for example, which I considered on my blog, we have a $\mathbb{Z}\times\mathbb{Z}$ array of $\mathbb{Z}\times\mathbb{Z}$ local boards, and there are no boundaries between these sub-boards.

Assymmetric Sudoku is somewhat more general, since it works with rectangular sub-boards. For any two cardinals $\kappa$ and $\lambda$, one may consider a $\lambda\times\kappa$ array of local boards with shape $\kappa\times\lambda$. Note that the order of the coordinates must swap, in order that the size of the rows and columns is the same (and the same as the size of the sub-boards. Think of a $6\times 6$ board as a $2\times 3$ array of $3\times 2$ matrices. In the general case, every location is specified by the coordinates $(\gamma,\delta)$ of the board, and the local coordinates $(\alpha,\beta)$ within that board, where now $\gamma,\beta<\lambda$ and $\delta,\alpha<\kappa$.

A Sudoku solution is a function $f:(\lambda\times\kappa)\times(\kappa\times\lambda)\to L$, where $L$ is the set of labels (of size $\lambda\times\kappa$) that obeys the three requirements:

• Every row is a bijection with $L$. So $f(\gamma,\delta,\alpha,\beta)$ is a bijection, if you fix $\delta<\kappa$ and $\beta<\lambda$.
• Every column is a bijection with $L$. So $f(\gamma,\delta,\alpha,\beta)$ is a bijection, if you fix $\gamma<\lambda$ and $\alpha<\kappa$.
• Every local board is a bijection with $L$. So $f(\gamma,\delta,\alpha,\beta)$ is a bijection, if you fix $\gamma<\lambda$ and $\delta<\kappa$.

Note that if $G$ is a group of size $\lambda$ and $H$ is a group of size $\kappa$, then we can use these groups as location coordinates, and define $f(g,h,h',g')=(gg',hh')$, taking $L=G\oplus H$ as the set of labels. This is a solution, because if you fix $h$ and $g'$, it is a bijection; and similarly if you fix $g$ and $h'$, or if you fix $g$ and $h$. So every assymmetric Sudoku board has a solution arising in this way. This answers a question asked by Gerhard in a comment on an earlier post.

Actually, this way of thinking leads one to a fourth Sudoku-like condition, namely, requiring that $f(\gamma,\delta,\alpha,\beta)$ is a bijection when you fix $\alpha$ and $\beta$, which is the collection of locations, one per local block, each with the same local coordinates in those blocks. In the group example, this corresponds to fixing $g'$ and $h'$.