相关论文: The Chaos Within Sudoku
We explore the capabilities of physical computing with Oscillatory Neural Networks (ONN) to solve combinatorial optimization problems. To solve Sudokus with ONNs, we define a novel mapping strategy that utilizes the unique characteristics…
The stability problem of a class of nonlinear switched systems defined on compact sets with state-dependent switching is considered. Instead of the Caratheodory solutions, the general Filippov solutions are studied. This encapsulates…
We reveal the escape mechanism of orbits in a Hamiltonian system with four exit channels composed of two-dimensional perturbed harmonic oscillators. We distinguish between trapped chaotic, non-escaping regular and escaping orbits by…
We consider overdetermined systems of difference equations for a single function $u$ which are consistent, and propose a general framework for their analysis. The integrability of such systems is defined as the existence of higher order…
The fast changing reality in technical and natural domains perceived by always more accurate observations has drawn attention on new and very broad class of systems with specific behaviour represented under the common wording complexity.…
A new class of semi-implicit numerical schemes for linear advection equation on Cartesian grids is derived that is inspired by so-called $\kappa$-schemes used with fully explicit discretizations for this type of problems. Opposite to fully…
Spatiotemporally chaotic dynamics of a Kuramoto-Sivashinsky system is described by means of an infinite hierarchy of its unstable spatiotemporally periodic solutions. An intrinsic parametrization of the corresponding invariant set serves as…
Building on the work of Fyodorov (2004) and Fyodorov and Nadal (2012) we examine the critical behaviour of population of saddles with fixed instability index $k$ in high dimensional random energy landscapes. Such landscapes consist of a…
There exist many Runge-Kutta methods (explicit or implicit), more or less adapted to specific problems. Some of them have interesting properties, such as stability for stiff problems or symplectic capability for problems with energy…
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related…
We study the time evolution of perturbations in spatially extended chaotic systems in the presence of quenched disorder. We find that initially random perturbations tend to exponentially localize in space around static pinning centers that…
We consider an infinite-range interacting quantum spin-1/2 model, undergoing periodic kicking and dissipatively coupled with an environment. In the thermodynamic limit, it is described by classical mean-field equations that can show regular…
Slowing down phenomena occur in both deterministic and stochastic dynamical systems at the vicinity of phase transitions or bifurcations. An example is found in systems exhibiting a saddle-node bifurcation, which undergo a dramatic time…
Neural networks have long been used to model human intelligence, capturing elements of behavior and cognition, and their neural basis. Recent advancements in deep learning have enabled neural network models to reach and even surpass human…
We investigate the impact of internal spin on chaos in billiard systems. Extending the standard point-particle billiard by coupling translational and rotational degrees of freedom through a dimensionless spin parameter $\alpha = I/(mr^2)…
Chaos, in quantum systems, can be diagnosed by certain out-of-time-order correlators (OTOCs) that obey the chaos bound of Maldacena, Shenker, and Stanford (MSS). We begin by deriving a dispersion relation for this class of OTOCs, implying…
We introduce the topological complexity of the work map associated to a robot system. In broad terms, this measures the complexity of any algorithm controlling, not just the motion of the configuration space of the given system, but the…
We study the phase diagram and the algorithmic hardness of the random `locked' constraint satisfaction problems, and compare them to the commonly studied 'non-locked' problems like satisfiability of boolean formulas or graph coloring. The…
In this paper we provide a formalism, Sudoku logic, in which a solution is logically deducible if for every cell of the grid we can provably exclude all but a single option. We prove that the deductive system of Sudoku logic is sound and…
Many of the famous single-player games, commonly called puzzles, can be shown to be NP-Complete. Indeed, this class of complexity contains hundreds of puzzles, since people particularly appreciate completing an intractable puzzle, such as…