|
Transversal (combinatorics)
In mathematics, particularly in combinatorics, given a family of sets, here called a collection ''C'', a transversal (also called a cross-section) is a set containing exactly one element from each member of the collection. When the sets of the collection are mutually disjoint, each element of the transversal corresponds to exactly one member of ''C'' (the set it is a member of). If the original sets are not disjoint, there are two possibilities for the definition of a transversal: * One variation is that there is a bijection ''f'' from the transversal to ''C'' such that ''x'' is an element of ''f''(''x'') for each ''x'' in the transversal. In this case, the transversal is also called a system of distinct representatives (SDR). * The other, less commonly used, does not require a one-to-one relation between the elements of the transversal and the sets of ''C''. In this situation, the members of the system of representatives are not necessarily distinct. In computer science, comp ... [...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 t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Equivalence Class
In mathematics, when the elements of some set S have a notion of equivalence (formalized as an equivalence relation), then one may naturally split the set S into equivalence classes. These equivalence classes are constructed so that elements a and b belong to the same equivalence class if, and only if, they are equivalent. Formally, given a set S and an equivalence relation \,\sim\, on S, the of an element a in S, denoted by is the set \ of elements which are equivalent to a. It may be proven, from the defining properties of equivalence relations, that the equivalence classes form a partition of S. This partition—the set of equivalence classes—is sometimes called the quotient set or the quotient space of S by \,\sim\,, and is denoted by S / \sim. When the set S has some structure (such as a group operation or a topology) and the equivalence relation \,\sim\, is compatible with this structure, the quotient set often inherits a similar structure from its parent set. Exa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polish Space
In the mathematical discipline of general topology, a Polish space is a separable completely metrizable topological space; that is, a space homeomorphic to a complete metric space that has a countable dense subset. Polish spaces are so named because they were first extensively studied by Polish topologists and logicians— Sierpiński, Kuratowski, Tarski and others. However, Polish spaces are mostly studied today because they are the primary setting for descriptive set theory, including the study of Borel equivalence relations. Polish spaces are also a convenient setting for more advanced measure theory, in particular in probability theory. Common examples of Polish spaces are the real line, any separable Banach space, the Cantor space, and the Baire space. Additionally, some spaces that are not complete metric spaces in the usual metric may be Polish; e.g., the open interval (0, 1) is Polish. Between any two uncountable Polish spaces, there is a Borel isomorphism; t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Perfect Set
In general topology, a subset of a topological space is perfect if it is closed and has no isolated points. Equivalently: the set S is perfect if S=S', where S' denotes the set of all Limit point, limit points of S, also known as the derived set of S. In a perfect set, every point can be approximated arbitrarily well by other points from the set: given any point of S and any neighborhood of the point, there is another point of S that lies within the neighborhood. Furthermore, any point of the space that can be so approximated by points of S belongs to S. Note that the term ''perfect space'' is also used, incompatibly, to refer to other properties of a topological space, such as being a Gδ space. As another possible source of confusion, also note that having the perfect set property is not the same as being a perfect set. Examples Examples of perfect subsets of the real line \mathbb are the empty set, all closed intervals, the real line itself, and the Cantor set. The ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bernstein Set
In mathematics, a Bernstein set is a subset of the real line that meets every uncountable closed subset of the real line but that contains none of them. A Bernstein set partitions the real line into two pieces in a peculiar way: every measurable set of positive measure meets both the Bernstein set and its complement, as does every set with the property of Baire that is not a meagre set In the mathematical field of general topology, a meagre set (also called a meager set or a set of first category) is a subset of a topological space that is small or negligible in a precise sense detailed below. A set that is not meagre is calle ..... References {{Reflist Descriptive set theory Sets of real numbers ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Independent Set (graph Theory)
In graph theory, an independent set, stable set, coclique or anticlique is a set of vertices in a graph, no two of which are adjacent. That is, it is a set S of vertices such that for every two vertices in S, there is no edge connecting the two. Equivalently, each edge in the graph has at most one endpoint in S. A set is independent if and only if it is a clique in the graph's complement. The size of an independent set is the number of vertices it contains. Independent sets have also been called "internally stable sets", of which "stable set" is a shortening. A maximal independent set is an independent set that is not a proper subset of any other independent set. A maximum independent set is an independent set of largest possible size for a given graph G. This size is called the independence number of ''G'' and is usually denoted by \alpha(G). The optimization problem of finding such a set is called the maximum independent set problem. It is a strongly NP-hard problem. As su ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Rainbow-independent Set
In graph theory, a rainbow-independent set (ISR) is an independent set in a graph, in which each vertex has a different color. Formally, let be a graph, and suppose vertex set is partitioned into subsets , called "colors". A set of vertices is called a rainbow-independent set if it satisfies both the following conditions: * It is an independent set – every two vertices in are not adjacent (there is no edge between them); * It is a rainbow set – contains at most a single vertex from each color . Other terms used in the literature are independent set of representatives, independent transversal, and independent system of representatives. As an example application, consider a faculty with departments, where some faculty members dislike each other. The dean wants to construct a committee with members, one member per department, but without any pair of members who dislike each other. This problem can be presented as finding an ISR in a graph in which the nodes are the f ... [...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] |
Inverse Element
In mathematics, the concept of an inverse element generalises the concepts of opposite () and reciprocal () of numbers. Given an operation denoted here , and an identity element denoted , if , one says that is a left inverse of , and that is a right inverse of . (An identity element is an element such that and for all and for which the left-hand sides are defined.) When the operation is associative, if an element has both a left inverse and a right inverse, then these two inverses are equal and unique; they are called the ''inverse element'' or simply the ''inverse''. Often an adjective is added for specifying the operation, such as in additive inverse, multiplicative inverse, and functional inverse. In this case (associative operation), an invertible element is an element that has an inverse. Inverses are commonly used in groupswhere every element is invertible, and ringswhere invertible elements are also called units. They are also commonly used for operations th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Regular Semigroup
In mathematics, a regular semigroup is a semigroup ''S'' in which every element is regular, i.e., for each element ''a'' in ''S'' there exists an element ''x'' in ''S'' such that . Regular semigroups are one of the most-studied classes of semigroups, and their structure is particularly amenable to study via Green's relations. History Regular semigroups were introduced by J. A. Green in his influential 1951 paper "On the structure of semigroups"; this was also the paper in which Green's relations were introduced. The concept of ''regularity'' in a semigroup was adapted from an analogous condition for rings, already considered by John von Neumann. It was Green's study of regular semigroups which led him to define his celebrated relations. According to a footnote in Green 1951, the suggestion that the notion of regularity be applied to semigroups was first made by David Rees. The term inversive semigroup (French: demi-groupe inversif) was historically used as synonym in the pa ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Full Transformation Semigroup
In algebra, a transformation semigroup (or composition semigroup) is a collection of transformations ( functions from a set to itself) that is closed under function composition. If it includes the identity function, it is a monoid, called a transformation (or composition) monoid. This is the semigroup analogue of a permutation group. A transformation semigroup of a set has a tautological semigroup action on that set. Such actions are characterized by being faithful, i.e., if two elements of the semigroup have the same action, then they are equal. An analogue of Cayley's theorem shows that any semigroup can be realized as a transformation semigroup of some set. In automata theory, some authors use the term ''transformation semigroup'' to refer to a semigroup semigroup action, acting faithfully on a set of "states" different from the semigroup's base set. There is Semigroup action#Transformation semigroups, a correspondence between the two notions. Transformation semigroups and mon ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Codomain
In mathematics, the codomain or set of destination of a function is the set into which all of the output of the function is constrained to fall. It is the set in the notation . The term range is sometimes ambiguously used to refer to either the codomain or image of a function. A codomain is part of a function if is defined as a triple where is called the ''domain'' of , its ''codomain'', and its '' graph''. The set of all elements of the form , where ranges over the elements of the domain , is called the ''image'' of . The image of a function is a subset of its codomain so it might not coincide with it. Namely, a function that is not surjective has elements in its codomain for which the equation does not have a solution. A codomain is not part of a function if is defined as just a graph. For example in set theory it is desirable to permit the domain of a function to be a proper class , in which case there is formally no such thing as a triple . With such a d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
