Related papers: A Necessary Solution Condition for Sudoku
Von Neumann established that discretized algebraic equations must be consistent with the differential equations, and must be stable in order to obtain convergent numerical solutions for the given differential equations. The "stability" is…
Sliced Sudoku-based space-filling designs and, more generally, quasi-sliced orthogonal array-based space-filling designs are useful experimental designs in several contexts, including computer experiments with categorical in addition to…
We consider a singular fractional differential equation involving generalized Katugampola derivative and obtain the existence and uniqueness of its solution. A scheme for uniformly approximating solution is constructed by using Picard…
The mathematical aspects of the popular logic game Sudoku incorporate a significant number of the group theory concepts. In this note, we describe all symmetric transformations of the Sudoku grid. We do not intend to obtain a new strategy…
The problem of discretization of Darboux integrable equations is considered. Given a Darboux integrable continuous equation, one can obtain a Darboux integrable differential-discrete equation, using the integrals of the continuous equation.…
Recently, sufficient conditions of stability or instability for time-delay systems have been proven to be necessary. In this way, a remarkable necessary and sufficient condition has then been developed by Gomez et al. It is presented as a…
In work the numerical solutions of Kundu-Eckhaus equation are presented. The conditions of dominate nonlinearity or disperse are cleared up.
Su-Doku, a popular combinatorial puzzle, provides an excellent testbench for heuristic explorations. Several interesting questions arise from its deceptively simple set of rules. How many distinct Su-Doku grids are there? How to find a…
Based on combinatorics, we evaluate the upper bounds for the number of solutions to spatially coupled Sudokus, which are popular logic puzzles.
We establish both sufficient and necessary conditions for weighted Hardy inequalities in metric spaces in terms of Assouad (co)dimensions. Our sufficient conditions in the case where the complement is thin are new even in Euclidean spaces,…
We provide several algorithms for the exact, uniform random sampling of Latin squares and Sudoku matrices via probabilistic divide-and-conquer (PDC). Our approach divides the sample space into smaller pieces, samples each separately, and…
In this paper, we establish a necessary condition for the logarithmic Minkowski problem in higher dimensions. This result generalizes a necessary condition proposed by Liu, Lu, Sun, and Xiong in their investigation of the two-dimensional…
A latin square of order $n$ with pairwise disjoint subsquares of orders $h_1,\dots,h_k$ such that $h_1+\dots+h_k = n$ is known as a realization. The existence of realizations is a partially solved problem with a few general results for an…
This paper is concerned with the popular Sudoku problem. We proposed a warm restart strategy for solving Sudoku puzzles, based on the sparse optimization technique. Furthermore, we defined a new difficulty level for Sudoku puzzles. The…
A general sufficient condition for the convergence of subsequences of solutions of non-autonomous, nonlinear difference equations and systems is obtained. For higher order equations the delay sizes and patterns play essential roles in…
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 Sudoku puzzle, I propose two new metrics to characterize Sudoku…
The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z}^d$ which tiles that lattice by translations, in fact tiles periodically. In this work we disprove this conjecture for sufficiently large $d$, which also…
We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers,…
In this work, for an equation of high even order with a fractional derivative in the sense of Caputo, a problem is studied in a rectangular domain with conjugation conditions. A criterion for the uniqueness of a solution is given. The…
This paper presents a comparative analysis of Sudoku-solving strategies, focusing on recursive backtracking and a heuristic-based constraint propagation method. Using a dataset of 500 puzzles across five difficulty levels (Beginner to…