|
Packing Density
A packing density or packing fraction of a packing in some space is the fraction of the space filled by the figures making up the packing. In simplest terms, this is the ratio of the volume of bodies in a space to the volume of the space itself. In packing problems, the objective is usually to obtain a packing of the greatest possible density. In compact spaces If are measurable subsets of a compact measure space and their interiors pairwise do not intersect, then the collection is a packing in and its packing density is :\eta = \frac. In Euclidean space If the space being packed is infinite in measure, such as Euclidean space, it is customary to define the density as the limit of densities exhibited in balls of larger and larger radii. If is the ball of radius centered at the origin, then the density of a packing is :\eta = \lim_\frac. Since this limit does not always exist, it is also useful to define the upper and lower densities as the limit superior and limit i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fraction (mathematics)
A fraction (from la, fractus, "broken") represents a part of a whole or, more generally, any number of equal parts. When spoken in everyday English, a fraction describes how many parts of a certain size there are, for example, one-half, eight-fifths, three-quarters. A ''common'', ''vulgar'', or ''simple'' fraction (examples: \tfrac and \tfrac) consists of a numerator, displayed above a line (or before a slash like ), and a non-zero denominator, displayed below (or after) that line. Numerators and denominators are also used in fractions that are not ''common'', including compound fractions, complex fractions, and mixed numerals. In positive common fractions, the numerator and denominator are natural numbers. The numerator represents a number of equal parts, and the denominator indicates how many of those parts make up a unit or a whole. The denominator cannot be zero, because zero parts can never make up a whole. For example, in the fraction , the numerator 3 indicates that the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Packing Problems
Packing problems are a class of optimization problems in mathematics that involve attempting to pack objects together into containers. The goal is to either pack a single container as densely as possible or pack all objects using as few containers as possible. Many of these problems can be related to real-life packaging, storage and transportation issues. Each packing problem has a dual covering problem, which asks how many of the same objects are required to completely cover every region of the container, where objects are allowed to overlap. In a bin packing problem, you are given: * A ''container'', usually a two- or three-dimensional convex region, possibly of infinite size. Multiple containers may be given depending on the problem. * A set of ''objects'', some or all of which must be packed into one or more containers. The set may contain different objects with their sizes specified, or a single object of a fixed dimension that can be used repeatedly. Usually the packin ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Compact Space
In mathematics, specifically general topology, compactness is a property that seeks to generalize the notion of a closed and bounded subset of Euclidean space by making precise the idea of a space having no "punctures" or "missing endpoints", i.e. that the space not exclude any ''limiting values'' of points. For example, the open interval (0,1) would not be compact because it excludes the limiting values of 0 and 1, whereas the closed interval ,1would be compact. Similarly, the space of rational numbers \mathbb is not compact, because it has infinitely many "punctures" corresponding to the irrational numbers, and the space of real numbers \mathbb is not compact either, because it excludes the two limiting values +\infty and -\infty. However, the ''extended'' real number line ''would'' be compact, since it contains both infinities. There are many ways to make this heuristic notion precise. These ways usually agree in a metric space, but may not be equivalent in other topo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Measure Space
A measure space is a basic object of measure theory, a branch of mathematics that studies generalized notions of volumes. It contains an underlying set, the subsets of this set that are feasible for measuring (the -algebra) and the method that is used for measuring (the measure). One important example of a measure space is a probability space. A measurable space consists of the first two components without a specific measure. Definition A measure space is a triple (X, \mathcal A, \mu), where * X is a set * \mathcal A is a -algebra on the set X * \mu is a measure on (X, \mathcal) In other words, a measure space consists of a measurable space (X, \mathcal) together with a measure on it. Example Set X = \. The \sigma-algebra on finite sets such as the one above is usually the power set, which is the set of all subsets (of a given set) and is denoted by \wp(\cdot). Sticking with this convention, we set \mathcal = \wp(X) In this simple case, the power set can be writt ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Space
Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, that is, in Euclid's ''Elements'', it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are Euclidean spaces of any positive integer dimension, including the three-dimensional space and the '' Euclidean plane'' (dimension two). The qualifier "Euclidean" is used to distinguish Euclidean spaces from other spaces that were later considered in physics and modern mathematics. Ancient Greek geometers introduced Euclidean space for modeling the physical space. Their work was collected by the ancient Greek mathematician Euclid in his ''Elements'', with the great innovation of '' proving'' all properties of the space as theorems, by starting from a few fundamental properties, called ''postulates'', which either were considered as evident (for example, there is exactly one straight line passing through two points), or seemed impossible to prov ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Limit Superior And Limit Inferior
In mathematics, the limit inferior and limit superior of a sequence can be thought of as limiting (that is, eventual and extreme) bounds on the sequence. They can be thought of in a similar fashion for a function (see limit of a function). For a set, they are the infimum and supremum of the set's limit points, respectively. In general, when there are multiple objects around which a sequence, function, or set accumulates, the inferior and superior limits extract the smallest and largest of them; the type of object and the measure of size is context-dependent, but the notion of extreme limits is invariant. Limit inferior is also called infimum limit, limit infimum, liminf, inferior limit, lower limit, or inner limit; limit superior is also known as supremum limit, limit supremum, limsup, superior limit, upper limit, or outer limit. The limit inferior of a sequence x_n is denoted by \liminf_x_n\quad\text\quad \varliminf_x_n. The limit superior of a sequence x_n is denoted by \li ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Supremum
In mathematics, the infimum (abbreviated inf; plural infima) of a subset S of a partially ordered set P is a greatest element in P that is less than or equal to each element of S, if such an element exists. Consequently, the term ''greatest lower bound'' (abbreviated as ) is also commonly used. The supremum (abbreviated sup; plural suprema) of a subset S of a partially ordered set P is the least element in P that is greater than or equal to each element of S, if such an element exists. Consequently, the supremum is also referred to as the ''least upper bound'' (or ). The infimum is in a precise sense dual to the concept of a supremum. Infima and suprema of real numbers are common special cases that are important in analysis, and especially in Lebesgue integration. However, the general definitions remain valid in the more abstract setting of order theory where arbitrary partially ordered sets are considered. The concepts of infimum and supremum are close to minimum ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Motion
In mathematics, a rigid transformation (also called Euclidean transformation or Euclidean isometry) is a geometric transformation of a Euclidean space that preserves the Euclidean distance between every pair of points. The rigid transformations include rotations, translations, reflections, or any sequence of these. Reflections are sometimes excluded from the definition of a rigid transformation by requiring that the transformation also preserve the handedness of objects in the Euclidean space. (A reflection would not preserve handedness; for instance, it would transform a left hand into a right hand.) To avoid ambiguity, a transformation that preserves handedness is known as a proper rigid transformation, or rototranslation. Any proper rigid transformation can be decomposed into a rotation followed by a translation, while any improper rigid transformation can be decomposed into an improper rotation followed by a translation, or into a sequence of reflections. Any object wi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kepler Conjecture
The Kepler conjecture, named after the 17th-century mathematician and astronomer Johannes Kepler, is a mathematical theorem about sphere packing in three-dimensional Euclidean space. It states that no arrangement of equally sized spheres filling space has a greater average density than that of the cubic close packing (face-centered cubic) and hexagonal close packing arrangements. The density of these arrangements is around 74.05%. In 1998, Thomas Hales, following an approach suggested by , announced that he had a proof of the Kepler conjecture. Hales' proof is a proof by exhaustion involving the checking of many individual cases using complex computer calculations. Referees said that they were "99% certain" of the correctness of Hales' proof, and the Kepler conjecture was accepted as a theorem. In 2014, the Flyspeck project team, headed by Hales, announced the completion of a formal proof of the Kepler conjecture using a combination of the Isabelle and HOL Light proof assistan ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ulam's Packing Conjecture
Ulam's packing conjecture, named for Stanislaw Ulam, is a conjecture about the highest possible packing density of identical convex solids in three-dimensional Euclidean space. The conjecture says that the optimal density for packing congruent spheres is smaller than that for any other convex body. That is, according to the conjecture, the ball is the convex solid which forces the largest fraction of space to remain empty in its optimal packing structure. This conjecture is therefore related to the Kepler conjecture about sphere packing. Since the solution to the Kepler conjecture establishes that identical balls must leave ≈25.95% of the space empty, Ulam's conjecture is equivalent to the statement that no other convex solid forces that much space to be left empty. Origin This conjecture was attributed posthumously to Ulam by Martin Gardner, who remarks in a postscript added to one of his ''Mathematical Games'' columns that Ulam communicated this conjecture to him in 1972. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Translation (geometry)
In Euclidean geometry, a translation is a geometric transformation that moves every point of a figure, shape or space by the same distance in a given direction. A translation can also be interpreted as the addition of a constant vector to every point, or as shifting the origin of the coordinate system. In a Euclidean space, any translation is an isometry. As a function If \mathbf is a fixed vector, known as the ''translation vector'', and \mathbf is the initial position of some object, then the translation function T_ will work as T_(\mathbf)=\mathbf+\mathbf. If T is a translation, then the image of a subset A under the function T is the translate of A by T . The translate of A by T_ is often written A+\mathbf . Horizontal and vertical translations In geometry, a vertical translation (also known as vertical shift) is a translation of a geometric object in a direction parallel to the vertical axis of the Cartesian coordinate system. Often, vertical translation ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Atomic Packing Factor
In crystallography, atomic packing factor (APF), packing efficiency, or packing fraction is the fraction of volume in a crystal structure that is occupied by constituent particles. It is a dimensionless quantity and always less than unity. In atomic systems, by convention, the APF is determined by assuming that atoms are rigid spheres. The radius of the spheres is taken to be the maximum value such that the atoms do not overlap. For one-component crystals (those that contain only one type of particle), the packing fraction is represented mathematically by :\mathrm = \frac where ''N''particle is the number of particles in the unit cell, ''V''particle is the volume of each particle, and ''V''unit cell is the volume occupied by the unit cell. It can be proven mathematically that for one-component structures, the most dense arrangement of atoms has an APF of about 0.74 (see Kepler conjecture), obtained by the close-packed structures. For multiple-component structures (such as wit ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.svg "Click for more on -> Atomic Packing Factor")