Quasiperiodicity and randomness in tilings of the plane

We define new tilings of the plane with Robinson triangles, by means of generalized inflation rules, and study their Fourier spectrum. Penrose's matching rules are not obeyed; hence the tilings exhibit new local environments, such as three different bond lengths, as well as new patterns at all length scales. Several kinds of such generalized tilings are considered. A large class of deterministic tilings, including chiral tilings, is strictly quasiperiodic, with a tenfold rotationally symmetric Fourier spectrum. Random tilings, either locally (with extensive entropy) or globally random (without extensive entropy), exhibit a mixed (discrete+continuous) diffraction spectrum, implying a partial perfect long-range order.     

Comparing different versions of tiling cohomology

We establish direct isomorphisms between different versions of tiling cohomology. The first version is the direct limit of the cohomologies of the approximants in the Anderson-Putnam-Gähler system, the second is the recently introduced PV-cohomology of Savinien and Bellissard and the third is pattern equivariant cohomology. For the last two versions one can define weak cohomology groups. We show that the isomorphisms extend to the weak versions. This leads to an alternative formulation of the pattern equivariant mixed quotient group which describes deformations of the tiling modulo topological conjugacy.     

Classical Lattice-Gas Models of Quasicrystals

One of the fundamental problems of quasicrystals is to understand their occurrence in microscopic models of interacting particles. We review here recent attempts to construct stable quasicrystalline phases. In particular, we compare two recently constructed classical lattice-gas models with translation-invariant interactions and without periodic ground-state configurations. The models are based on nonperiodic tilings of the plane by square-like tiles. In the first model, all interactions can be minimized simultaneously. The second model is frustrated; its nonperiodic ground state can arise only by the minimization of the energy of competing interactions. We put forward some hypotheses concerning stabilities of nonperiodic ground states. In particular, we introduce two criteria, the so-called strict boundary conditions, and prove their equivalence to the zero-temperature stability of ground states against small perturbations of potentials of interacting particles. We discuss the relevance of these conditions for the low-temperature stability, i.e., for the existence of thermodynamically stable nonperiodic equilibrium states.     

Convexes Hyperboliques et Quasiisométries

For any m ≥ 3, we construct properly convex open sets Ω in the real projective space whose Hilbert metric is Gromov hyperbolic but is not quasiisometric to the hyperbolic space . We show that such examples cannot exist for m = 2. Some of our examples are divisible, i.e. there exists a discrete group Г of projective transformations preserving Ω with a compact quotient Г\Ω. The open set Ω is strictly convex but the group Г is not isomorphic to any cocompact lattice in the isometry group of .     

Friezes

The construction of friezes is motivated by the theory of cluster algebras. It gives, for each acyclic quiver, a family of integer sequences, one for each vertex. We conjecture that these sequences satisfy linear recursions if and only if the underlying graph is a Dynkin or an Euclidean (affine) graph. We prove the “only if” part, and show that the “if” part holds true for all non-exceptional Euclidean graphs, leaving a finite number of finite number of cases to be checked. Coming back to cluster algebras, the methods involved allow us to give formulas for the cluster variables in case Am and ; the novelty is that these formulas use 2 by 2 matrices over the semiring of Laurent polynomials generated by the initial variables (which explains simultaneously positivity and the Laurent phenomenon). One tool involved consists of the SL₂-tilings of the plane, which are particular cases of T-systems of Mathematical Physics.     

An Ultimate Frustration in Classical Lattice-Gas Models

A classical lattice-gas model is called frustrated if not all of its interactions can attain their minima simultaneously. The antiferromagnetic Ising model on the triangular lattice is a standard example.^{(1, 29)} However, in all such models known so far, one could always find nonfrustrated interactions having the same ground-state configurations. Here we constructed a family of classical lattice-gas models with finite-range, translation-invariant, frustrated interactions and with unique ground-state measures which are not unique ground-state measures of any finite-range, translation-invariant, nonfrustrated interactions.Our ground-state configurations are two-dimensional analogs of one-dimensional, most homogeneous,⁽¹³⁾ nonperiodic ground-state configurations of infinite-range, convex, repulsive interactions in models with devil's staircases.Our models are microscopic (toy) models of quasicrystals which cannot be stabilized by matching rules alone; competing interactions are necessary.     

Combinatoric enumeration of two-dimensional proper arrays

An n×mproper array is a two-dimensional rectangular array composed of directed cubes that obey certain constraints. Because of these constraints, the n×m proper arrays may be classified via a schema in which each n×m proper array is associated with a particular n×1 column. For a fixed n, the goal is to enumerate, modulo symmetry, all possible edge configurations associated with n×m proper arrays. By varying n, one constructs four combinatoric sequences, each of which enumerates a particular class of edge configurations. Convolution arguments and resultant calculations associate these sequences with cubic equations. These cubic equations allow one to predict M_n, the number of edge configurations, modulo symmetry, associated with n×m proper arrays.     

Towards a Characterization of Self-Similar Tilings in Terms of Derived Voronoï Tessellations

In this paper, a technique for analyzing levels of hierarchy in a tiling of Euclidean space is presented. Fixing a central configuration P of tiles in , a `derived Voronoï' tessellation _P is constructed based on the locations of copies of P in . A family of derived Voronoï tilings is formed by allowing the central configurations to vary through an infinite number of possibilities. The family will normally be an infinite one, but we show that for a self-similar tiling it is finite up to similarity. In addition, we show that if the family is finite up to similarity, then is pseudo-self-similar. The relationship between self-similarity and pseudo-self-similarity is not well understood, and this is the obstruction to a complete characterization of self-similarity via our method. A discussion and conjecture on the connection between the two forms of hierarchy for tilings is provided.     

On Perfect Codes and Related Concepts

The concept of diameter perfect codes, which seems to be a natural generalization of perfect codes (codesattaining the sphere–packing bound) is introduced. This was motivated by the code–anticode bound of Delsartein distance regular graphs. This bound in conjunction with the recent complete solutions of diametric problems in the Hamming graph _q(n) and the Johnson graph J(n,k)gives a sharpening of the sphere–packing bound. Some necessaryconditions for the existence of diameter perfect codes are given.In the Hamming graph all diameter perfect codes over alphabetsof prime power size are characterized. The problem of tilingof the vertex set of J(n,k) with caps (and maximalanticodes) is also examined.