Search arXivSearch

arXiv · 2411.16924

Equivariant Morse Homology for Reflection Actions via Broken Trajectories

Abstract

We consider a finite group $G$ acting on a manifold $M$. For any equivariant Morse function, which is a generic condition, there does not always exist an equivariant metric $g$ on $M$ such that the pair $(f,g)$ is Morse-Smale. Here, the pair $(f,g)$ is called Morse-Smale if the descending and ascending manifolds intersect transversely. The best possible metrics $g$ are those that make the pair $(f,g)$ stably Morse-Smale. A diffeomorphism $ϕ: M \to M$ is a reflection, if $ϕ^2 = \operatorname{id}$ and the fixed point set of $ϕ$ forms a codimension-one submanifold (with $M \setminus M^{\operatorname{fix}}$ not necessarily disconnected). In this note, we focus on the special case where the group $G = \{\operatorname{id}, ϕ\}$. We show that the condition of being stably Morse-Smale is generic for metrics $g$. Given a stably Morse-Smale pair, we introduce a canonical equivariant Thom-Smale-Witten complex by counting certain broken trajectories. This has applications to the case when we have a manifold with boundary and when the Morse function has critical points on the boundary. We provide an alternative definition of the Thom-Smale-Witten complexes, which are quasi-isomorphic to those defined by Kronheimer and Mrowka. We also explore the case when $G$ is generated by multiple reflections. As an example, we compute the Thom-Smale-Witten complex of an upright higher-genus surface by counting broken trajectories.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Erkao Bao, Tyler Lawson, Lina Liu. 2026-04-28. Equivariant Morse Homology for Reflection Actions via Broken Trajectories. https://arxiv.org/abs/2411.16924

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT