相关论文: Barcodes for Hamiltonian homeomorphisms of surface…
We construct a Floer type boundary operator for generalised Morse-Smale dynamical systems on compact smooth manifolds by counting the number of suitable flow lines between closed (both homoclinic and periodic) orbits and isolated critical…
This is a research monograph on symplectic cohomology (disguised as an advanced graduate textbook), which provides a construction of this version of Hamiltonian Floer cohomology for cotangent bundles of closed manifolds. The focus is on the…
In this article we describe an algorithm that can be applied for the generation of various classes of maps on orientable surfaces. It uses existing generators for abstract graphs and combines them with an efficient embedding and isomorphism…
A graph's spectral wavelet signature determines a filtration, and consequently an associated set of extended persistence diagrams. We propose a framework that optimises the choice of wavelet for a dataset of graphs, such that their…
Floer homology is a good example of homological invariants living in the infinite dimension. We suggest a way to construct this kind of invariants using only soft essentially finite-dimensional tools; no hard analysis or PDE is involved.…
In this paper we continue investigating connections between Floer theory and dynamics of Hamiltonian systems, focusing on the barcode entropy of Reeb flows. Barcode entropy is the exponential growth rate of the number of not-too-short bars…
Attempts to incorporate topological information in supervised learning tasks have resulted in the creation of several techniques for vectorizing persistent homology barcodes. In this paper, we study thirteen such methods. Besides describing…
We introduce and study the barcode entropy for geodesic flows of closed Riemannian manifolds, which measures the exponential growth rate of the number of not-too-short bars in the Morse-theoretic barcode of the energy functional. We prove…
We study non-compact surfaces obtained by gluing strips $\mathbb{R}\times(-1,1)$ with at most countably many boundary intervals along some these intervals. Every such strip possesses a foliation by parallel lines, which gives a foliation on…
Directed graphs can be studied by their associated directed flag complex. The homology of this complex has been successful in applications as a topological invariant for digraphs. Through comparison with path homology theory, we derive a…
In principle, Floer theory can be extended to define homotopy invariants of families of equivalent objects (e.g. Hamiltonian isotopic symplectomorphisms, 3-manifolds, Legendrian knots, etc.) parametrized by a smooth manifold B. The…
This is the first of two papers devoted to showing how the rich algebraic formalism of Eliashberg-Givental-Hofer's symplectic field theory (SFT) can be used to define higher algebraic structures on the symplectic cohomology of open…
The monography considers the problem of constructing a Hamiltonian cycle in a complete graph. A rule for constructing a Hamiltonian cycle based on isometric cycles of a graph is established. An algorithm for constructing a Hamiltonian cycle…
We study the following rigidity problem in symplectic geometry:can one displace a Lagrangian submanifold from a hypersurface? We relate this to the Arnold Chord Conjecture, and introduce a refined question about the existence of relative…
We give a sufficient condition under which the fundamental group of a reglued graph of surfaces is hyperbolic. A reglued graph of surfaces is constructed by cutting a fixed graph of surfaces along the edge surfaces, then regluing by…
In this paper, we present a $C^0$-fragmentation property for Hamiltonian diffeomorphisms. More precisely, it is known that for a given open covering $\mathcal{U}$ of a compact symplectic surface we can write each $C^0$-small enough…
We study the inverse problem for persistent homology: For a fixed simplicial complex $K$, we analyse the fiber of the continuous map $\mathrm{PH}$ on the space of filters that assigns to a filter $f: K \to \mathbb R$ the total barcode of…
The goal of this work is to give precise bounds on the counting complexity of a family of generalized coloring problems (list homomorphisms) on bounded-treewidth graphs. Given graphs $G$, $H$, and lists $L(v)\subseteq V(H)$ for every $v\in…
In this paper we find a family of knots with trivial Alexander polynomial, and construct two non-isotopic Seifert surfaces for each member in our family. In order to distinguish the surfaces we study the sutured Floer homology invariants of…
We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…