|
Nerve Of A Covering
In topology, the nerve complex of a set family is an abstract complex that records the pattern of intersections between the sets in the family. It was introduced by Pavel Alexandrov and now has many variants and generalisations, among them the Čech nerve of a cover, which in turn is generalised by hypercoverings. It captures many of the interesting topological properties in an algorithmic or combinatorial way. Basic definition Let I be a set of indices and C be a family of sets (U_i)_. The nerve of C is a set of finite subsets of the index set ''I''. It contains all finite subsets J\subseteq I such that the intersection of the U_i whose subindices are in J is non-empty:'', Section 4.3'' :N(C) := \bigg\. In Alexandrov's original definition, the sets (U_i)_ are open subsets of some topological space X. The set N(C) may contain singletons (elements i \in I such that U_i is non-empty), pairs (pairs of elements i,j \in I such that U_i \cap U_j \neq \emptyset), triplets, and so on. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Constructing Nerve
Construction is a general term meaning the art and science to form objects, systems, or organizations,"Construction" def. 1.a. 1.b. and 1.c. ''Oxford English Dictionary'' Second Edition on CD-ROM (v. 4.0) Oxford University Press 2009 and comes from Latin ''constructio'' (from ''com-'' "together" and ''struere'' "to pile up") and Old French ''construction''. To construct is the verb: the act of building, and the noun is construction: how something is built, the nature of its structure. In its most widely used context, construction covers the processes involved in delivering buildings, infrastructure, industrial facilities and associated activities through to the end of their life. It typically starts with planning, financing, and design, and continues until the asset is built and ready for use; construction also covers repairs and maintenance work, any works to expand, extend and improve the asset, and its eventual demolition, dismantling or decommissioning. The construction i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jean Leray
Jean Leray (; 7 November 1906 – 10 November 1998) was a French mathematician, who worked on both partial differential equations and algebraic topology. Life and career He was born in Chantenay-sur-Loire (today part of Nantes). He studied at École Normale Supérieure from 1926 to 1929. He received his Ph.D. in 1933. In 1934 Leray published an important paper that founded the study of weak solutions of the Navier–Stokes equations. In the same year, he and Juliusz Schauder discovered a topological invariant, now called the Leray–Schauder degree, which they applied to prove the existence of solutions for partial differential equations lacking uniqueness. From 1938 to 1939 he was professor at the University of Nancy. He did not join the Bourbaki group, although he was close with its founders. His main work in topology was carried out while he was in a prisoner of war camp in Edelbach, Austria from 1940 to 1945. He concealed his expertise on differential equations, fearing th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hypercovering
In mathematics, and in particular homotopy theory, a hypercovering (or hypercover) is a simplicial object that generalises the Čech nerve of a cover. For the Čech nerve of an open cover one can show that if the space X is compact and if every intersection of open sets in the cover is contractible, then one can contract these sets and get a simplicial set that is weakly equivalent to X in a natural way. For the étale topology and other sites, these conditions fail. The idea of a hypercover is to instead of only working with n-fold intersections of the sets of the given open cover \mathcal U, to allow the pairwise intersections of the sets in \mathcal U=\mathcal U_0 to be covered by an open cover \mathcal U_1, and to let the triple intersections of this cover to be covered by yet another open cover \mathcal U_2, and so on, iteratively. Hypercoverings have a central role in étale homotopy and other areas where homotopy theory is applied to algebraic geometry, such as motivic homoto ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Trivial Group
In mathematics, a trivial group or zero group is a group consisting of a single element. All such groups are isomorphic, so one often speaks of the trivial group. The single element of the trivial group is the identity element and so it is usually denoted as such: 0, 1, or e depending on the context. If the group operation is denoted \, \cdot \, then it is defined by e \cdot e = e. The similarly defined is also a group since its only element is its own inverse, and is hence the same as the trivial group. The trivial group is distinct from the empty set, which has no elements, hence lacks an identity element, and so cannot be a group. Definitions Given any group G, the group consisting of only the identity element is a subgroup of G, and, being the trivial group, is called the of G. The term, when referred to "G has no nontrivial proper subgroups" refers to the only subgroups of G being the trivial group \ and the group G itself. Properties The trivial group is cyclic ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reduced Homology
In mathematics, reduced homology is a minor modification made to homology theory in algebraic topology, motivated by the intuition that all of the homology groups of a single point should be equal to zero. This modification allows more concise statements to be made (as in Alexander duality) and eliminates many exceptional cases (as in the homology groups of spheres). If ''P'' is a single-point space, then with the usual definitions the integral homology group :''H''0(''P'') is isomorphic to \mathbb (an infinite cyclic group), while for ''i'' ≥ 1 we have :''H''''i''(''P'') = . More generally if ''X'' is a simplicial complex or finite CW complex, then the group ''H''0(''X'') is the free abelian group with the connected components of ''X'' as generators. The reduced homology should replace this group, of rank ''r'' say, by one of rank ''r'' − 1. Otherwise the homology groups should remain unchanged. An ''ad hoc'' way to do this is to think of a 0-th homology class not ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Combinatorica
''Combinatorica'' is an international journal of mathematics, publishing papers in the fields of combinatorics and computer science. It started in 1981, with László Babai and László Lovász as the editors-in-chief with Paul Erdős as honorary editor-in-chief. The current editors-in-chief are Imre Bárány and József Solymosi. The advisory board consists of Ronald Graham, Gyula O. H. Katona, Miklós Simonovits, Vera Sós, and Endre Szemerédi. It is published by the János Bolyai Mathematical Society and Springer Verlag. The following members of the '' Hungarian School of Combinatorics'' have strongly contributed to the journal as authors, or have served as editors: Miklós Ajtai, László Babai, József Beck, András Frank, Péter Frankl, Zoltán Füredi, András Hajnal, Gyula Katona, László Lovász, László Pyber, Alexander Schrijver, Miklós Simonovits, Vera Sós, Endre Szemerédi, Tamás Szőnyi, Éva Tardos, Gábor Tardos.{{cite web, url=https://www.springer.com/ma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homology Groups
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] |
Homotopy Group
In mathematics, homotopy groups are used in algebraic topology to classify topological spaces. The first and simplest homotopy group is the fundamental group, denoted \pi_1(X), which records information about loops in a space. Intuitively, homotopy groups record information about the basic shape, or ''holes'', of a topological space. To define the ''n''-th homotopy group, the base-point-preserving maps from an ''n''-dimensional sphere (with base point) into a given space (with base point) are collected into equivalence classes, called homotopy classes. Two mappings are homotopic if one can be continuously deformed into the other. These homotopy classes form a group, called the ''n''-th homotopy group, \pi_n(X), of the given space ''X'' with base point. Topological spaces with differing homotopy groups are never equivalent ( homeomorphic), but topological spaces that homeomorphic have the same homotopy groups. The notion of homotopy of paths was introduced by Camille Jordan. I ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
N-connected Space
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] |
Journal Of Combinatorial Theory
The ''Journal of Combinatorial Theory'', Series A and Series B, are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. ''Series A'' is concerned primarily with structures, designs, and applications of combinatorics. ''Series B'' is concerned primarily with graph and matroid theory. The two series are two of the leading journals in the field and are widely known as ''JCTA'' and ''JCTB''. The journal was founded in 1966 by Frank Harary and Gian-Carlo Rota.They are acknowledged on the journals' title pages and Web sites. SeEditorial board of JCTA Originally there was only one journal, which was split into two parts in 1971 as the field grew rapidly. An electronic, [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Anders Björner
Anders Björner (born 17 December 1947) received his Ph.D. from Stockholm University in 1979, under Bernt Lindström. He is a Sweden, Swedish professor of mathematics, in the Department of Mathematics at the Royal Institute of Technology, Stockholm, Sweden. His research interests are in combinatorics, as well as the related areas of algebra, geometry, topology, and computer science. His other positions included being director of the Mittag-Leffler Institute and editor-in-chief of ''Acta Mathematica''. Björner is a recognized expert in algebraic combinatorics, algebraic and topological combinatorics. [...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] |
