Search arXivSearch

arXiv · 1409.0588

Causal Holography of Traversing Flows

Abstract

We study smooth {\sf traversing} vector fields $v$ on compact manifolds $X$ with boundary. A traversing $v$ admits a Lyapunov function $f: X \to \Bbb R$ such that $df(v) > 0$. We show that the trajectory spaces $\mathcal T(v)$ of {\sf traversally generic} $v$-flows are {\sf Whitney stratified spaces}, and thus admit triangulations amenable to their natural stratifications. Despite being spaces with singularities, $\mathcal T(v)$ retain some residual smooth structure of $X$. Let $\mathcal F(v)$ denote the oriented $1$-dimensional foliation on $X$, produced by a traversing $v$-flow. With the help of a {\sf boundary generic} $v$, we divide the boundary $\partial X$ of $X$ into two complementary compact manifolds, $\partial^+X(v)$ and $\partial^-X(v)$. Then, for a traversing $v$, we introduce the {\sf causality map} $C_v: \partial^+X(v) \to \partial^-X(v)$. Our main result claims that, for boundary generic traversing vector fields $v$, the causality map $C_v$ is allows for a reconstruction of the pair $(X, \mathcal F(v))$, up to a homeomorphism $Φ: X \to X$ such that $Φ|_{\partial X} = id_{\partial X}$. In other words, for a massive class of ODEs, we show that the topology of their solutions, satisfying a given boundary value problem, is {\sf rigid}. We call these results ``{\sf holographic}" since the $(n+1)$-dimensional $X$ and the un-parameterized dynamics of the $v$-flow are captured by a single map $C_v$ between two $n$-dimensional screens, $\partial^+X(v)$ and $\partial^-X(v)$. This holography of traversing flows has numerous applications to the dynamics of general flows. Some of them are described in the paper. Others, are just outlined.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Gabriel Katz. 2020-08-16. Causal Holography of Traversing Flows. https://arxiv.org/abs/1409.0588

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