This article is cited in 3 scientific papers (total in 3 papers)
Combinatorial analysis of the overlapping problem for vertices with more than four legs
Yu. M. Pis'mak
The definition of reducihility of a connected diagram is introduced, which makes
it possible to extend the definition of reducibility of a diagram  to the $n>4$,
and also to formulate the definition of dressed $n$-tail vertex with $n$ arbitrarily large.
Some theorems about topological properties of diagrams with vertices of arbitrarily
high order are proved.
PDF file (987 kB)
Theoretical and Mathematical Physics, 1975, 24:1, 649–658
Yu. M. Pis'mak, “Combinatorial analysis of the overlapping problem for vertices with more than four legs”, TMF, 24:1 (1975), 34–48; Theoret. and Math. Phys., 24:1 (1975), 649–658
Citation in format AMSBIB
\paper Combinatorial analysis of the overlapping problem for vertices with more than four legs
\jour Theoret. and Math. Phys.
Citing articles on Google Scholar:
Related articles on Google Scholar:
Cycle of papers
This publication is cited in the following articles:
Yu. M. Pis'mak, “Combinational analysis of the overlapping problem for vertices with more than four legs. II. Higher Legendre transforms”, Theoret. and Math. Phys., 24:2 (1975), 755–767
Bagaev A.A., “Effektivnoe deistvie v formalizme fonovogo polya”, Vestnik sankt-peterburgskogo universiteta. seriya 4: fizika. khimiya, 2012, no. 3, 56–65
Bagaev A.A. Pis'mak Yu.M., “The 0D Quantum Field Theory: Multiple Integrals Via Background Field Formalism”, Proceedings of the International Conference on Days on Diffraction 2016 (Dd), ed. Motygin O. Kiselev A. Kapitanova P. Goray L. Kazakov A. Kirpichnikova A., IEEE, 2016, 41–45
|Number of views:|