|
Meyer Set
In mathematics, a Meyer set or almost lattice is a set relatively dense ''X'' of points in the Euclidean plane or a higher-dimensional Euclidean space such that its Minkowski difference with itself is uniformly discrete. Meyer sets have several equivalent characterizations; they are named after Yves Meyer, who introduced and studied them in the context of diophantine approximation. Nowadays Meyer sets are best known as mathematical model for quasicrystals. However, Meyer's work precedes the discovery of quasicrystals by more than a decade and was entirely motivated by number theoretic questions.. Definition and characterizations A subset ''X'' of a metric space is relatively dense if there exists a number ''r'' such that all points of ''X'' are within distance ''r'' of ''X'', and it is uniformly discrete if there exists a number ''ε'' such that no two points of ''X'' are within distance ''ε'' of each other. A set that is both relatively dense and uniformly discret ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Delone Set
In the mathematical theory of metric spaces, ε-nets, ε-packings, ε-coverings, uniformly discrete sets, relatively dense sets, and Delone sets (named after Boris Delone) are several closely related definitions of well-spaced sets of points, and the packing radius and covering radius of these sets measure how well-spaced they are. These sets have applications in coding theory, approximation algorithms, and the theory of quasicrystals. Definitions If (''M'',''d'') is a metric space, and ''X'' is a subset of ''M'', then the packing radius of ''X'' is half of the infimum of distances between distinct members of ''X''. If the packing radius is ''r'', then open balls of radius ''r'' centered at the points of ''X'' will all be disjoint from each other, and each open ball centered at one of the points of ''X'' with radius 2''r'' will be disjoint from the rest of ''X''. The covering radius of ''X'' is the infimum of the numbers ''r'' such that every point of ''M'' is within distance ' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Character (mathematics)
In mathematics, a character is (most commonly) a special kind of function from a group to a field (such as the complex numbers). There are at least two distinct, but overlapping meanings. Other uses of the word "character" are almost always qualified. Multiplicative character A multiplicative character (or linear character, or simply character) on a group ''G'' is a group homomorphism from ''G'' to the multiplicative group of a field , usually the field of complex numbers. If ''G'' is any group, then the set Ch(''G'') of these morphisms forms an abelian group under pointwise multiplication. This group is referred to as the character group of ''G''. Sometimes only ''unitary'' characters are considered (thus the image is in the unit circle); other such homomorphisms are then called ''quasi-characters''. Dirichlet characters can be seen as a special case of this definition. Multiplicative characters are linearly independent, i.e. if \chi_1,\chi_2, \ldots , \chi_n are different cha ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Metric Geometry
In mathematics, a metric space is a set together with a notion of ''distance'' between its elements, usually called points. The distance is measured by a function called a metric or distance function. Metric spaces are the most general setting for studying many of the concepts of mathematical analysis and geometry. The most familiar example of a metric space is 3-dimensional Euclidean space with its usual notion of distance. Other well-known examples are a sphere equipped with the angular distance and the hyperbolic plane. A metric may correspond to a metaphorical, rather than physical, notion of distance: for example, the set of 100-character Unicode strings can be equipped with the Hamming distance, which measures the number of characters that need to be changed to get from one string to another. Since they are very general, metric spaces are a tool used in many different branches of mathematics. Many types of mathematical objects have a natural notion of distance and t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Set
In mathematics, particularly set theory, a finite set is a set that has a finite number of elements. Informally, a finite set is a set which one could in principle count and finish counting. For example, :\ is a finite set with five elements. The number of elements of a finite set is a natural number (possibly zero) and is called the '' cardinality (or the cardinal number)'' of the set. A set that is not a finite set is called an ''infinite set''. For example, the set of all positive integers is infinite: :\. Finite sets are particularly important in combinatorics, the mathematical study of counting. Many arguments involving finite sets rely on the pigeonhole principle, which states that there cannot exist an injective function from a larger finite set to a smaller finite set. Definition and terminology Formally, a set is called finite if there exists a bijection :f\colon S\to\ for some natural number . The number is the set's cardinality, denoted as . The empty set o ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Penrose Tiling
A Penrose tiling is an example of an aperiodic tiling. Here, a ''tiling'' is a covering of the plane by non-overlapping polygons or other shapes, and ''aperiodic'' means that shifting any tiling with these shapes by any finite distance, without rotation, cannot produce the same tiling. However, despite their lack of translational symmetry, Penrose tilings may have both reflection symmetry and fivefold rotational symmetry. Penrose tilings are named after mathematician and physicist Roger Penrose, who investigated them in the 1970s. There are several different variations of Penrose tilings with different tile shapes. The original form of Penrose tiling used tiles of four different shapes, but this was later reduced to only two shapes: either two different rhombi, or two different quadrilaterals called kites and darts. The Penrose tilings are obtained by constraining the ways in which these shapes are allowed to fit together in a way that avoids periodic tiling. This may be done in s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lattice (group)
In geometry and group theory, a lattice in the real coordinate space \mathbb^n is an infinite set of points in this space with the properties that coordinate wise addition or subtraction of two points in the lattice produces another lattice point, that the lattice points are all separated by some minimum distance, and that every point in the space is within some maximum distance of a lattice point. Closure under addition and subtraction means that a lattice must be a subgroup of the additive group of the points in the space, and the requirements of minimum and maximum distance can be summarized by saying that a lattice is a Delone set. More abstractly, a lattice can be described as a free abelian group of dimension n which spans the vector space \mathbb^n. For any basis of \mathbb^n, the subgroup of all linear combinations with integer coefficients of the basis vectors forms a lattice, and every lattice can be formed from a basis in this way. A lattice may be viewed as a regula ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Harmonious Set
In mathematics, a harmonious set is a subset of a locally compact abelian group on which every weak character may be uniformly approximated by strong characters. Equivalently, a suitably defined dual set is relatively dense in the Pontryagin dual of the group. This notion was introduced by Yves Meyer in 1970 and later turned out to play an important role in the mathematical theory of quasicrystals. Some related concepts are model sets, Meyer sets, and cut-and-project sets. Definition Let ''Λ'' be a subset of a locally compact abelian group ''G'' and ''Λ''''d'' be the subgroup of ''G'' generated by ''Λ'', with discrete topology. A weak character is a restriction to ''Λ'' of an algebraic homomorphism from ''Λ''''d'' into the circle group: : \chi: \Lambda_d\to\mathbf, \quad \chi\in\operatorname(\Lambda_d,\mathbf). A strong character is a restriction to ''Λ'' of a continuous homomorphism from ''G'' to T, that is an element of the Pontryag ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Complex Number
In mathematics, a complex number is an element of a number system that extends the real numbers with a specific element denoted , called the imaginary unit and satisfying the equation i^= -1; every complex number can be expressed in the form a + bi, where and are real numbers. Because no real number satisfies the above equation, was called an imaginary number by René Descartes. For the complex number a+bi, is called the , and is called the . The set of complex numbers is denoted by either of the symbols \mathbb C or . Despite the historical nomenclature "imaginary", complex numbers are regarded in the mathematical sciences as just as "real" as the real numbers and are fundamental in many aspects of the scientific description of the natural world. Complex numbers allow solutions to all polynomial equations, even those that have no solutions in real numbers. More precisely, the fundamental theorem of algebra asserts that every non-constant polynomial equation with real or ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lattice (group)
In geometry and group theory, a lattice in the real coordinate space \mathbb^n is an infinite set of points in this space with the properties that coordinate wise addition or subtraction of two points in the lattice produces another lattice point, that the lattice points are all separated by some minimum distance, and that every point in the space is within some maximum distance of a lattice point. Closure under addition and subtraction means that a lattice must be a subgroup of the additive group of the points in the space, and the requirements of minimum and maximum distance can be summarized by saying that a lattice is a Delone set. More abstractly, a lattice can be described as a free abelian group of dimension n which spans the vector space \mathbb^n. For any basis of \mathbb^n, the subgroup of all linear combinations with integer coefficients of the basis vectors forms a lattice, and every lattice can be formed from a basis in this way. A lattice may be viewed as a regula ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Plane
In mathematics, the Euclidean plane is a Euclidean space of dimension two. That is, a geometric setting in which two real quantities are required to determine the position of each point ( element of the plane), which includes affine notions of parallel lines, and also metrical notions of distance, circles, and angle measurement. The set \mathbb^2 of pairs of real numbers (the real coordinate plane) augmented by appropriate structure often serves as the canonical example. History Books I through IV and VI of Euclid's Elements dealt with two-dimensional geometry, developing such notions as similarity of shapes, the Pythagorean theorem (Proposition 47), equality of angles and areas, parallelism, the sum of the angles in a triangle, and the three cases in which triangles are "equal" (have the same area), among many other topics. Later, the plane was described in a so-called '' Cartesian coordinate system'', a coordinate system that specifies each point uniquely in a plane by a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reciprocal Lattice
In physics, the reciprocal lattice represents the Fourier transform of another lattice (group) (usually a Bravais lattice). In normal usage, the initial lattice (whose transform is represented by the reciprocal lattice) is a periodic spatial function in real space known as the ''direct lattice''. While the direct lattice exists in real space and is commonly understood to be a physical lattice (such as the lattice of a crystal), the reciprocal lattice exists in the space of spatial frequencies known as reciprocal space or k space, where \mathbf refers to the wavevector. In quantum physics, reciprocal space is closely related to momentum space according to the proportionality \mathbf = \hbar \mathbf, where \mathbf is the momentum vector and \hbar is the Planck constant. The reciprocal lattice of a reciprocal lattice is equivalent to the original direct lattice, because the defining equations are symmetrical with respect to the vectors in real and reciprocal space. Mathematically, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vector Space
In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called ''vectors'', may be added together and multiplied ("scaled") by numbers called '' scalars''. Scalars are often real numbers, but can be complex numbers or, more generally, elements of any field. The operations of vector addition and scalar multiplication must satisfy certain requirements, called ''vector axioms''. The terms real vector space and complex vector space are often used to specify the nature of the scalars: real coordinate space or complex coordinate space. Vector spaces generalize Euclidean vectors, which allow modeling of physical quantities, such as forces and velocity, that have not only a magnitude, but also a direction. The concept of vector spaces is fundamental for linear algebra, together with the concept of matrix, which allows computing in vector spaces. This provides a concise and synthetic way for manipulating and studying systems of linear eq ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Penrose Tiling")
