Search arXivSearch

arXiv · 2402.06671

A trace formula for foliated flows

Abstract

Let $F$ be a transversely oriented foliation of codimension 1 on a closed manifold $M$, and let $ϕ=\{ϕ^t\}$ be a foliated flow on $(M,F)$. Assume the closed orbits of $ϕ$ are simple and its preserved leaves are transversely simple. In this case, there are finitely many preserved leaves, which are compact. Let $M^0$ denote their union, $M^1=M\setminus M^0$ and $F^1=F|_{M^1}$. We consider two topological vector spaces, $I(F)$ and $I'(F)$, consisting of the leafwise currents on $M$ that are conormal and dual-conormal to $M^0$, respectively. They become topological complexes with the differential operator $d_{F}$ induced by the de~Rham derivative on the leaves, and they have an $\mathbb{R}$-action $ϕ^*=\{ϕ^{t\,*}\}$ induced by $ϕ$. Let $\bar H^\bullet I(F)$ and $\bar H^\bullet I'(F)$ denote the corresponding leafwise reduced cohomologies, with the induced $\mathbb{R}$-action $ϕ^*=\{ϕ^{t\,*}\}$. We define some kind of Lefschetz distribution $L_{\text{\rm dis}}(ϕ)$ of the actions $ϕ^*$ on both $\bar H^\bullet I(F)$ and $\bar H^\bullet I'(F)$, whose value is a distribution on $\mathbb{R}$. Its definition involves several renormalization procedures, the main one being the b-trace of some smoothing b-pseudodifferential operator on the compact manifold with boundary obtained by cutting $M$ along $M^0$. We also prove a trace formula describing $L_{\text{\rm dis}}(ϕ)$ in terms of infinitesimal data from the closed orbits and preserved leaves. This solves a conjecture of C.~Deninger involving two leafwise reduced cohomologies instead of a single one.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jesús A. Álvarez López, Yuri A. Kordyukov, Eric Leichtnam. 2024-02-13. A trace formula for foliated flows. https://arxiv.org/abs/2402.06671

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