|
Finite Map (other)
A finite map can be one of the following: * In computer science, finite map is a synonym for an associative array In computer science, an associative array, map, symbol table, or dictionary is an abstract data type that stores a collection of (key, value) pairs, such that each possible key appears at most once in the collection. In mathematical terms an .... * A finite map in algebraic geometry is a regular map such that the preimage of any point is a finite set, plus a closedness property. {{disambig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Computer Science
Computer science is the study of computation, automation, and information. Computer science spans theoretical disciplines (such as algorithms, theory of computation, information theory, and automation) to practical disciplines (including the design and implementation of hardware and software). Computer science is generally considered an area of academic research and distinct from computer programming. Algorithms and data structures are central to computer science. The theory of computation concerns abstract models of computation and general classes of problems that can be solved using them. The fields of cryptography and computer security involve studying the means for secure communication and for preventing security vulnerabilities. Computer graphics and computational geometry address the generation of images. Programming language theory considers different ways to describe computational processes, and database theory concerns the management of repositories ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Synonym
A synonym is a word, morpheme, or phrase that means exactly or nearly the same as another word, morpheme, or phrase in a given language. For example, in the English language, the words ''begin'', ''start'', ''commence'', and ''initiate'' are all synonyms of one another: they are ''synonymous''. The standard test for synonymy is substitution: one form can be replaced by another in a sentence without changing its meaning. Words are considered synonymous in only one particular sense: for example, ''long'' and ''extended'' in the context ''long time'' or ''extended time'' are synonymous, but ''long'' cannot be used in the phrase ''extended family''. Synonyms with exactly the same meaning share a seme or denotational sememe, whereas those with inexactly similar meanings share a broader denotational or connotational sememe and thus overlap within a semantic field. The former are sometimes called cognitive synonyms and the latter, near-synonyms, plesionyms or poecilonyms. Lexicogr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Associative Array
In computer science, an associative array, map, symbol table, or dictionary is an abstract data type that stores a collection of (key, value) pairs, such that each possible key appears at most once in the collection. In mathematical terms an associative array is a function with ''finite'' domain. It supports 'lookup', 'remove', and 'insert' operations. The dictionary problem is the classic problem of designing efficient data structures that implement associative arrays. The two major solutions to the dictionary problem are hash tables and search trees..Dietzfelbinger, M., Karlin, A., Mehlhorn, K., Meyer auf der Heide, F., Rohnert, H., and Tarjan, R. E. 1994"Dynamic Perfect Hashing: Upper and Lower Bounds". SIAM J. Comput. 23, 4 (Aug. 1994), 738-761. http://portal.acm.org/citation.cfm?id=182370 In some cases it is also possible to solve the problem using directly addressed arrays, binary search trees, or other more specialized structures. Many programming languages inclu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Finite Map (algebraic Geometry)
In algebraic geometry, a finite morphism between two affine varieties X, Y is a dense regular map which induces isomorphic inclusion k\left \righthookrightarrow k\left \right/math> between their coordinate rings, such that k\left \right/math> is integral over k\left \right/math>. This definition can be extended to the quasi-projective varieties, such that a regular map f\colon X\to Y between quasiprojective varieties is finite if any point like y\in Y has an affine neighbourhood V such that U=f^(V) is affine and f\colon U\to V is a finite map (in view of the previous definition, because it is between affine varieties). Definition by Schemes A morphism ''f'': ''X'' → ''Y'' of schemes is a finite morphism if ''Y'' has an open cover by affine schemes :V_i = \mbox \; B_i such that for each ''i'', :f^(V_i) = U_i is an open affine subscheme Spec ''A''''i'', and the restriction of ''f'' to ''U''''i'', which induces a ring homomorphism :B_i \rightarrow A_i, makes ''A''''i'' a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Algebraic Geometry
Algebraic geometry is a branch of mathematics, classically studying zeros of multivariate polynomials. Modern algebraic geometry is based on the use of abstract algebraic techniques, mainly from commutative algebra, for solving geometrical problems about these sets of zeros. The fundamental objects of study in algebraic geometry are algebraic varieties, which are geometric manifestations of solutions of systems of polynomial equations. Examples of the most studied classes of algebraic varieties are: plane algebraic curves, which include lines, circles, parabolas, ellipses, hyperbolas, cubic curves like elliptic curves, and quartic curves like lemniscates and Cassini ovals. A point of the plane belongs to an algebraic curve if its coordinates satisfy a given polynomial equation. Basic questions involve the study of the points of special interest like the singular points, the inflection points and the points at infinity. More advanced questions involve the topo ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Map (algebraic Geometry)
In algebraic geometry, a morphism between algebraic varieties is a function between the varieties that is given locally by polynomials. It is also called a regular map. A morphism from an algebraic variety to the affine line is also called a regular function. A regular map whose inverse is also regular is called biregular, and they are isomorphisms in the category of algebraic varieties. Because regular and biregular are very restrictive conditions – there are no non-constant regular functions on projective varieties – the weaker condition of a rational map and birational maps are frequently used as well. Definition If ''X'' and ''Y'' are closed subvarieties of \mathbb^n and \mathbb^m (so they are affine varieties), then a regular map f\colon X\to Y is the restriction of a polynomial map \mathbb^n\to \mathbb^m. Explicitly, it has the form: :f = (f_1, \dots, f_m) where the f_is are in the coordinate ring of ''X'': :k = k _1, \dots, x_nI, where ''I'' is the ideal defining ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
