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...

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...

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...

A Dynkin system, named after Eugene Dynkin, is a collection of subsets of another universal set Ω {\displaystyle \Omega } satisfying a set of axioms weaker...

In geometry, a Coxeter–Dynkin diagram (or Coxeter diagram, Coxeter graph) is a graph with numerically labeled edges (called branches) representing a Coxeter...

In mathematics — specifically, in stochastic analysis — Dynkin's formula is a theorem giving the expected value of any suitably smooth function applied...

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...

Alexander A. Dynkin (Russian: Александр Александрович Дынкин; born 30 June 1948) is a Russian economist whose research interests and publications have...

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...

they are applied. Further, the classification scheme for root systems, by Dynkin diagrams, occurs in parts of mathematics with no overt connection to Lie...

In probability theory, the Doob–Dynkin lemma, named after Joseph L. Doob and Eugene Dynkin (also known as the factorization lemma), characterizes the situation...

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)...

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...

In mathematics, the Dynkin index I ( λ ) {\displaystyle I({\lambda })} of finite-dimensional highest-weight representations of a compact simple Lie algebra...

of the fact that the π-𝜆 theorem was proven by the probabilist Eugene Dynkin. Standard measure theory texts typically prove the same results via monotone...

classification of finite Nichols algebras for abelian groups in terms of generalized Dynkin diagrams. When small primes are present, some exotic examples, such as a...

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...

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...

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...

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...

semi-regular figure. Its Coxeter symbol is 421, describing its bifurcating Coxeter-Dynkin diagram, with a single ring on the end of the 4-node sequences, . The rectified...

].} 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...

{\displaystyle {\mathfrak {g}}} , there exists a corresponding diagram (called the Dynkin diagram) where the nodes denote the simple roots, the nodes are jointed...

Lie algebras and Lie groups, a Satake diagram is a generalization of a Dynkin diagram introduced by Satake (1960, p.109) whose configurations classify...

proved by Pierre Gabriel, classifies the quivers of finite type in terms of Dynkin diagrams. A quiver is of finite type if it has only finitely many isomorphism...

where certain kinds of objects are in correspondence with simply laced Dynkin diagrams. The question of giving a common origin to these classifications...

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)...

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)...

−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...

bifurcated Coxeter-Dynkin diagram of lengths 6,2,1. There are 1023 unique E10 honeycombs by all combinations of its Coxeter-Dynkin diagram. There are...