|
Discrete Morse Theory
Discrete Morse theory is a combinatorial adaptation of Morse theory developed by Robin Forman. The theory has various practical applications in diverse fields of applied mathematics and computer science, such as configuration spaces, homology computation, denoising, mesh compression, and topological data analysis. Notation regarding CW complexes Let X be a CW complex and denote by \mathcal its set of cells. Define the ''incidence function'' \kappa\colon\mathcal \times \mathcal \to \mathbb in the following way: given two cells \sigma and \tau in \mathcal, let \kappa(\sigma,~\tau) be the degree of the attaching map from the boundary of \sigma to \tau. The boundary operator is the endomorphism \partial of the free abelian group generated by \mathcal defined by :\partial(\sigma) = \sum_\kappa(\sigma,\tau)\tau. It is a defining property of boundary operators that \partial\circ\partial \equiv 0. In more axiomatic definitions one can find the requirement that \forall \sigma,\tau^ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Combinatorial
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science. Combinatorics is well known for the breadth of the problems it tackles. Combinatorial problems arise in many areas of pure mathematics, notably in algebra, probability theory, topology, and geometry, as well as in its many application areas. Many combinatorial questions have historically been considered in isolation, giving an ''ad hoc'' solution to a problem arising in some mathematical context. In the later twentieth century, however, powerful and general theoretical methods were developed, making combinatorics into an independent branch of mathematics in its own right. One of the oldest and most accessible parts of combinatorics is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Bijection
In mathematics, a bijection, bijective function, or one-to-one correspondence is a function between two sets such that each element of the second set (the codomain) is the image of exactly one element of the first set (the domain). Equivalently, a bijection is a relation between two sets such that each element of either set is paired with exactly one element of the other set. A function is bijective if it is invertible; that is, a function f:X\to Y is bijective if and only if there is a function g:Y\to X, the ''inverse'' of , such that each of the two ways for composing the two functions produces an identity function: g(f(x)) = x for each x in X and f(g(y)) = y for each y in Y. For example, the ''multiplication by two'' defines a bijection from the integers to the even numbers, which has the ''division by two'' as its inverse function. A function is bijective if and only if it is both injective (or ''one-to-one'')—meaning that each element in the codomain is mappe ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Stratified Morse Theory
In mathematics, stratified Morse theory is an analogue to Morse theory for general stratified spaces, originally developed by Mark Goresky and Robert MacPherson. The main point of the theory is to consider functions f : M \to \mathbb R and consider how the stratified space f^(-\infty,c] changes as the real number c \in \mathbb R changes. Morse theory of stratified spaces has uses everywhere from pure mathematics topics such as braid groups and Lawrence–Krammer representation, representations to robot motion planning and potential theory. A popular application in pure mathematics is Morse theory on manifolds with boundary, and manifolds with corners. See also * Digital Morse theory * Discrete Morse theory Discrete Morse theory is a combinatorial adaptation of Morse theory developed by Robin Forman. The theory has various practical applications in diverse fields of applied mathematics and computer science, such as configuration spaces, homology com ... * Level-set method ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Digital Morse Theory
In mathematics, digital Morse theory is a digital adaptation of continuum Morse theory for scalar volume data. The term was first promulgated by DB Karron based on the work of JL Cox and DB Karron. The main utility of a digital Morse theory is that it serves to provide a theoretical basis for isosurfaces (a kind of embedded manifold submanifold) and perpendicular streamlines in a digital context. The intended main application of DMT is in the rapid semiautomatic segmentation objects such as organs and anatomic structures from stacks of medical images such as produced by three-dimensional computed tomography by CT or MRI technology. DMT Tree A DMT tree is a digital version of a Reeb graph or contour tree graph, showing the relationship and connectivity of one isovalued defined object to another. Typically, these are nested objects, one inside another, giving a parent-child relationship, or two objects standing alone with a peer relationship. The essential insight of Morse theor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Archaeology
Archaeology or archeology is the study of human activity through the recovery and analysis of material culture. The archaeological record consists of Artifact (archaeology), artifacts, architecture, biofact (archaeology), biofacts or ecofacts, archaeological site, sites, and cultural landscapes. Archaeology can be considered both a social science and a branch of the humanities. It is usually considered an independent academic discipline, but may also be classified as part of anthropology (in North America – the four-field approach), history or geography. The discipline involves Survey (archaeology), surveying, Archaeological excavation, excavation, and eventually Post excavation, analysis of data collected, to learn more about the past. In broad scope, archaeology relies on cross-disciplinary research. Archaeologists study human prehistory and history, from the development of the first stone tools at Lomekwi in East Africa 3.3 million years ago up until recent decades. A ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Stone Tool
Stone tools have been used throughout human history but are most closely associated with prehistoric cultures and in particular those of the Stone Age. Stone tools may be made of either ground stone or knapped stone, the latter fashioned by a craftsman called a flintknapper. Stone has been used to make a wide variety of tools throughout history, including arrowheads, spearheads, hand axes, and querns. Knapped stone tools are nearly ubiquitous in pre-metal-using societies because they are easily manufactured, the tool stone raw material is usually plentiful, and they are easy to transport and sharpen. The study of stone tools is a cornerstone of prehistoric archaeology because they are essentially indestructible and therefore a ubiquitous component of the archaeological record. Ethnoarchaeology is used to further the understanding and cultural implications of stone tool use and manufacture. Knapped stone tools are made from cryptocrystalline materials such as chert, f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Group Isomorphism
In abstract algebra, a group isomorphism is a function between two groups that sets up a bijection between the elements of the groups in a way that respects the given group operations. If there exists an isomorphism between two groups, then the groups are called isomorphic. From the standpoint of group theory, isomorphic groups have the same properties and need not be distinguished. Definition and notation Given two groups (G, *) and (H, \odot), a ''group isomorphism'' from (G, *) to (H, \odot) is a bijective group homomorphism from G to H. Spelled out, this means that a group isomorphism is a bijective function f : G \to H such that for all u and v in G it holds that f(u * v) = f(u) \odot f(v). The two groups (G, *) and (H, \odot) are isomorphic if there exists an isomorphism from one to the other. This is written (G, *) \cong (H, \odot). Often shorter and simpler notations can be used. When the relevant group operations are understood, they are omitted and one writes G \co ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Euler Characteristic
In mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic) is a topological invariant, a number that describes a topological space's shape or structure regardless of the way it is bent. It is commonly denoted by \chi (Greek alphabet, Greek lower-case letter chi (letter), chi). The Euler characteristic was originally defined for polyhedron, polyhedra and used to prove various theorems about them, including the classification of the Platonic solids. It was stated for Platonic solids in 1537 in an unpublished manuscript by Francesco Maurolico. Leonhard Euler, for whom the concept is named, introduced it for convex polyhedra more generally but failed to rigorously prove that it is an invariant. In modern mathematics, the Euler characteristic arises from homology (mathematics), homology and, more abstractly, homological algebra. Polyhedra The Euler characteristic was ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Betti Number
In algebraic topology, the Betti numbers are used to distinguish topological spaces based on the connectivity of ''n''-dimensional simplicial complexes. For the most reasonable finite-dimensional spaces (such as compact manifolds, finite simplicial complexes or CW complexes), the sequence of Betti numbers is 0 from some point onward (Betti numbers vanish above the dimension of a space), and they are all finite. The ''n''th Betti number represents the rank of the ''n''th homology group, denoted ''H''''n'', which tells us the maximum number of cuts that can be made before separating a surface into two pieces or 0-cycles, 1-cycles, etc. For example, if H_n(X) \cong 0 then b_n(X) = 0, if H_n(X) \cong \mathbb then b_n(X) = 1, if H_n(X) \cong \mathbb \oplus \mathbb then b_n(X) = 2, if H_n(X) \cong \mathbb \oplus \mathbb\oplus \mathbb then b_n(X) = 3, etc. Note that only the ranks of infinite groups are considered, so for example if H_n(X) \cong \mathbb^k \oplus \mathbb/(2), where \mat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Isomorphism
In mathematics, an isomorphism is a structure-preserving mapping or morphism between two structures of the same type that can be reversed by an inverse mapping. Two mathematical structures are isomorphic if an isomorphism exists between them. The word is derived . The interest in isomorphisms lies in the fact that two isomorphic objects have the same properties (excluding further information such as additional structure or names of objects). Thus isomorphic structures cannot be distinguished from the point of view of structure only, and may often be identified. In mathematical jargon, one says that two objects are the same up to an isomorphism. A common example where isomorphic structures cannot be identified is when the structures are substructures of a larger one. For example, all subspaces of dimension one of a vector space are isomorphic and cannot be identified. An automorphism is an isomorphism from a structure to itself. An isomorphism between two structures is a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Integer
An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative integers. The set (mathematics), set of all integers is often denoted by the boldface or blackboard bold The set of natural numbers \mathbb is a subset of \mathbb, which in turn is a subset of the set of all rational numbers \mathbb, itself a subset of the real numbers \mathbb. Like the set of natural numbers, the set of integers \mathbb is Countable set, countably infinite. An integer may be regarded as a real number that can be written without a fraction, fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, , 5/4, and Square root of 2, are not. The integers form the smallest Group (mathematics), group and the smallest ring (mathematics), ring containing the natural numbers. In algebraic number theory, the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
Ring (mathematics)
In mathematics, a ring is an algebraic structure consisting of a set with two binary operations called ''addition'' and ''multiplication'', which obey the same basic laws as addition and multiplication of integers, except that multiplication in a ring does not need to be commutative. Ring elements may be numbers such as integers or complex numbers, but they may also be non-numerical objects such as polynomials, square matrices, functions, and power series. A ''ring'' may be defined as a set that is endowed with two binary operations called ''addition'' and ''multiplication'' such that the ring is an abelian group with respect to the addition operator, and the multiplication operator is associative, is distributive over the addition operation, and has a multiplicative identity element. (Some authors apply the term ''ring'' to a further generalization, often called a '' rng'', that omits the requirement for a multiplicative identity, and instead call the structure defi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] [Amazon] |
