Graphes polaris\'es et ergodicit\'e topologique
From MaRDI portal
Publication:6409482
arXiv2209.00516MaRDI QIDQ6409482FDOQ6409482
François Lalonde, Jordan Payette, Dustin Connery-Grigg
Publication date: 1 September 2022
Abstract: The simplest way to make a dynamical system out of a finite connected graph is to give it a polarization, that is to say a cyclic ordering of the edges incident to a vertex, for each vertex. The phase space then consists of all pairs where is a vertex and is an edge incident to . Such an initial condition gives a position and a momentum. The data is of course equivalent to an edge endowed with an orientation . With the polarization, each initial data leads to a leftward walk defined by turning left at each vertex, or making a rebound if there is no other edge. A leftward walk is called complete if it goes through all edges of , not necessarily in both directions. As usual, we define the valence of a vertex as the number of edges incident to it. We say that a graph has valence at least if the valence of each vertex is at least . In this article, we prove that if a graph is embedded in a closed oriented surface of genus , of valence at least , then this graph admits no complete leftward walk. For genus , we get sharp results. This leads to obstructions for the embeddability of graphs on a surface. Since checking that a polarized graph admits a complete leftward walk or not is done in time , where is the cardinality of the edges (we just have to check it on both orientations of any given edge), this obstruction is particularly efficient in terms of computability. This is the first obstruction for such a deep problem which is linear in computation time.
General topics of discrete mathematics in relation to computer science (68R01) Planar graphs; geometric and topological aspects of graph theory (05C10) Flows in graphs (05C21) Singular homology and cohomology theory (55N10) Embeddings and immersions in PL-topology (57Q35) Dynamics in general topological spaces (37B02)
This page was built for publication: Graphes polaris\'es et ergodicit\'e topologique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6409482)