• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site

Article

On Algorithms that Effectively Distinguish Gradient-Like Dynamics on Surfaces

Arnold Mathematical Journal. 2018. Vol. 4. No. 3-4. P. 483-504.

In the present paper we survey existing graph invariants for gradient-like flows on surfaces up to the topological equivalence and develop effective algorithms for their distinction (let us recall that a flow given on a surface is called a gradient-like flow if its non-wandering set consists of a finite set of hyperbolic fixed points, and there is no trajectories connecting saddle points). Additionally, we construct a parametrized algorithm for the Fleitas’s invariant, which will be of linear time, when the number of sources is fixed. Finally, we prove that the classes of topological equivalence and topological conjugacy are coincide for gradient-like flows, so, all the proposed invariants and distinguishing algorithms works also for topological classification, taking in sense time of moving along trajectories. So, as the main result of this paper we have got multiple ways to recognize equivalence and conjugacy class of arbitrary gradient-like flow on a closed surface in a polynomial time.