|
Introduction To Tropical Geometry
''Introduction to Tropical Geometry'' is a book on tropical geometry, by Diane Maclagan and Bernd Sturmfels. It was published by the American Mathematical Society in 2015 as volume 161 of Graduate Studies in Mathematics. Topics The tropical semiring is an algebraic structure on the real numbers in which addition takes the usual place of multiplication, and minimization takes the usual place of addition. This combination of the two operations of addition and minimization comes up naturally, for instance, in the shortest path problem, where concatenating paths causes their distances to be added and where the shortest of two parallel paths is the one with minimum length, and where some shortest path algorithms can be interpreted as tropical matrix multiplication. Tropical geometry applies the machinery of algebraic geometry to this system by defining polynomials using addition and minimization in place of multiplication and addition (yielding piecewise linear functions), and studying ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Introduction To Tropical Geometry
''Introduction to Tropical Geometry'' is a book on tropical geometry, by Diane Maclagan and Bernd Sturmfels. It was published by the American Mathematical Society in 2015 as volume 161 of Graduate Studies in Mathematics. Topics The tropical semiring is an algebraic structure on the real numbers in which addition takes the usual place of multiplication, and minimization takes the usual place of addition. This combination of the two operations of addition and minimization comes up naturally, for instance, in the shortest path problem, where concatenating paths causes their distances to be added and where the shortest of two parallel paths is the one with minimum length, and where some shortest path algorithms can be interpreted as tropical matrix multiplication. Tropical geometry applies the machinery of algebraic geometry to this system by defining polynomials using addition and minimization in place of multiplication and addition (yielding piecewise linear functions), and studying ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Non-Archimedean Ordered Field
In mathematics, a non-Archimedean ordered field is an ordered field that does not satisfy the Archimedean property. Examples are the Levi-Civita field, the hyperreal numbers, the surreal numbers, the Dehn field, and the field of rational functions with real coefficients with a suitable order. Definition The Archimedean property is a property of certain ordered fields such as the rational numbers or the real numbers, stating that every two elements are within an integer multiple of each other. If a field contains two positive elements for which this is not true, then must be an infinitesimal, greater than zero but smaller than any integer unit fraction. Therefore, the negation of the Archimedean property is equivalent to the existence of infinitesimals. Applications Hyperreal fields, non-Archimedean ordered fields containing the real numbers as a subfield, may be used to provide a mathematical foundation for nonstandard analysis. Max Dehn used the Dehn field, an example of a non ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Mathematics Books
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 t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tropical Geometry
In mathematics, tropical geometry is the study of polynomials and their geometric properties when addition is replaced with minimization and multiplication is replaced with ordinary addition: : x \oplus y = \min\, : x \otimes y = x + y. So for example, the classical polynomial x^3 + 2xy + y^4 would become \min\. Such polynomials and their solutions have important applications in optimization problems, for example the problem of optimizing departure times for a network of trains. Tropical geometry is a variant of algebraic geometry in which polynomial graphs resemble piecewise linear meshes, and in which numbers belong to the tropical semiring instead of a field. Because classical and tropical geometry are closely related, results and methods can be converted between them. Algebraic varieties can be mapped to a tropical counterpart and, since this process still retains some geometric information about the original variety, it can be used to help prove and generalize classica ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Commutative Algebra
Commutative algebra, first known as ideal theory, is the branch of algebra that studies commutative rings, their ideals, and modules over such rings. Both algebraic geometry and algebraic number theory build on commutative algebra. Prominent examples of commutative rings include polynomial rings; rings of algebraic integers, including the ordinary integers \mathbb; and ''p''-adic integers. Commutative algebra is the main technical tool in the local study of schemes. The study of rings that are not necessarily commutative is known as noncommutative algebra; it includes ring theory, representation theory, and the theory of Banach algebras. Overview Commutative algebra is essentially the study of the rings occurring in algebraic number theory and algebraic geometry. In algebraic number theory, the rings of algebraic integers are Dedekind rings, which constitute therefore an important class of commutative rings. Considerations related to modular arithmetic have led to the no ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Toric Variety
In algebraic geometry, a toric variety or torus embedding is an algebraic variety containing an algebraic torus as an open dense subset, such that the action of the torus on itself extends to the whole variety. Some authors also require it to be normal. Toric varieties form an important and rich class of examples in algebraic geometry, which often provide a testing ground for theorems. The geometry of a toric variety is fully determined by the combinatorics of its associated fan, which often makes computations far more tractable. For a certain special, but still quite general class of toric varieties, this information is also encoded in a polytope, which creates a powerful connection of the subject with convex geometry. Familiar examples of toric varieties are affine space, projective spaces, products of projective spaces and bundles over projective space. Toric varieties from tori The original motivation to study toric varieties was to study torus embeddings. Given the algebraic t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Algebra
Linear algebra is the branch of mathematics concerning linear equations such as: :a_1x_1+\cdots +a_nx_n=b, linear maps such as: :(x_1, \ldots, x_n) \mapsto a_1x_1+\cdots +a_nx_n, and their representations in vector spaces and through matrices. Linear algebra is central to almost all areas of mathematics. For instance, linear algebra is fundamental in modern presentations of geometry, including for defining basic objects such as lines, planes and rotations. Also, functional analysis, a branch of mathematical analysis, may be viewed as the application of linear algebra to spaces of functions. Linear algebra is also used in most sciences and fields of engineering, because it allows modeling many natural phenomena, and computing efficiently with such models. For nonlinear systems, which cannot be modeled with linear algebra, it is often used for dealing with first-order approximations, using the fact that the differential of a multivariate function at a point is the linear ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matroid
In combinatorics, a branch of mathematics, a matroid is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid axiomatically, the most significant being in terms of: independent sets; bases or circuits; rank functions; closure operators; and closed sets or flats. In the language of partially ordered sets, a finite matroid is equivalent to a geometric lattice. Matroid theory borrows extensively from the terminology of both linear algebra and graph theory, largely because it is the abstraction of various notions of central importance in these fields. Matroids have found applications in geometry, topology, combinatorial optimization, network theory and coding theory. Definition There are many equivalent ( cryptomorphic) ways to define a (finite) matroid.A standard source for basic definitions and results about matroids is Oxley (1992). An older standard source is Welsh (1976). See Brylawsk ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Metric Tree
A metric tree is any tree data structure specialized to index data in metric spaces. Metric trees exploit properties of metric spaces such as the triangle inequality to make accesses to the data more efficient. Examples include the M-tree, vp-trees, cover trees, MVP trees, and BK-trees. Multidimensional search Most algorithms and data structures for searching a dataset are based on the classical binary search algorithm, and generalizations such as the k-d tree or range tree work by interleaving the binary search algorithm over the separate coordinates and treating each spatial coordinate as an independent search constraint. These data structures are well-suited for range query problems asking for every point (x,y) that satisfies \mbox_x \leq x \leq \mbox_x and \mbox_y \leq y \leq \mbox_y. A limitation of these multidimensional search structures is that they are only defined for searching over objects that can be treated as vectors. They aren't applicable for the more ge ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Neighbor Joining
In bioinformatics, neighbor joining is a bottom-up (agglomerative) clustering method for the creation of phylogenetic trees, created by Naruya Saitou and Masatoshi Nei in 1987. Usually based on DNA or protein sequence data, the algorithm requires knowledge of the distance between each pair of taxa (e.g., species or sequences) to create the phylogenetic tree. The algorithm Neighbor joining takes a distance matrix, which specifies the distance between each pair of taxa, as input. The algorithm starts with a completely unresolved tree, whose topology corresponds to that of a star network, and iterates over the following steps, until the tree is completely resolved, and all branch lengths are known: # Based on the current distance matrix, calculate a matrix Q (defined below). # Find the pair of distinct taxa i and j (i.e. with i \neq j) for which Q(i,j) is smallest. Make a new node that joins the taxa i and j, and connect the new node to the central node. For example, in part (B ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grassmannian
In mathematics, the Grassmannian is a space that parameterizes all -Dimension, dimensional linear subspaces of the -dimensional vector space . For example, the Grassmannian is the space of lines through the origin in , so it is the same as the projective space of one dimension lower than . When is a real or complex vector space, Grassmannians are compact space, compact smooth manifolds. In general they have the structure of a smooth algebraic variety, of dimension k(n-k). The earliest work on a non-trivial Grassmannian is due to Julius Plücker, who studied the set of projective lines in projective 3-space, equivalent to and parameterized them by what are now called Plücker coordinates. Hermann Grassmann later introduced the concept in general. Notations for the Grassmannian vary between authors; notations include , , , or to denote the Grassmannian of -dimensional subspaces of an -dimensional vector space . Motivation By giving a collection of subspaces of some vecto ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Intersection Theory
In mathematics, intersection theory is one of the main branches of algebraic geometry, where it gives information about the intersection of two subvarieties of a given variety. The theory for varieties is older, with roots in Bézout's theorem on curves and elimination theory. On the other hand, the topological theory more quickly reached a definitive form. There is yet an ongoing development of intersection theory. Currently the main focus is on: virtual fundamental cycles, quantum intersection rings, Gromov-Witten theory and the extension of intersection theory from schemes to stacks. Topological intersection form For a connected oriented manifold of dimension the intersection form is defined on the -th cohomology group (what is usually called the 'middle dimension') by the evaluation of the cup product on the fundamental class in . Stated precisely, there is a bilinear form :\lambda_M \colon H^n(M,\partial M) \times H^n(M,\partial M)\to \mathbf given by :\lambda ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
