|
Tits Building
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. By treati ... [...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 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Tree (graph Theory)
In graph theory In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are conne ..., a tree is an undirected graph in which any two Vertex (graph theory), vertices are connected by ''exactly one'' Path (graph theory), path, or equivalently a Connected graph, connected Cycle (graph theory), acyclic undirected graph. A forest is an undirected graph in which any two vertices are connected by ''at most one'' path, or equivalently an acyclic undirected graph, or equivalently a Disjoint union of graphs, disjoint union of trees. A polytreeSee . (or directed tree or oriented treeSee .See . or singly connected networkSee .) is a directed acyclic graph (DAG) whose underlying undirected graph is a tree. A polyforest (or directed forest or oriented forest) is a directed acyclic graph whose underlying undirecte ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Aleksandr Danilovich Aleksandrov
Aleksandr Danilovich Aleksandrov (russian: Алекса́ндр Дани́лович Алекса́ндров, alternative transliterations: ''Alexandr'' or ''Alexander'' (first name), and ''Alexandrov'' (last name)) (4 August 1912 – 27 July 1999) was a Soviet/Russian mathematician, physicist, philosopher and mountaineer. Personal Life Aleksandr Aleksandrov was born in 1912 in Volyn, Ryazan Oblast. His father was a headmaster of a secondary school in St Petersburg and his mother a teacher at said school, thus the young Alekandrov spent a majority of his childhood in the city. His family was old Russian nobility—students noted ancestral portraits which hung in his office. His sisters were Soviet botanist Vera Danilovna Aleksandrov (RU) and Maria Danilovna Aleksandrova, author of the first monograph on gerontopsychology in the USSR. In 1937, he married a student of the Faculty of Physics, Marianna Leonidovna Georg. Together they had two children: Daria (b. 1948) and Daniil (R ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
CAT(k) Space
In mathematics, a \mathbf(k) space, where k is a real number, is a specific type of metric space. Intuitively, triangles in a \operatorname(k) space are "slimmer" than corresponding "model triangles" in a standard space of constant curvature k. In a \operatorname(k) space, the curvature is bounded from above by k. A notable special case is k=0; complete \operatorname(0) spaces are known as "Hadamard spaces" after the French mathematician Jacques Hadamard. Originally, Aleksandrov called these spaces “\mathfrak_k domain”. The terminology \operatorname(k) was coined by Mikhail Gromov in 1987 and is an acronym for Élie Cartan, Aleksandr Danilovich Aleksandrov and Victor Andreevich Toponogov (although Toponogov never explored curvature bounded above in publications). Definitions For a real number k, let M_k denote the unique complete simply connected surface (real 2-dimensional Riemannian manifold) with constant curvature k. Denote by D_k the diameter of M_k, which is \in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hilbert Space
In mathematics, Hilbert spaces (named after David Hilbert) allow generalizing the methods of linear algebra and calculus from (finite-dimensional) Euclidean vector spaces to spaces that may be infinite-dimensional. Hilbert spaces arise naturally and frequently in mathematics and physics, typically as function spaces. Formally, a Hilbert space is a vector space equipped with an inner product that defines a distance function for which the space is a complete metric space. The earliest Hilbert spaces were studied from this point of view in the first decade of the 20th century by David Hilbert, Erhard Schmidt, and Frigyes Riesz. They are indispensable tools in the theories of partial differential equations, quantum mechanics, Fourier analysis (which includes applications to signal processing and heat transfer), and ergodic theory (which forms the mathematical underpinning of thermodynamics). John von Neumann coined the term ''Hilbert space'' for the abstract concept that under ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Orthonormal Basis
In mathematics, particularly linear algebra, an orthonormal basis for an inner product space ''V'' with finite dimension is a basis for V whose vectors are orthonormal, that is, they are all unit vectors and orthogonal to each other. For example, the standard basis for a Euclidean space \R^n is an orthonormal basis, where the relevant inner product is the dot product of vectors. The image of the standard basis under a rotation or reflection (or any orthogonal transformation) is also orthonormal, and every orthonormal basis for \R^n arises in this fashion. For a general inner product space V, an orthonormal basis can be used to define normalized orthogonal coordinates on V. Under these coordinates, the inner product becomes a dot product of vectors. Thus the presence of an orthonormal basis reduces the study of a finite-dimensional inner product space to the study of \R^n under dot product. Every finite-dimensional inner product space has an orthonormal basis, which may be ob ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Intrinsic Metric
In the mathematical study of metric spaces, one can consider the arclength of paths in the space. If two points are at a given distance from each other, it is natural to expect that one should be able to get from the first point to the second along a path whose arclength is equal to (or very close to) that distance. The distance between two points of a metric space relative to the intrinsic metric is defined as the infimum of the lengths of all paths from the first point to the second. A metric space is a length metric space if the intrinsic metric agrees with the original metric of the space. If the space has the stronger property that there always exists a path that achieves the infimum of length (a geodesic) then it is called a geodesic metric space or geodesic space. For instance, the Euclidean plane is a geodesic space, with line segments as its geodesics. The Euclidean plane with the origin removed is not geodesic, but is still a length metric space. Definitions Let (M, ... [...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 is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
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] |
French Language
French ( or ) is a Romance language of the Indo-European family. It descended from the Vulgar Latin of the Roman Empire, as did all Romance languages. French evolved from Gallo-Romance, the Latin spoken in Gaul, and more specifically in Northern Gaul. Its closest relatives are the other langues d'oïl—languages historically spoken in northern France and in southern Belgium, which French ( Francien) largely supplanted. French was also influenced by native Celtic languages of Northern Roman Gaul like Gallia Belgica and by the ( Germanic) Frankish language of the post-Roman Frankish invaders. Today, owing to France's past overseas expansion, there are numerous French-based creole languages, most notably Haitian Creole. A French-speaking person or nation may be referred to as Francophone in both English and French. French is an official language in 29 countries across multiple continents, most of which are members of the ''Organisation internationale de la Francophonie'' ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...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] |
.png "Click for more on -> Weyl Group")
