[過去ﾛｸﾞ] ガロア第一論文及びその関連の資料スレ (1002ﾚｽ)

ガロア第一論文及びその関連の資料スレ http://rio2016.5ch.net/test/read.cgi/math/1615510393/

上下前次1-新
通常表示 512ﾊﾞｲﾄ分割 ﾚｽ栞
抽出解除 ﾚｽ栞

---

このｽﾚｯﾄﾞは過去ﾛｸﾞ倉庫に格納されています｡
次ｽﾚ検索 歴削→次ｽﾚ 栞削→次ｽﾚ 過去ﾛｸﾞﾒﾆｭｰ

---

ﾘﾛｰﾄﾞ規制です｡10分ほどで解除するので､他のﾌﾞﾗｳｻﾞへ避難してください｡

---

466: １３２人目の素数さん [] 2023/02/15(水) 18:21:06.22 ID:ix8IQFwl >>465 つづき （上記より） http://web.ihep.su/dbserv/compas/src/dyson49/eng.pdf F. J. Dyson, Phys. Rev. 75, 486 The Radiation Theories of Tomonaga, Schwinger,and Feynman F.J. Dyson Institute for Advanced Study, Princeton, New Jersey P2 注：3 R. P. Feynman, Rev. Mod. Phys. 20, 367 (1948); Phys. Rev. 74, 939, 1430 (1948); J. A. Wheeler and R. P. Feynman, Rev. Mod. Phys. 17, 157 (1945). These articles describe early stages in the development of Feynman’s theory, little of which is yet published. P19 7 GRAPHICAL REPRESENTATION OF MATRIX ELEMENTS P25 8 VACUUM POLARIZATION AND CHARGE RENORMALIZATION ＜vertex,vertices 抽出（下記”in Section VIII”は、上記のP25 8 のことか。自己言及ですねｗ）＞ P19 Through each point of a graph pass two electron lines, and therefore the electron lines together form one open polygon containing the vertices xk and xrk and possibly a number of closed polygons as well. P21 A “self-energy part” of a graph G is defined as follows; it is a set of one or more vertices not including x0, together with the lines joining them, which is connected with the remainder of G (or with the edge of the diagram) only by two electron lines or by one or two photon lines. P23 There remains the case in which λ leads from one vertex x3 to another x4 of G0. In this case C(G0) contains in its integrand the function P29 All possible graphs G with (n + 1) vertices are now drawnas described in Section VIII omitting disconnected graphs, graphs with self-energy parts, and graphs with external vacuum polarization parts as definedin Section VIII. It will be found that in each graph there are at each vertex two electron lines and one photon line, with the exception of x0 at which there are two electron lines only; further, such graphs can exist only for even n. Kn is the sum of a contribution K(G) from each G. つづく http://rio2016.5ch.net/test/read.cgi/math/1615510393/466

467: １３２人目の素数さん [] 2023/02/15(水) 18:21:29.30 ID:ix8IQFwl >>466 つづき Also, the integrand in Jn is a symmetrical function of x1, . . . , xn; therefore, graphs which differ only by a relabeling of the vertices x1, . . . , xn give identical contributions to Kn and need not be considered separately. P31 Next, all admissable graphs with the three vertices x0, x1, x2 are to be drawn. It is easy to see that there are only two such graphs, that G shown in Fig.1, and the identical graph with x1 and x2 interchanged. (引用終り) 以上 http://rio2016.5ch.net/test/read.cgi/math/1615510393/467

468: １３２人目の素数さん [sage] 2023/02/15(水) 19:14:26.44 ID:MT2IFioO >>465-468 淋しい耄碌爺の落書きコピペ http://rio2016.5ch.net/test/read.cgi/math/1615510393/468

---

ﾒﾓ帳

(0/65535文字)

---

上下前次1-新書関写板覧索設栞歴

---

ｽﾚ情報 赤ﾚｽ抽出 画像ﾚｽ抽出 歴の未読ｽﾚ AAｻﾑﾈｲﾙ

---

Google検索

Wikipedia

---

ぬこの手 ぬこTOP 0.052s