Busca avançada
Ano de início
Entree


Texto completo
Autor(es):
Bertolim, Maria A. ; De Rezende, Ketty A. ; Mello, Margarida P.
Número total de Autores: 3
Tipo de documento: Artigo Científico
Fonte: TOPOLOGICAL METHODS IN NONLINEAR ANALYSIS; v. 65, n. 2, p. 55-pg., 2025-12-01.
Resumo

. In this paper, we address both a combinatorial continuation question via Lyapunov graphs and the attainability of a preassigned level set, dubbed ground level set and given by its Betti numbers, within a morsification process of a dynamical configuration. The novelty introduced here is a componentwise Lyapunov graph morsification that keeps track of level sets during the morsification process subject to the minimality of the total number of singularities of a morsified flow. The algorithm behind the morsification translates into a system of linear equations whose feasibility is linked to that of a set of inequalities, called componentwise Poincare<acute accent>- Hopf inequalities, involving the input data. This investigation combines techniques from both homological Conley index and network flow theories. (AU)

Processo FAPESP: 22/16455-6 - Topologia algébrica, geométrica e diferencial
Beneficiário:Daciberg Lima Gonçalves
Modalidade de apoio: Auxílio à Pesquisa - Temático
Processo FAPESP: 18/13481-0 - Geometria de sistemas de controle, sistemas dinâmicos e estocásticos
Beneficiário:Marco Antônio Teixeira
Modalidade de apoio: Auxílio à Pesquisa - Temático