Local Rules and Global Order, Or Aperiodic Tilings

Durand, Bruno; Levin, Leonid; Shen, Alexander
January 2005
Mathematical Intelligencer;Winter2005, Vol. 27 Issue 1, p64
Academic Journal
The article focuses on the Berger theorem on aperiodic tilings in mathematics. The theorem was proved by R. Burger in 1966. In 1971 the proof was simplified by R. Robininson, who invented the well-known "Robinson Tiles" that can tile the entire planet but only in an aperiodic way. Since then many similar constructions have been invented, some other proofs were based on different ideas. Defination of configuration, the Aperiodic Tilings theorem, substitute mapping and other details are included in the article.


Related Articles

  • MEASURING THE QUALITY OF APPROXIMATE SOLUTIONS TO ZERO-ONE PROGRAMMING PROBLEMS. Zemel, Eitan // Mathematics of Operations Research;Aug81, Vol. 6 Issue 3, p319 

    We point out the difficulties associated with measuring the quality of an approximate (heuristic) solution by "Percentage-Error" as is customary. We define a set of properties that are to be expected from a proper measure of solution quality and investigate the family of functions which satisfy...

  • An Algorithm for Optimizing Over the Efficient Set of Multiple Objective Affine Fractional Problem.  // Vietnam Journal of Mathematics;Dec2001, Vol. 29 Issue 4, p331 

    Proposes a decomposition algorithm for solving a multiple objective affine fractional mathematical programming problem. Branch-and-bound procedure taking into account affine fractionality of the criterion functions; Minimization of biconvex function; Use of Lagrangian bounding operation and a...

  • monotone convergence theorem (early 20th century) Mathematics.  // Dictionary of Theories;2002, p351 

    Information on the monotone convergence theorem is presented. The theorem was proved by French mathematician Henri-Leon Lebesgue for the case where the limit function is integrable. The theorem is an increasing sequence of non-integrable measurable functiond which converghes almost everywhere to...

  • Aperiodic Tilings with One Prototile and Low Complexity Atlas Matching Rules. Fletcher, D. // Discrete & Computational Geometry;Sep2011, Vol. 46 Issue 2, p394 

    We give a constructive method that can decrease the number of prototiles needed to tile a space. We achieve this by exchanging edge-to-edge matching rules for a small atlas of permitted patches. This method is illustrated with Wang tiles, and we apply our method to present via these rules a...

  • Aperiodicity in Equilibrium Systems: Between Order and Disorder. VAN ENTER, A. C. D. // Acta Physica Polonica, A.;Aug2014, Vol. 126 Issue 2, p621 

    Spatial aperiodicity occurs in various models and materials. Although today the most well-known examples occur in the area of quasicrystals, other applications might also be of interest. Here we discuss some issues related to the notion and occurrence of aperiodic order in equilibrium...

  • Subgradient of distance functions with applications to Lipschitzian stability. Mordukhovich, Boris S.; Nguyen Mau Nam // Mathematical Programming;Oct2005, Vol. 104 Issue 2/3, p635 

    The paper is devoted to studying generalized differential properties of distance functions that play a remarkable role in variational analysis, optimization, and their applications. The main object under consideration is the distance function of two variables in Banach spaces that signifies the...

  • Optimality Conditions in Nondifferentiable G-Invex Multiobjective Programming. Ho Jung Kim; You Young Seo; Do Sang Kim // Journal of Inequalities & Applications;2010, Vol. 2010, p1 

    We consider a class of nondifferentiable multiobjective programs with inequality and equality constraints in which each component of the objective function contains a term involving the support function of a compact convex set.We introduce G-Karush-Kuhn-Tucker conditions and GFritz John...

  • OPTIMAL VALUE FUNCTION.  // Encyclopedia of Operations Research & Management Science;2001, p589 

    A definition of the term "optimal value function" is presented. The optimal value of a mathematical programming problem as a function of problem parameters, such as objective function coefficients.

  • intermediate value theorem (19th century) Mathematics.  // Dictionary of Theories;2002, p281 

    Information on the "intermediate value theorem," related to mathematics is presented. It is also known as Boizano's theorem, named after Czech analyst Bernhard Boizano. It is explained as the result whereby a real function f which is continuous on (a,b) takes every value between f(a) and f(b)...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics