Related papers: Division sudokus: Invariants, enumeration and mult…
A symmetry group for Sudoku is complete if its action partitions the set of Sudoku boards into all possible orbits, and minimal if no group of smaller size would do the same. Previously, for a 4 x 4 Sudoku variation known as Shidoku, the…
We use a variation of the Circle Method, along with the Saddle Point Method, to obtain an asymptotic formula for the number of partitions of a number n into integers which are sums of two squares. Unlike previous work on partitions into…
Uniform random generation of Latin squares is a classical problem. In this paper we prove that both Latin squares and Sudoku designs are maximum cliques of properly defined graphs. We have developed a simple algorithm for uniform random…
We study 4-by-4 squares formed by cards from the EvenQuads deck. EvenQuads is a card game with 64 cards where cards have 3 attributes with 4 values in each attribute. A quad is four cards with all attributes the same, all different, or half…
Two $n \times n$ Latin squares $L_1, L_2$ are said to be orthogonal if, for every ordered pair $(x,y)$ of symbols, there are coordinates $(i,j)$ such that $L_1(i,j) = x$ and $L_2(i,j) = y$. A $k$-MOLS is a sequence of $k$…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
We study partitions of totally positive integers in real quadratic fields. We develop an algorithm for computing the number of partitions, prove a result about the parity of the partition function, and characterize the quadratic fields such…
Calculations of the number of equivalence classes of Sudoku boards has to this point been done only with the aid of a computer, in part because of the unnecessarily large symmetry group used to form the classes. In particular, the…
Based on combinatorics, we evaluate the upper bounds for the number of solutions to spatially coupled Sudokus, which are popular logic puzzles.
For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…
We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…
The division between two vectors belonging to the same vector space is obtained by elementary procedures of vector algebra and is defined by a matrix. This representation is obtained for two and three dimensional vector spaces. A new vector…
We give a computer-based proof of the following fact: If a square is divided into seven or nine convex polygons, congruent among themselves, then the tiles are rectangles.
One presents many Concatenated and Operation Sequences, P-Q Relationships, Digital Sequences, Magic Squares, Prime Conjectures, k-Divisibility and Strong Divisibility Sequences, Geometric Conjectures, Proposed problems.
We define a magic square to be a square matrix whose entries are nonnegative integers and whose rows, columns, and main diagonals sum up to the same number. We prove structural results for the number of such squares as a function of the…
This paper presents a novel construction method for symmetric Sudoku-type games based on Lee distance perfect codes and diameter perfect codes. The proposed method utilizes the tiling property of these codes to define the structure of the…
In order to use quantum devices for computations, it is necessary to understand the intricacies of the theoretical description. To this end, we provide several novel constructions useful for the comprehension of quantum mechanics from the…
Conjugation spaces are topological spaces equipped with an involution such that their fixed points have the same mod $2$ cohomology (as a graded vector space, a ring, and even an unstable algebra) but with all degrees divided by two,…
Do you want to know what an anti-chiece Latin square is? Or what a non-consecutive toroidal modular Latin square is? We invented a ton of new types of Latin squares, some inspired by existing Sudoku variations. We can't wait to introduce…
Given a partition $h_1+h_2+\dots+h_k = n$, a latin square of order $n$ with pairwise disjoint subsquares of orders $h_1,\dots ,h_k$ is called a realization. When the values $h_i$ are of at most two sizes, the existence of a realization has…