Coxeter–Dynkin diagram Dynkin system Dynkin's formula Doob–Dynkin lemma Dynkin index This page lists people with the surname Dynkin. If an internal link...
488 bytes (92 words) - 20:36, 25 March 2024
algebras, and Markov processes. The Dynkin diagram, the Dynkin system, and Dynkin's lemma are named after him. Dynkin was born into a Jewish family, living...
12 KB (1,146 words) - 18:05, 28 October 2024
theory, a Dynkin diagram, named for Eugene Dynkin, is a type of graph with some edges doubled or tripled (drawn as a double or triple line). Dynkin diagrams...
77 KB (5,608 words) - 07:05, 10 May 2024
A Dynkin system, named after Eugene Dynkin, is a collection of subsets of another universal set Ω {\displaystyle \Omega } satisfying a set of axioms weaker...
10 KB (2,349 words) - 16:01, 17 October 2024
In geometry, a Coxeter–Dynkin diagram (or Coxeter diagram, Coxeter graph) is a graph with numerically labeled edges (called branches) representing a Coxeter...
57 KB (3,217 words) - 14:44, 18 October 2024
In mathematics — specifically, in stochastic analysis — Dynkin's formula is a theorem giving the expected value of any suitably smooth function applied...
5 KB (925 words) - 19:09, 30 May 2024
Optimal stopping (redirect from Dynkin game)
In mathematics, the theory of optimal stopping or early stopping is concerned with the problem of choosing a time to take a particular action, in order...
15 KB (2,547 words) - 17:44, 28 August 2024
Affine Lie algebra (redirect from Twisted affine Dynkin diagram)
may obtain other Dynkin diagrams and these correspond to twisted affine Lie algebras. The attachment of an extra node to the Dynkin diagram of the corresponding...
15 KB (2,491 words) - 03:19, 9 October 2024
Alexander A. Dynkin (Russian: Александр Александрович Дынкин; born 30 June 1948) is a Russian economist whose research interests and publications have...
2 KB (169 words) - 20:36, 25 March 2024
In probability theory, the Doob–Dynkin lemma, named after Joseph L. Doob and Eugene Dynkin (also known as the factorization lemma), characterizes the situation...
5 KB (566 words) - 15:23, 5 December 2023
they are applied. Further, the classification scheme for root systems, by Dynkin diagrams, occurs in parts of mathematics with no overt connection to Lie...
52 KB (6,237 words) - 03:59, 15 December 2024
Kruskal count (redirect from Dynkin's card trick)
Kruskal count (also known as Kruskal's principle, Dynkin–Kruskal count, Dynkin's counting trick, Dynkin's card trick, coupling card trick or shift coupling)...
62 KB (5,493 words) - 11:51, 7 December 2024
F4 (mathematics) (section Dynkin diagram)
construction of E8. In older books and papers, F4 is sometimes denoted by E4. The Dynkin diagram for F4 is: . Its Weyl/Coxeter group G = W(F4) is the symmetry group...
8 KB (983 words) - 13:15, 27 September 2024
In mathematics, the Dynkin index I ( λ ) {\displaystyle I({\lambda })} of finite-dimensional highest-weight representations of a compact simple Lie algebra...
2 KB (270 words) - 07:41, 2 July 2024
the complex numbers the semisimple Lie algebras are classified by their Dynkin diagrams, of types "ABCDEFG". If L is a real simple Lie algebra, its complexification...
35 KB (2,369 words) - 02:33, 17 December 2024
closed field. In particular, the simple algebraic groups are classified by Dynkin diagrams, as in the theory of compact Lie groups or complex semisimple Lie...
56 KB (8,024 words) - 07:23, 21 November 2024
generalized Dynkin diagrams. When small primes are present, some exotic examples, such as a triangle, occur (see also the Figure of a rank 3 Dynkin diagram)...
30 KB (4,983 words) - 17:53, 20 December 2024
where certain kinds of objects are in correspondence with simply laced Dynkin diagrams. The question of giving a common origin to these classifications...
21 KB (2,595 words) - 05:49, 26 August 2024
Pi-system (redirect from Dynkin's π-system)
of the fact that the π-𝜆 theorem was proven by the probabilist Eugene Dynkin. Standard measure theory texts typically prove the same results via monotone...
16 KB (2,893 words) - 21:20, 22 May 2024
E6 (mathematics) (section Dynkin diagram)
cohomology (over a perfect field k) by the set H1(k, Aut(E6)) which, because the Dynkin diagram of E6 (see below) has automorphism group Z/2Z, maps to H1(k, Z/2Z)...
28 KB (3,824 words) - 21:29, 30 November 2024
There are exactly 24 Dynkin diagrams with these properties, and there turns out to be a unique Niemeier lattice for each of these Dynkin diagrams. The complete...
15 KB (903 words) - 14:00, 22 August 2024
Path graph (section As Dynkin diagrams)
Gibbons (1985), or Diestel (2005). In algebra, path graphs appear as the Dynkin diagrams of type A. As such, they classify the root system of type A and...
3 KB (289 words) - 05:54, 15 November 2024
field constructed by Ree (1960, 1961) from an exceptional automorphism of a Dynkin diagram that reverses the direction of the multiple bonds, generalizing...
17 KB (2,067 words) - 00:02, 3 December 2023
Σ-algebra (section Dynkin's π-λ theorem)
].} A σ-algebra is both a π-system and a Dynkin system (λ-system). The converse is true as well, by Dynkin's theorem (see below). This theorem (or the...
31 KB (5,373 words) - 13:46, 8 October 2024
−1). It has a non-algebraic double cover that is simply connected. The Dynkin diagram for G2 is given by . Its Cartan matrix is: [ 2 − 3 − 1 2 ] {\displaystyle...
15 KB (2,056 words) - 18:40, 24 July 2024
vector spaces. Most commonly, it describes those special features of the Dynkin diagram D4 and the associated Lie group Spin(8), the double cover of 8-dimensional...
6 KB (770 words) - 22:36, 18 November 2024
assumes its shape or conformation Folding (Dynkin diagram), in Lie theory, a way of obtaining one Dynkin diagram from another Fold change, a measure...
3 KB (444 words) - 21:15, 7 July 2024
E7 (mathematics) (section Dynkin diagram)
cohomology (over a perfect field k) by the set H1(k, Aut(E7)) which, because the Dynkin diagram of E7 (see below) has no automorphisms, coincides with H1(k, E7...
19 KB (2,766 words) - 21:58, 12 June 2024
subsequently refined, and the present classification by Dynkin diagrams was given by then 22-year-old Eugene Dynkin in 1947. Some minor modifications have been made...
41 KB (5,731 words) - 05:42, 22 October 2024
E8 (mathematics) (section Dynkin diagram)
cohomology (over a perfect field k) by the set H1(k,Aut(E8)), which, because the Dynkin diagram of E8 (see below) has no automorphisms, coincides with H1(k,E8)...
46 KB (6,100 words) - 19:52, 19 December 2024