|
Chessboard Complex
A chessboard complex is a particular kind of abstract simplicial complex, which has various applications in topological graph theory and algebraic topology. Informally, the (''m'', ''n'')-chessboard complex contains all sets of positions on an ''m''-by-''n'' chessboard, where Rook (chess), rooks can be placed without attacking each other. Equivalently, it is the matching complex of the (''m'', ''n'')-complete bipartite graph, or the independence complex of the ''m''-by-''n'' rook's graph. Definitions For any two positive integers ''m'' and ''n'', the (''m, n'')-chessboard complex \Delta_ is the abstract simplicial complex with vertex set [m]\times [n] that contains all subsets ''S'' such that, if (i_1,j_1) and (i_2,j_2) are two distinct elements of ''S'', then both i_1\neq i_2 and j_1\neq j_2. The vertex set can be viewed as a two-dimensional grid (a "chessboard"), and the complex contains all subsets ''S'' that do ''not'' contain two cells in the same row or in the same column. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Abstract Simplicial Complex
In combinatorics, an abstract simplicial complex (ASC), often called an abstract complex or just a complex, is a family of sets that is closed under taking subsets, i.e., every subset of a set in the family is also in the family. It is a purely combinatorial description of the geometric notion of a simplicial complex. Lee, John M., Introduction to Topological Manifolds, Springer 2011, , p153 For example, in a 2-dimensional simplicial complex, the sets in the family are the triangles (sets of size 3), their edges (sets of size 2), and their vertices (sets of size 1). In the context of matroids and greedoids, abstract simplicial complexes are also called independence systems. An abstract simplex can be studied algebraically by forming its Stanley–Reisner ring; this sets up a powerful relation between combinatorics and commutative algebra. Definitions A collection of non-empty finite subsets of a set ''S'' is called a set-family. A set-family is called an abstract simplicial c ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Manifold
In mathematics, a manifold is a topological space that locally resembles Euclidean space near each point. More precisely, an n-dimensional manifold, or ''n-manifold'' for short, is a topological space with the property that each point has a neighborhood that is homeomorphic to an open subset of n-dimensional Euclidean space. One-dimensional manifolds include lines and circles, but not lemniscates. Two-dimensional manifolds are also called surfaces. Examples include the plane, the sphere, and the torus, and also the Klein bottle and real projective plane. The concept of a manifold is central to many parts of geometry and modern mathematical physics because it allows complicated structures to be described in terms of well-understood topological properties of simpler spaces. Manifolds naturally arise as solution sets of systems of equations and as graphs of functions. The concept has applications in computer-graphics given the need to associate pictures with coordinates (e.g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Matching In Hypergraphs
In graph theory, a matching in a hypergraph is a set of hyperedges, in which every two hyperedges are disjoint. It is an extension of the notion of matching in a graph. Definition Recall that a hypergraph is a pair , where is a set of vertices and is a set of subsets of called ''hyperedges''. Each hyperedge may contain one or more vertices. A matching in is a subset of , such that every two hyperedges and in have an empty intersection (have no vertex in common). The matching number of a hypergraph is the largest size of a matching in . It is often denoted by . As an example, let be the set Consider a 3-uniform hypergraph on (a hypergraph in which each hyperedge contains exactly 3 vertices). Let be a 3-uniform hypergraph with 4 hyperedges: : Then admits several matchings of size 2, for example: : : However, in any subset of 3 hyperedges, at least two of them intersect, so there is no matching of size 3. Hence, the matching number of is 2. Intersec ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Vertex Decomposable
Vertex, vertices or vertexes may refer to: Science and technology Mathematics and computer science *Vertex (geometry), a point where two or more curves, lines, or edges meet *Vertex (computer graphics), a data structure that describes the position of a point *Vertex (curve), a point of a plane curve where the first derivative of curvature is zero *Vertex (graph theory), the fundamental unit of which graphs are formed *Vertex (topography), in a triangulated irregular network *Vertex of a representation, in finite group theory Physics * Vertex (physics), the reconstructed location of an individual particle collision * Vertex (optics), a point where the optical axis crosses an optical surface *Vertex function, describing the interaction between a photon and an electron Biology and anatomy *Vertex (anatomy), the highest point of the head *Vertex (urinary bladder), alternative name of the apex of urinary bladder * Vertex distance, the distance between the surface of the cornea of the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cyclic Group
In group theory, a branch of abstract algebra in pure mathematics, a cyclic group or monogenous group is a group, denoted C''n'', that is generated by a single element. That is, it is a set of invertible elements with a single associative binary operation, and it contains an element ''g'' such that every other element of the group may be obtained by repeatedly applying the group operation to ''g'' or its inverse. Each element can be written as an integer power of ''g'' in multiplicative notation, or as an integer multiple of ''g'' in additive notation. This element ''g'' is called a ''generator'' of the group. Every infinite cyclic group is isomorphic to the additive group of Z, the integers. Every finite cyclic group of order ''n'' is isomorphic to the additive group of Z/''n''Z, the integers modulo ''n''. Every cyclic group is an abelian group (meaning that its group operation is commutative), and every finitely generated abelian group ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
3-group
In mathematics, specifically group theory, given a prime number ''p'', a ''p''-group is a group in which the order of every element is a power of ''p''. That is, for each element ''g'' of a ''p''-group ''G'', there exists a nonnegative integer ''n'' such that the product of ''pn'' copies of ''g'', and not fewer, is equal to the identity element. The orders of different elements may be different powers of ''p''. Abelian ''p''-groups are also called ''p''-primary or simply primary. A finite group is a ''p''-group if and only if its order (the number of its elements) is a power of ''p''. Given a finite group ''G'', the Sylow theorems guarantee the existence of a subgroup of ''G'' of order ''pn'' for every prime power ''pn'' that divides the order of ''G''. Every finite ''p''-group is nilpotent. The remainder of this article deals with finite ''p''-groups. For an example of an infinite abelian ''p''-group, see Prüfer group, and for an example of an infinite simple ''p''-g ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homology Group
In mathematics, homology is a general way of associating a sequence of algebraic objects, such as abelian groups or modules, with other mathematical objects such as topological spaces. Homology groups were originally defined in algebraic topology. Similar constructions are available in a wide variety of other contexts, such as abstract algebra, groups, Lie algebras, Galois theory, and algebraic geometry. The original motivation for defining homology groups was the observation that two shapes can be distinguished by examining their holes. For instance, a circle is not a disk because the circle has a hole through it while the disk is solid, and the ordinary sphere is not a circle because the sphere encloses a two-dimensional hole while the circle encloses a one-dimensional hole. However, because a hole is "not there", it is not immediately obvious how to define a hole or how to distinguish different kinds of holes. Homology was originally a rigorous mathematical method for defi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Advances In Mathematics
''Advances in Mathematics'' is a peer-reviewed scientific journal covering research on pure mathematics. It was established in 1961 by Gian-Carlo Rota. The journal publishes 18 issues each year, in three volumes. At the origin, the journal aimed at publishing articles addressed to a broader "mathematical community", and not only to mathematicians in the author's field. Herbert Busemann writes, in the preface of the first issue, "The need for expository articles addressing either all mathematicians or only those in somewhat related fields has long been felt, but little has been done outside of the USSR. The serial publication ''Advances in Mathematics'' was created in response to this demand." Abstracting and indexing The journal is abstracted and indexed in: * |
Combinatorial Laplacian
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in 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] |
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] |
Homotopical Connectivity
In algebraic topology, homotopical connectivity is a property describing a topological space based on the dimension of its holes. In general, low homotopical connectivity indicates that the space has at least one low-dimensional hole. The concept of ''n''-connectedness generalizes the concepts of path-connectedness and simple connectedness. An equivalent definition of homotopical connectivity is based on the homotopy groups of the space. A space is ''n''-connected (or ''n''-simple connected) if its first ''n'' homotopy groups are trivial. Homotopical connectivity is defined for maps, too. A map is ''n''-connected if it is an isomorphism "up to dimension ''n,'' in homotopy". Definition using holes All definitions below consider a topological space ''X''. A hole in ''X'' is, informally, a thing that prevents some suitably-placed sphere from continuously shrinking to a point., Section 4.3 Equivalently, it is a sphere that cannot be continuously extended to a ball. Formally ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
