Related papers: Higher-dimensional cubical sliding puzzles
Automatic assembly of apictorial jigsaw puzzles presents a classic curve matching problem, fundamentally challenged by discrete and noisy contour data obtained from digitization. Conventional smoothing methods, which are required to process…
Classical or quantum physical systems can simulate the Ising Hamiltonian for large-scale optimization and machine learning. However, devices such as quantum annealers and coherent Ising machines suffer an exponential drop in the probability…
We study the problem of determining whether a given frame is scalable, and when it is, understanding the set of all possible scalings. We show that for most frames this is a relatively simple task in that the frame is either not scalable or…
Composed of square particles, the tetratic phase is characterised by a four-fold symmetry with quasi-long-range orientational order but no translational order. We construct the elastic free energy for tetratics and find a closed form…
Dualities have been known to map space trusses and plate structures to each other since the 1980-s. Yet the computational similarity of the two has not been used to solve the unfamiliar plate structure with the methods of the well known…
Based on combinatorics, we evaluate the upper bounds for the number of solutions to spatially coupled Sudokus, which are popular logic puzzles.
We consider a puzzle such that a set of colored cubes is given as an instance. Each cube has unit length on each edge and its surface is colored so that what we call the Surface Color Condition is satisfied. Given a palette of six colors,…
We investigate the poset of skew diagrams ordered by adding or forming the union of skew diagrams. We will show that a skew diagram which has at least n convex corners to the upper left and also to the lower right is larger than the skew…
We study some methods of subgradient projections for solving a convex feasibility problem with general (not necessarily hyperplanes or half-spaces) convex sets in the inconsistent case and propose a strategy that controls the relaxation…
In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete…
From descent theory to higher geometry, the idea of gluing has been embedded in many elegant and powerful techniques, proving instrumental for the solution of many problems. In this paper, we introduce a framework that allows to link…
In this article, we revisit the complexity of the reconfiguration of independent sets under the token sliding rule on chordal graphs. In the \textsc{Token Sliding-Connectivity} problem, the input is a graph $G$ and an integer $k$, and the…
Time-dependent soliton solutions are explicitly derived in a five-dimensional theory endowed with one (warped) extra-dimension. Some of the obtained geometries, everywhere well defined and technically regular, smoothly interpolate between…
While sign-coherent 4-dimensional structures cannot dominate topological charge fluctuations in the QCD vacuum at all scales due to reflection positivity, it is possible that enhanced coherence exists over extended space-time regions of…
We introduce the idea that the P vs NP problem can have a finer structure. Given the NP complete problem of interest, the configurations space of the problem can be divided in (at least) two regions. In one region, polynomial algorithms to…
Motivated by the generation of action principles from off-shell dualisation, we present a general class of free, topological theories in three dimensional Minkowski spacetime that exhibit higher-spin gauge invariance. In the spin-two case,…
In this paper, we consider accessibility percolation on hypercubes, i.e., we place i.i.d. uniform [0,1] random variables on vertices of a hypercube, and study whether there is a path connecting two vertices such that the values of these…
A plethora of two-dimensional (2D) materials entered the physics and engineering scene in the last two decades. Their robust, membrane-like sheet permit -- mostly require -- deposition, giving rise to solid-solid dry interfaces whose bodily…
In this paper, we consider spin systems in three spatial dimensions, and prove that the local Hamiltonian problem for 3D lattices with face-centered cubic unit cells, 4-local translationally-invariant interactions between spin-3/2 particles…
A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertex-transitive and arc-transitive if its automorphism group acts transitively on its vertex-set and on its arc- set,…