|
Isoperimetric Dimension
In mathematics, the isoperimetric dimension of a manifold is a notion of dimension that tries to capture how the ''large-scale behavior'' of the manifold resembles that of a Euclidean space (unlike the topological dimension or the Hausdorff dimension which compare different ''local behaviors'' against those of the Euclidean space). In the Euclidean space, the isoperimetric inequality says that of all bodies with the same volume, the ball has the smallest surface area. In other manifolds it is usually very difficult to find the precise body minimizing the surface area, and this is not what the isoperimetric dimension is about. The question we will ask is, what is ''approximately'' the minimal surface area, whatever the body realizing it might be. Formal definition We say about a differentiable manifold ''M'' that it satisfies a ''d''-dimensional isoperimetric inequality if for any open set ''D'' in ''M'' with a smooth boundary one has :\operatorname(\partial D)\geq C\operatorname(D ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics
Mathematics is an area of knowledge that includes the topics of numbers, formulas and related structures, shapes and the spaces in which they are contained, and quantities and their changes. These topics are represented in modern mathematics with the major subdisciplines of number theory, algebra, geometry, and analysis, respectively. There is no general consensus among mathematicians about a common definition for their academic discipline. Most mathematical activity involves the discovery of properties of abstract objects and the use of pure reason to prove them. These objects consist of either abstractions from nature orin modern mathematicsentities that are stipulated to have certain properties, called axioms. A ''proof'' consists of a succession of applications of deductive rules to already established results. These results include previously proved theorems, axioms, andin case of abstraction from naturesome basic properties that are considered true starting points of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Glossary Of Riemannian And Metric Geometry
This is a glossary of some terms used in Riemannian geometry and metric geometry — it doesn't cover the terminology of differential topology. The following articles may also be useful; they either contain specialised vocabulary or provide more detailed expositions of the definitions given below. * Connection * Curvature * Metric space * Riemannian manifold See also: * Glossary of general topology * Glossary of differential geometry and topology * List of differential geometry topics Unless stated otherwise, letters ''X'', ''Y'', ''Z'' below denote metric spaces, ''M'', ''N'' denote Riemannian manifolds, , ''xy'', or , xy, _X denotes the distance between points ''x'' and ''y'' in ''X''. Italic ''word'' denotes a self-reference to this glossary. ''A caveat'': many terms in Riemannian and metric geometry, such as ''convex function'', ''convex set'' and others, do not have exactly the same meaning as in general mathematical usage. __NOTOC__ A Alexandrov space a gene ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Random Walk
In mathematics, a random walk is a random process that describes a path that consists of a succession of random steps on some mathematical space. An elementary example of a random walk is the random walk on the integer number line \mathbb Z which starts at 0, and at each step moves +1 or −1 with equal probability. Other examples include the path traced by a molecule as it travels in a liquid or a gas (see Brownian motion), the search path of a foraging animal, or the price of a fluctuating stock and the financial status of a gambler. Random walks have applications to engineering and many scientific fields including ecology, psychology, computer science, physics, chemistry, biology, economics, and sociology. The term ''random walk'' was first introduced by Karl Pearson in 1905. Lattice random walk A popular random walk model is that of a random walk on a regular lattice, where at each step the location jumps to another site according to some probability distribution. In a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Nicholas Varopoulos
Nicholas Theodore Varopoulos ( el, Νικόλαος Βαρόπουλος, ''Nikolaos Varopoulos'', also ''Nicolas Varopoulos''; born 16 June 1940) is a Greek mathematician, who works on harmonic analysis and especially analysis on Lie groups. Varopoulos is the son of the Thessaloniki mathematics professor Theodoros Varopoulos, Theodore Varopoulos (1894–1957). Nicholas Varopoulos received his PhD in 1965 from Cambridge University under John Hunter Williamson. There he was in 1965 a lecturer in mathematics. In the academic year 1966–1967 he was at the Institute for Advanced Study in Princeton, New Jersey. Varopoulos became a professor at the Université Pierre et Marie Curie (Université Paris VI). In 1968 Varopoulos became the first recipient of the Salem Prize. In 1990 he was an list of International Congresses of Mathematicians Plenary and Invited Speakers, invited speaker at the International Congress of Mathematicians in Kyoto (''Analysis and geometry on groups'') and in 1 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finitely Generated Group
In algebra, a finitely generated group is a group ''G'' that has some finite generating set ''S'' so that every element of ''G'' can be written as the combination (under the group operation) of finitely many elements of ''S'' and of inverses of such elements. By definition, every finite group is finitely generated, since ''S'' can be taken to be ''G'' itself. Every infinite finitely generated group must be countable but countable groups need not be finitely generated. The additive group of rational numbers Q is an example of a countable group that is not finitely generated. Examples * Every quotient of a finitely generated group ''G'' is finitely generated; the quotient group is generated by the images of the generators of ''G'' under the canonical projection. * A subgroup of a finitely generated group need not be finitely generated. * A group that is generated by a single element is called cyclic. Every infinite cyclic group is isomorphic to the additive group of the integers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cayley Graph
In mathematics, a Cayley graph, also known as a Cayley color graph, Cayley diagram, group diagram, or color group is a graph that encodes the abstract structure of a group. Its definition is suggested by Cayley's theorem (named after Arthur Cayley), and uses a specified set of generators for the group. It is a central tool in combinatorial and geometric group theory. The structure and symmetry of Cayley graphs makes them particularly good candidates for constructing families of expander graphs. Definition Let G be a group and S be a generating set of G. The Cayley graph \Gamma = \Gamma(G,S) is an edge-colored directed graph constructed as follows: In his Collected Mathematical Papers 10: 403–405. * Each element g of G is assigned a vertex: the vertex set of \Gamma is identified with G. * Each element s of S is assigned a color c_s. * For every g \in G and s \in S, there is a directed edge of color c_s from the vertex corresponding to g to the one corresponding to gs. Not ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lie Group
In mathematics, a Lie group (pronounced ) is a group that is also a differentiable manifold. A manifold is a space that locally resembles Euclidean space, whereas groups define the abstract concept of a binary operation along with the additional properties it must have to be thought of as a "transformation" in the abstract sense, for instance multiplication and the taking of inverses (division), or equivalently, the concept of addition and the taking of inverses (subtraction). Combining these two ideas, one obtains a continuous group where multiplying points and their inverses are continuous. If the multiplication and taking of inverses are smooth (differentiable) as well, one obtains a Lie group. Lie groups provide a natural model for the concept of continuous symmetry, a celebrated example of which is the rotational symmetry in three dimensions (given by the special orthogonal group \text(3)). Lie groups are widely used in many parts of modern mathematics and physics. Lie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Group (mathematics)
In mathematics, a group is a Set (mathematics), set and an Binary operation, operation that combines any two Element (mathematics), elements of the set to produce a third element of the set, in such a way that the operation is Associative property, associative, an identity element exists and every element has an Inverse element, inverse. These three axioms hold for Number#Main classification, number systems and many other mathematical structures. For example, the integers together with the addition operation form a group. The concept of a group and the axioms that define it were elaborated for handling, in a unified way, essential structural properties of very different mathematical entities such as numbers, geometric shapes and polynomial roots. Because the concept of groups is ubiquitous in numerous areas both within and outside mathematics, some authors consider it as a central organizing principle of contemporary mathematics. In geometry groups arise naturally in the study of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Glossary Of Graph Theory
This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes or vertices connected in pairs by lines or edges. Symbols A B C D E F G H I K L M N O ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Riemannian Manifold
In differential geometry, a Riemannian manifold or Riemannian space , so called after the German mathematician Bernhard Riemann, is a real manifold, real, smooth manifold ''M'' equipped with a positive-definite Inner product space, inner product ''g''''p'' on the tangent space ''T''''p''''M'' at each point ''p''. The family ''g''''p'' of inner products is called a metric tensor, Riemannian metric (or Riemannian metric tensor). Riemannian geometry is the study of Riemannian manifolds. A common convention is to take ''g'' to be Smoothness, smooth, which means that for any smooth coordinate chart on ''M'', the ''n''2 functions :g\left(\frac,\frac\right):U\to\mathbb are smooth functions. These functions are commonly designated as g_. With further restrictions on the g_, one could also consider Lipschitz continuity, Lipschitz Riemannian metrics or Measurable function, measurable Riemannian metrics, among many other possibilities. A Riemannian metric (tensor) makes it possible to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Growth Rate (group Theory)
In the mathematical subject of geometric group theory, the growth rate of a group with respect to a symmetric generating set describes how fast a group grows. Every element in the group can be written as a product of generators, and the growth rate counts the number of elements that can be written as a product of length ''n''. Definition Suppose ''G'' is a finitely generated group; and ''T'' is a finite ''symmetric'' set of generators (symmetric means that if x \in T then x^ \in T ). Any element x \in G can be expressed as a word in the ''T''-alphabet : x = a_1 \cdot a_2 \cdots a_k \text a_i\in T. Consider the subset of all elements of ''G'' that can be expressed by such a word of length ≤ ''n'' :B_n(G,T) = \. This set is just the closed ball of radius ''n'' in the word metric ''d'' on ''G'' with respect to the generating set ''T'': :B_n(G,T) = \. More geometrically, B_n(G,T) is the set of vertices in the Cayley graph with respect to ''T'' that are within distan ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Random Walk
In mathematics, a random walk is a random process that describes a path that consists of a succession of random steps on some mathematical space. An elementary example of a random walk is the random walk on the integer number line \mathbb Z which starts at 0, and at each step moves +1 or −1 with equal probability. Other examples include the path traced by a molecule as it travels in a liquid or a gas (see Brownian motion), the search path of a foraging animal, or the price of a fluctuating stock and the financial status of a gambler. Random walks have applications to engineering and many scientific fields including ecology, psychology, computer science, physics, chemistry, biology, economics, and sociology. The term ''random walk'' was first introduced by Karl Pearson in 1905. Lattice random walk A popular random walk model is that of a random walk on a regular lattice, where at each step the location jumps to another site according to some probability distribution. In a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
