相关论文: The Chaos Within Sudoku
Different aspects of the predictability problem in dynamical systems are reviewed. The deep relation among Lyapunov exponents, Kolmogorov-Sinai entropy, Shannon entropy and algorithmic complexity is discussed. In particular, we emphasize…
We investigate the dynamics of chaotic trajectories in simple yet physically important Hamiltonian systems with non-hierarchical borders between regular and chaotic regions with positive measures. We show that the stickiness to the border…
Cycling chaos is a heteroclinic connection between several chaotic attractors, at which switching between the chaotic sets occur at growing time intervals. Here we characterize the coherence properties of these switchings, considering…
Based on a previous generalization by the author of Latin squares to Latin boards, this paper generalizes partial Latin squares and related objects like partial Latin squares, completable partial Latin squares and Latin square puzzles. The…
In combinatorial reconfiguration, the reconfiguration problems on a vertex subset (e.g., an independent set) are well investigated. In these problems, some tokens are placed on a subset of vertices of the graph, and there are three natural…
This paper proves that push-pull block puzzles in 3D are PSPACE-complete to solve, and push-pull block puzzles in 2D with thin walls are NP-hard to solve, settling an open question by Zubaran and Ritt. Push-pull block puzzles are a type of…
The 15 puzzle is a classic reconfiguration puzzle with fifteen uniquely labeled unit squares within a $4 \times 4$ board in which the goal is to slide the squares (without ever overlapping) into a target configuration. By generalizing the…
The sequences, given by a 7D map have been analysed by means of the methods, widely used to detect chaos in the real world in order to test their sensitivity to chaotic features of a non-linear system determined by comparatively high number…
We investigate the extent to which the probabilistic properties of a chaotic scattering system with dissipation can be understood from the properties of the dissipation-free system. For large energies $E$, a fully chaotic scattering leads…
What is chaos? Despite several decades of research on this ubiquitous and fundamental phenomenon there is yet no agreed-upon answer to this question. Recently, it was realized that all stochastic and deterministic differential equations,…
Recent progress toward classifying low-dimensional chaos measured from time series data is described. This classification theory assigns a template to the time series once the time series is embedded in three dimensions. The template…
We investigate circuit complexity to characterize chaos in multiparticle quantum systems. In the process, we take a stride to analyze open quantum systems by using complexity. We propose a new diagnostic of quantum chaos from complexity…
The generalised Sudoku problem with $N$ symbols is known to be NP-complete, and hence is equivalent to any other NP-complete problem, even for the standard restricted version where $N$ is a perfect square. In particular, generalised Sudoku…
A central question in dynamics is whether the topology of a system determines its geometry. This is known as rigidity. Under mild topological conditions rigidity holds for many classical cases, including: Kleinian groups, circle…
In this paper, we revisit the well-known perturbed Duffing system and investigate its chaotic dynamics by means of numerical Runge--Kutta method based on topological horseshoe theory. Precisely, we investigate chaos through the topological…
In this Part II, we apply the general theory developed in Part I to a detailed analysis of the Constraint Satisfaction Problem (CSP). We show how specific types of resolution rules can be defined. In particular, we introduce the general…
Jigsaw puzzle solving is an intriguing problem which has been explored in computer vision for decades. This paper focuses on a specific variant of the problem - solving puzzles with eroded boundaries. Such erosion makes the problem…
The concept of statistical complexity is studied to characterize the classical kicked top model which plays important role in the qbit systems and the chaotic properties of the entanglement. This allows us to understand this driven…
Chaotic dynamics can be quite heterogeneous in the sense that in some regions the dynamics are unstable in more directions than in other regions. When trajectories wander between these regions, the dynamics is complicated. We say a chaotic…
We show that single-digit "Nishio" subproblems in nxn Sudoku puzzles may be solved in time o(2^n), faster than previous solutions such as the pattern overlay method. We also show that single-digit deduction in Sudoku is NP-hard.