17 August 2023 in Communications Physics
Artificial spin-ices consist of lithographic arrays of single-domain magnetic nanowires organised into frustrated lattices. These geometries are usually two-dimensional, allowing a direct exploration of physics associated with frustration, topology and emergence. Recently, three-dimensional geometries have been realised, in which transport of emergent monopoles can be directly visualised upon the surface. Here we carry out an exploration of the three-dimensional artificial spin-ice phase diagram, whereby dipoles are placed within a diamond-bond lattice geometry. We find a rich phase diagram, consisting of a double-charged monopole crystal, a single-charged monopole crystal and conventional spin-ice with pinch points associated with a Coulomb phase. In experimental demagnetised systems, broken symmetry forces formation of ferromagnetic stripes upon the surface, forbidding the lower energy double-charged monopole crystal. Instead, we observe crystallites of single magnetic charge, superimposed upon an ice background. The crystallites are found to form due to the distribution of magnetic charge around the 3D vertex, which locally favours monopole formation.
18 June 2024 in Physical Review B
The decades-long search for a shape that tiles the plane only aperiodically under translations and rotations recently ended with the discovery of the “spectre” aperiodic monotile. In this setting we study the dimer model, in which dimers are placed along tile edges such that each vertex meets precisely one dimer. The complexity of the tiling combines with the dimer constraint to allow an exact solution to the model. The partition function is where is the number of “mystic” tiles. We exactly solve the quantum dimer (Rokhsar-Kivelson) model in the same setting by identifying an eigenbasis at all interaction strengths . We find that test monomers, once created, can be infinitely separated at zero energy cost for all , constituting a deconfined phase in a -dimensional bipartite quantum dimer model.
10 July 2024 in Physical Review X
We provide a simple algorithm for constructing Hamiltonian graph cycles (visiting every vertex exactly once) on a set of arbitrarily large finite subgraphs of aperiodic two-dimensional Ammann-Beenker (AB) tilings. Using this result, and the discrete scale symmetry of AB tilings, we find exact solutions to a range of other problems which lie in the complexity class NP-complete for general graphs. These include the equal-weight traveling salesperson problem, providing, for example, the most efficient route a scanning tunneling microscope tip could take to image the atoms of physical quasicrystals with AB symmetries; the longest path problem, whose solution demonstrates that collections of flexible molecules of any length can adsorb onto AB quasicrystal surfaces at density one, with possible applications to catalysis; and the three-coloring problem, giving ground states for the -state Potts model () of magnetic interactions defined on the planar dual to AB, which may provide useful models for protein folding.