Coxeter Complex
In mathematics, the Coxeter complex, named after H. S. M. Coxeter, is a geometrical structure (a simplicial complex) associated to a Coxeter group. Coxeter complexes are the basic objects that allow the construction of buildings; they form the apartments of a building. Construction The canonical linear representation The first ingredient in the construction of the Coxeter complex associated to a Coxeter system (W,S) is a certain representation of W, called the canonical representation of W. Let (W,S) be a Coxeter system with Coxeter matrix M = (m(s,t))_. The canonical representation is given by a vector space V with basis of formal symbols (e_s)_, which is equipped with the symmetric bilinear form B(e_s,e_t) = - \cos \left ( \frac \right ). In particular, B(e_s,e_s)=1. The action of W on V is then given by s(v) = v - 2 B(e_s,v)e_s. This representation has several foundational properties in the theory of Coxeter groups; for instance, B is positive definite if and only if W i ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Simplicial Complex
In mathematics, a simplicial complex is a set composed of points, line segments, triangles, and their ''n''-dimensional counterparts (see illustration). Simplicial complexes should not be confused with the more abstract notion of a simplicial set appearing in modern simplicial homotopy theory. The purely combinatorial counterpart to a simplicial complex is an abstract simplicial complex. To distinguish a simplicial from an abstract simplicial complex, the former is often called a geometric simplicial complex.'', Section 4.3'' Definitions A simplicial complex \mathcal is a set of simplices that satisfies the following conditions: :1. Every face of a simplex from \mathcal is also in \mathcal. :2. The non-empty intersection of any two simplices \sigma_1, \sigma_2 \in \mathcal is a face of both \sigma_1 and \sigma_2. See also the definition of an abstract simplicial complex, which loosely speaking is a simplicial complex without an associated geometry. A simplicial ''k''-com ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Poset
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set. A poset consists of a set together with a binary relation indicating that, for certain pairs of elements in the set, one of the elements precedes the other in the ordering. The relation itself is called a "partial order." The word ''partial'' in the names "partial order" and "partially ordered set" is used as an indication that not every pair of elements needs to be comparable. That is, there may be pairs of elements for which neither element precedes the other in the poset. Partial orders thus generalize total orders, in which every pair is comparable. Informal definition A partial order defines a notion of comparison. Two elements ''x'' and ''y'' may stand in any of four mutually exclusive relationships to each other: either ''x'' ''y'', or ''x'' and ''y'' are ''incompara ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Algebraic Combinatorics
Algebraic combinatorics is an area of mathematics that employs methods of abstract algebra, notably group theory and representation theory, in various combinatorial contexts and, conversely, applies combinatorial techniques to problems in algebra. History The term "algebraic combinatorics" was introduced in the late 1970s. Through the early or mid-1990s, typical combinatorial objects of interest in algebraic combinatorics either admitted a lot of symmetries ( association schemes, strongly regular graphs, posets with a group action) or possessed a rich algebraic structure, frequently of representation theoretic origin ( symmetric functions, Young tableaux). This period is reflected in the area 05E, ''Algebraic combinatorics'', of the AMS Mathematics Subject Classification, introduced in 1991. Scope Algebraic combinatorics has come to be seen more expansively as an area of mathematics where the interaction of combinatorial and algebraic methods is particularly strong and signi ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Coxeter Groups
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups , and finite Coxeter groups were classified in 1935 . Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the symmetry groups of regular polytopes, and the Weyl groups of simple Lie algebras. Examples of infinite Coxeter groups include the triangle groups corresponding to regular tessellations of the Euclidean plane and the hyperbolic plane, and the Weyl groups of infinite-dimensional Kac–Moody algebras. Stan ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Group Theory
In abstract algebra, group theory studies the algebraic structures known as group (mathematics), groups. The concept of a group is central to abstract algebra: other well-known algebraic structures, such as ring (mathematics), rings, field (mathematics), fields, and vector spaces, can all be seen as groups endowed with additional operation (mathematics), operations and axioms. Groups recur throughout mathematics, and the methods of group theory have influenced many parts of algebra. Linear algebraic groups and Lie groups are two branches of group theory that have experienced advances and have become subject areas in their own right. Various physical systems, such as crystals and the hydrogen atom, and Standard Model, three of the four known fundamental forces in the universe, may be modelled by symmetry groups. Thus group theory and the closely related representation theory have many important applications in physics, chemistry, and materials science. Group theory is also ce ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Kenneth Brown (mathematician)
Kenneth Stephen Brown (born 1945) is a professor of mathematics at Cornell University, working in category theory and cohomology theory. Among other things, he is known for Ken Brown's lemma in the theory of model categories. He is also the author of the book ''Cohomology of Groups'' (Graduate Texts in Mathematics 87, Springer, 1982). Brown earned his Ph.D. in 1971 from the Massachusetts Institute of Technology, under the supervision of Daniel Quillen, with thesis ''Abstract Homotopy Theory and Generalized Sheaf Cohomology''. He was an invited speaker at the International Congress of Mathematicians in 1978 in Helsinki. In 2012 he became a fellow of the American Mathematical Society The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, .... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Root System
In mathematics, a root system is a configuration of vectors in a Euclidean space satisfying certain geometrical properties. The concept is fundamental in the theory of Lie groups and Lie algebras, especially the classification and representation theory of semisimple Lie algebras. Since Lie groups (and some analogues such as algebraic groups) and Lie algebras have become important in many parts of mathematics during the twentieth century, the apparently special nature of root systems belies the number of areas in which they are applied. Further, the classification scheme for root systems, by Dynkin diagrams, occurs in parts of mathematics with no overt connection to Lie theory (such as singularity theory). Finally, root systems are important for their own sake, as in spectral graph theory. Definitions and examples As a first example, consider the six vectors in 2-dimensional Euclidean space, R2, as shown in the image at the right; call them roots. These vectors span the ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Weyl Group
In mathematics, in particular the theory of Lie algebras, the Weyl group (named after Hermann Weyl) of a root system Φ is a subgroup of the isometry group of that root system. Specifically, it is the subgroup which is generated by reflections through the hyperplanes orthogonal to the roots, and as such is a finite reflection group. In fact it turns out that ''most'' finite reflection groups are Weyl groups. Abstractly, Weyl groups are finite Coxeter groups, and are important examples of these. The Weyl group of a semisimple Lie group, a semisimple Lie algebra, a semisimple linear algebraic group, etc. is the Weyl group of the root system of that group or algebra. Definition and examples Let \Phi be a root system in a Euclidean space V. For each root \alpha\in\Phi, let s_\alpha denote the reflection about the hyperplane perpendicular to \alpha, which is given explicitly as :s_\alpha(v)=v-2\frac\alpha, where (\cdot,\cdot) is the inner product on V. The Weyl group W of \Phi ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Building (mathematics)
In mathematics, a building (also Tits building, named after Jacques Tits) is a combinatorial and geometric structure which simultaneously generalizes certain aspects of flag manifolds, finite projective planes, and Riemannian symmetric spaces. Buildings were initially introduced by Jacques Tits as a means to understand the structure of exceptional groups of Lie type. The more specialized theory of Bruhat–Tits buildings (named also after François Bruhat) plays a role in the study of -adic Lie groups analogous to that of the theory of symmetric spaces in the theory of Lie groups. Overview The notion of a building was invented by Jacques Tits as a means of describing simple algebraic groups over an arbitrary field. Tits demonstrated how to every such group one can associate a simplicial complex with an action of , called the spherical building of . The group imposes very strong combinatorial regularity conditions on the complexes that can arise in this fashion. B ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Contractible Space
In mathematics, a topological space ''X'' is contractible if the identity map on ''X'' is null-homotopic, i.e. if it is homotopic to some constant map. Intuitively, a contractible space is one that can be continuously shrunk to a point within that space. Properties A contractible space is precisely one with the homotopy type of a point. It follows that all the homotopy groups of a contractible space are trivial. Therefore any space with a nontrivial homotopy group cannot be contractible. Similarly, since singular homology is a homotopy invariant, the reduced homology groups of a contractible space are all trivial. For a topological space ''X'' the following are all equivalent: *''X'' is contractible (i.e. the identity map is null-homotopic). *''X'' is homotopy equivalent to a one-point space. *''X'' deformation retracts onto a point. (However, there exist contractible spaces which do not ''strongly'' deformation retract to a point.) *For any space ''Y'', any two maps ''f ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Affine Dihedral Complex
Affine may describe any of various topics concerned with connections or affinities. It may refer to: * Affine, a relative by marriage in law and anthropology * Affine cipher, a special case of the more general substitution cipher * Affine combination, a certain kind of constrained linear combination * Affine connection, a connection on the tangent bundle of a differentiable manifold * Affine Coordinate System, a coordinate system that can be viewed as a Cartesian coordinate system where the axes have been placed so that they are not necessarily orthogonal to each other. See tensor. * Affine differential geometry, a geometry that studies differential invariants under the action of the special affine group * Affine gap penalty, the most widely used scoring function used for sequence alignment, especially in bioinformatics * Affine geometry, a geometry characterized by parallel lines * Affine group, the group of all invertible affine transformations from any affine space over ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |
|
Coxeter Group
In mathematics, a Coxeter group, named after H. S. M. Coxeter, is an abstract group that admits a formal description in terms of reflections (or kaleidoscopic mirrors). Indeed, the finite Coxeter groups are precisely the finite Euclidean reflection groups; the symmetry groups of regular polyhedra are an example. However, not all Coxeter groups are finite, and not all can be described in terms of symmetries and Euclidean reflections. Coxeter groups were introduced in 1934 as abstractions of reflection groups , and finite Coxeter groups were classified in 1935 . Coxeter groups find applications in many areas of mathematics. Examples of finite Coxeter groups include the symmetry groups of regular polytopes, and the Weyl groups of simple Lie algebras. Examples of infinite Coxeter groups include the triangle groups corresponding to regular tessellations of the Euclidean plane and the hyperbolic plane, and the Weyl groups of infinite-dimensional Kac–Moody algebras. S ... [...More Info...]       [...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]   |