Abstract. Unlike the (classical) Kolakoski sequence on the alphabet {1, 2}, its analogue on {1, 3} can be related to a primitive substitution rule. Using this connection, we prove that the corresponding biinfinite fixed point is a regular generic model set and thus has a pure point diffraction spectrum. The Kolakoski-(3, 1) sequence is then obtained as a deformation, without losing the pure point diffraction property.

This study contrasts the pattern of low-frequency (LF) and high-frequency (HF) climate variability in the eastern Caribbean. A low-pass Butterworth filter is used to study oscillations in rainfall and regional SST on time scales of greater and less than 8 yr in the period 1901–2002. The results show that the southern and northern Antilles are dominated by HF variability, whereas rainfall fluctuations in the eastern Antilles oscillate at quasi-decadal periods over the 102-yr record. In the southern Antilles, the HF rainfall signal derives from a late-summer response to the ENSO phase: warm and dry versus cool and wet. In the northern Antilles, the HF signal relates to a combination of an ENSO and North Atlantic Oscillation (NAO) phase: a warm ENSO and a negative NAO bring wetter conditions, while a cool ENSO and a positive NAO bring drier conditions. The early rainfall LF signal in SST is characterized by a dipole between the North Atlantic and South Atlantic and is associated with cross-equatorial winds that promote convection in the Caribbean. The study analyzes the upper-ocean structure—in particular, a low (high) salinity signal in the tropical North Atlantic (North Pacific) that relates to LF (HF) climate variability.

The freezing of argon in silica powder is observed to generate bands of pure solid argon in the same manner as in the phenomenon of ice lens formation in the freezing of moist ground. A first principles dynamical theory describes the mechanism of lens formation by the thermomolecular pressure-driven flow of interfacially melted films at the lens-solid boundary.

Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R d , consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the number of iterations needed. The main tool is a simple algorithm for computing modular coincidences, which is essentially a generalization of the Dekking coincidence to more than one dimension, and the proof of equivalence of this generalized Dekking coincidence and modular coincidence. As a consequence, we also obtain some conditions for the existence of modular coincidences. In a separate section, and throughout the article, a number of examples are given.

No abstract