|
Domino Tiling
In geometry, a domino tiling of a region in the Euclidean plane is a tessellation of the region by dominoes, shapes formed by the union of two unit squares meeting edge-to-edge. Equivalently, it is a perfect matching in the grid graph formed by placing a vertex at the center of each square of the region and connecting two vertices when they correspond to adjacent squares. Height functions For some classes of tilings on a regular grid in two dimensions, it is possible to define a height function associating an integer to the vertices of the grid. For instance, draw a chessboard, fix a node A_0 with height 0, then for any node there is a path from A_0 to it. On this path define the height of each node A_ (i.e. corners of the squares) to be the height of the previous node A_n plus one if the square on the right of the path from A_n to A_ is black, and minus one otherwise. More details can be found in . Thurston's height condition describes a test for determining whether a simply- ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Pavage Domino
Pavage was a medieval toll for the maintenance or improvement of a road or street in medieval England, Wales and Ireland. The king by letters patent granted the right to collect it to an individual, or the corporation of a town, or to the "bailiffs and good men" of a neighbouring village. Pavage grants can be divided into two classes: *Urban grants to enable the streets of a town (or its market place) to be paved. These represent the majority of grants. *Rural grants to enable a particular road to be repaired. These grants were mostly made in the 14th century, and largely for the great roads radiating from London, which were presumably those carrying the heaviest traffic. The first grant was in 1249 for the Yorkshire town of Beverley Beverley is a market and minster town and a civil parish in the East Riding of Yorkshire, England, of which it is the county town. The town centre is located south-east of York's centre and north-west of City of Hull. The town is know ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Chessboard
A chessboard is a used to play chess. It consists of 64 squares, 8 rows by 8 columns, on which the chess pieces are placed. It is square in shape and uses two colours of squares, one light and one dark, in a chequered pattern. During play, the board is oriented such that each player's near-right corner square is a light square. The columns of a chessboard are known as ', the rows are known as ', and the lines of adjoining same-coloured squares (each running from one edge of the board to an adjacent edge) are known as '. Each square of the board is named using algebraic, descriptive, or numeric chess notation; algebraic notation is the FIDE standard. In algebraic notation, using White's perspective, files are labeled ''a'' through ''h'' from left to right, and ranks are labeled ''1'' through ''8'' from bottom to top; each square is identified by the file and rank which it occupies. The a- through d-files comprise the , while the e- through h-files comprise the . History and evo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mutilated Chessboard Problem
The mutilated chessboard problem is a tiling puzzle posed by Max Black in 1946 that asks: Suppose a standard 8×8 chessboard (or checkerboard) has two diagonally opposite corners removed, leaving 62 squares. Is it possible to place 31 dominoes of size 2×1 so as to cover all of these squares? It is an impossible puzzle: there is no domino tiling meeting these conditions. One proof of its impossibility uses the fact that, with the corners removed, the chessboard has 32 squares of one color and 30 of the other, but each domino must cover equally many squares of each color. More generally, if any two squares are removed from the chessboard, the rest can be tiled by dominoes if and only if the removed squares are of different colors. This problem has been used as a test case for automated reasoning, creativity, and the philosophy of mathematics. History The mutilated chessboard problem is an instance of domino tiling of grids and polyominoes, also known as "dimer models" ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Gaussian Free Field
In probability theory and statistical mechanics, the Gaussian free field (GFF) is a Gaussian random field, a central model of random surfaces (random height functions). gives a mathematical survey of the Gaussian free field. The discrete version can be defined on any graph, usually a lattice in ''d''-dimensional Euclidean space. The continuum version is defined on R''d'' or on a bounded subdomain of R''d''. It can be thought of as a natural generalization of one-dimensional Brownian motion to ''d'' time (but still one space) dimensions: it is a random (generalized) function from R''d'' to R. In particular, the one-dimensional continuum GFF is just the standard one-dimensional Brownian motion or Brownian bridge on an interval. In the theory of random surfaces, it is also called the harmonic crystal. It is also the starting point for many constructions in quantum field theory, where it is called the Euclidean bosonic massless free field. A key property of the 2-dimensional GFF i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Dual Lattice
In the theory of lattices, the dual lattice is a construction analogous to that of a dual vector space. In certain respects, the geometry of the dual lattice of a lattice L is the reciprocal of the geometry of L , a perspective which underlies many of its uses. Dual lattices have many applications inside of lattice theory, theoretical computer science, cryptography and mathematics more broadly. For instance, it is used in the statement of the Poisson summation formula, transference theorems provide connections between the geometry of a lattice and that of its dual, and many lattice algorithms exploit the dual lattice. For an article with emphasis on the physics / chemistry applications, see Reciprocal lattice. This article focuses on the mathematical notion of a dual lattice. Definition Let L \subseteq \mathbb^n be a lattice. That is, L = B \mathbb^n for some matrix B . The dual lattice is the set of linear functionals on L which take integer values on each point o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometrical Frustration
In condensed matter physics, the term geometrical frustration (or in short: frustration) refers to a phenomenon where atoms tend to stick to non-trivial positions or where, on a regular crystal lattice, conflicting inter-atomic forces (each one favoring rather simple, but different structures) lead to quite complex structures. As a consequence of the frustration in the geometry or in the forces, a plenitude of distinct ground states may result at zero temperature, and usual thermal ordering may be suppressed at higher temperatures. Much studied examples are amorphous materials, glasses, or dilute magnets. The term ''frustration'', in the context of magnetic systems, has been introduced by Gerard Toulouse in 1977. Frustrated magnetic systems had been studied even before. Early work includes a study of the Ising model on a triangular lattice with nearest-neighbor spins coupled antiferromagnetically, by G. H. Wannier, published in 1950. Related features occur in magnets with ''competi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ising Model
The Ising model () (or Lenz-Ising model or Ising-Lenz model), named after the physicists Ernst Ising and Wilhelm Lenz, is a mathematical model of ferromagnetism in statistical mechanics. The model consists of discrete variables that represent magnetic dipole moments of atomic "spins" that can be in one of two states (+1 or −1). The spins are arranged in a graph, usually a lattice (where the local structure repeats periodically in all directions), allowing each spin to interact with its neighbors. Neighboring spins that agree have a lower energy than those that disagree; the system tends to the lowest energy but heat disturbs this tendency, thus creating the possibility of different structural phases. The model allows the identification of phase transitions as a simplified model of reality. The two-dimensional square-lattice Ising model is one of the simplest statistical models to show a phase transition. The Ising model was invented by the physicist , who gave it as a prob ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bijection
In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In mathematical terms, a bijective function is a one-to-one (injective) and onto (surjective) mapping of a set ''X'' to a set ''Y''. The term ''one-to-one correspondence'' must not be confused with ''one-to-one function'' (an injective function; see figures). A bijection from the set ''X'' to the set ''Y'' has an inverse function from ''Y'' to ''X''. If ''X'' and ''Y'' are finite sets, then the existence of a bijection means they have the same number of elements. For infinite sets, the picture is more complicated, leading to the concept of cardinal number—a way to distinguish the various sizes of infinite se ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
NP-complete
In computational complexity theory, a problem is NP-complete when: # it is a problem for which the correctness of each solution can be verified quickly (namely, in polynomial time) and a brute-force search algorithm can find a solution by trying all possible solutions. # the problem can be used to simulate every other problem for which we can verify quickly that a solution is correct. In this sense, NP-complete problems are the hardest of the problems to which solutions can be verified quickly. If we could find solutions of some NP-complete problem quickly, we could quickly find the solutions of every other problem to which a given solution can be easily verified. The name "NP-complete" is short for "nondeterministic polynomial-time complete". In this name, "nondeterministic" refers to nondeterministic Turing machines, a way of mathematically formalizing the idea of a brute-force search algorithm. Polynomial time refers to an amount of time that is considered "quick" for a dete ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tatami
A is a type of mat used as a flooring material in traditional Japanese-style rooms. Tatamis are made in standard sizes, twice as long as wide, about 0.9 m by 1.8 m depending on the region. In martial arts, tatami are the floor used for training in a dojo and for competition. Tatami are covered with a weft-faced weave of (common rush), on a warp of hemp or weaker cotton. There are four warps per weft shed, two at each end (or sometimes two per shed, one at each end, to cut costs). The (core) is traditionally made from sewn-together rice straw, but contemporary tatami sometimes have compressed wood chip boards or extruded polystyrene foam in their cores, instead or as well. The long sides are usually with brocade or plain cloth, although some tatami have no edging. History The term ''tatami'' is derived from the verb , meaning 'to fold' or 'to pile'. This indicates that the early tatami were thin and could be folded up when not used or piled in layers.Kodansha Encyclop ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Super-exponential Growth
In mathematics, tetration (or hyper-4) is an operation based on iterated, or repeated, exponentiation. There is no standard notation for tetration, though \uparrow \uparrow and the left-exponent ''xb'' are common. Under the definition as repeated exponentiation, means , where ' copies of ' are iterated via exponentiation, right-to-left, i.e. the application of exponentiation n-1 times. ' is called the "height" of the function, while ' is called the "base," analogous to exponentiation. It would be read as "the th tetration of ". It is the next hyperoperation after exponentiation, but before pentation. The word was coined by Reuben Louis Goodstein from tetra- (four) and iteration. Tetration is also defined recursively as : := \begin 1 &\textn=0, \\ a^ &\textn>0, \end allowing for attempts to extend tetration to non-natural numbers such as real and complex numbers. The two inverses of tetration are called super-root and super-logarithm, analogous to the nth root and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
