Related papers: Shuffling algorithm for coupled tilings of the Azt…
The necklace splitting problem is a classic problem in fair division with many applications, including data-informed fair hash maps. We extend necklace splitting to a dynamic setting, allowing for relocation, insertion, and deletion of…
The main goal of the present paper is the construction of twisted generalized differential cohomology theories and the comprehensive statement of its basic functorial properties. Technically it combines the homotopy theoretic approach to…
We consider a problem of shuffling a deck of cards with ordered labels. Namely we split the deck of N=k^tq cards (where t>=1 is maximal) into k equally sized stacks and then take the top card off of each stack and sort them by the order of…
The first optical proposal for the realization of the two-bit version of the Deutsch-Jozsa algorithm [D. Deutsch and R. Jozsa, Proc. R. Soc. London A {\bf 493}, 553 (1992)] is presented. The proposal uses Stark shifts in an ensemble of…
We study kinetic Monte-Carlo (KMC) descriptions of active particles. By relying on large discrete time steps, KMC algorithms accelerate the relaxational dynamics of active systems towards their steady-state. We show, however, that their…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
A bipartite spin system is proposed for which a fast transfer from one defined state into another exists. For sufficient coupling between the spins, this implements a bit-flipping mechanism which is much faster than that induced by…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
We study the typical entanglement properties of a system comprising two independent qubit environments interacting via a shuttling ancilla. The initial preparation of the environments is modeled using random-matrix techniques. The…
The connection between matrix integrals and links is used to define matrix models which count alternating tangles in which each closed loop is weighted with a factor n, i.e. may be regarded as decorated with n possible colors. For n=2, the…
We consider tilings of the plane with 12-fold symmetry obtained by the cut and projection method. We compute their cohomology groups using the techniques introduced by the second author, Hunton and Kellendonk. To do this we completely…
This article builds on Thurston's height functions. His tiling algorithm is reinterpreted using lattice theory and then generalized in order to generate any tiling of a hole-free region. Combined with a natural encoding of tilings by words,…
Aperiodic tiling --- a form of complex global geometric structure arising through locally checkable, constant-time matching rules --- has long been closely tied to a wide range of physical, information-theoretic, and foundational…
We solve the equations of motion of a one-dimensional planar Heisenberg (or Vaks-Larkin) model consisting of a system of interacting macro-spins aligned along a ring. Each spin has unit length and is described by its angle with respect to…
Dynamical zeta functions are expected to relate the Schr\"odinger operator's spectrum to the periodic orbits of the corresponding fully chaotic Hamiltonian system. The relationsship is exact in the case of surfaces of constant negative…
A new approximate method to calculate exchange-correlation contributions in the framework of first-principles tight-binding molecular dynamics methods has been developed. In the proposed scheme on-site (off-site) exchange-correlation matrix…
We propose a statistical model defined on the three-dimensional diamond network where the splitting of randomly selected nodes leads to a spatially disordered network, with decreasing degree of connectivity. The terminal state, that is…
We consider the space of all representations of the commutator subgroup of a knot group into a finite abelian group {\Sigma}, together with a shift map {\sigma}_x. This is a finite dynamical system, introduced by D.Silver and S. Williams.…
Recently a cluster Monte Carlo algorithm has been used very successfully in the two-dimensional Edwards-Anderson (EA) model. We show that this algorithm and a variant thereof can also be used successfully in models with a non-zero spin…
To understand an aperiodic tiling (or a quasicrystal modeled on an aperiodic tiling), we construct a space of similar tilings, on which the group of translations acts naturally. This space is then an (abstract) dynamical system. Dynamical…