Symbolic Computations of the Two-Colored Diagrams for Central Configurations of the Planar N-vortex Problem

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Yu, Xiang, Zhu, Shuqiang
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915152659480576
author Yu, Xiang
Zhu, Shuqiang
author_facet Yu, Xiang
Zhu, Shuqiang
contents We apply the singular sequence method to investigate the finiteness problem for stationary configurations of the planar N-vortex problem. The initial step of the singular sequence method involves identifying all two-colored diagrams. These diagrams represent potential scenarios where finiteness may fail. We develop a symbolic computation algorithm to determine all two-colored diagrams for central configurations of the planar N-vortex problem.
format Preprint
id arxiv_https___arxiv_org_abs_2502_10472
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Symbolic Computations of the Two-Colored Diagrams for Central Configurations of the Planar N-vortex Problem
Yu, Xiang
Zhu, Shuqiang
Dynamical Systems
Mathematical Physics
76B47, 70F10, 37Nxx
We apply the singular sequence method to investigate the finiteness problem for stationary configurations of the planar N-vortex problem. The initial step of the singular sequence method involves identifying all two-colored diagrams. These diagrams represent potential scenarios where finiteness may fail. We develop a symbolic computation algorithm to determine all two-colored diagrams for central configurations of the planar N-vortex problem.
title Symbolic Computations of the Two-Colored Diagrams for Central Configurations of the Planar N-vortex Problem
topic Dynamical Systems
Mathematical Physics
76B47, 70F10, 37Nxx
url https://arxiv.org/abs/2502.10472