Maps of combinatorial trees with weakly connected Markov graphs

DOI10.61091/UM123-03MaRDI QIDQ6920982zbMATH OpenFDO

Authors Sergiy Kozerenko

Publication date 6 October 2025

Published in Utilitas Mathematica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/UM123-03

zbMATH Keywords

maps on finite setsMarkov graphsperiodic pointstreesweakly connected digraphs

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Dynamical systems involving maps of trees and graphs (37E25)

Cites work

• A graph-theoretic proof of Sharkovsky's theorem on the periodic points of continuous functions
• Discrete Markov graphs: loops, fixed points and maps preordering
• Functional Alexandroff spaces
• Functions realizing as abelian group automorphisms
• scientific article; zbMATH DE number 6870675 (Why is no real title available?)
• scientific article; zbMATH DE number 3197700 (Why is no real title available?)
• Markov graphs of one-dimensional dynamical systems and their discrete analogues
• Monounary algebras
• More on linear and metric tree maps
• Number of digraphs of periodic points of a continuous mapping of an interval into itself
• On the abstract properties of Markov graphs for maps on trees
• Periodic digraphs and their properties
• Periodic Points of Continuous Functions
• Principles of combinatorics
• The categories of flows of Set and Top
• Vertex maps for trees: algebra and periods of periodic orbits
• When is a permutation of the set \(\mathbb{Z}^n\) (resp. \(\mathbb{Z}_p^n\), \(p\) prime) an automorphism of the group \(\mathbb{Z}^n\) (resp. \(\mathbb{Z}_p^n\))?
• Which self-maps appear as lattice anti-endomorphisms?
• Which self-maps appear as lattice endomorphisms?

This page was built for publication: Maps of combinatorial trees with weakly connected Markov graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6920982)