Linear and metric maps on trees via Markov graphs : [preprint]

Simple item page
dc.contributor.authorKozerenko, Sergiy
dc.date.accessioned2019-05-16T12:04:27Z
dc.date.available2019-05-16T12:04:27Z
dc.date.issued2018
dc.description.abstractThe main focus of combinatorial dynamics is put on the structure of periodic points (and the corresponding orbits) of topological dynamical systems. The first result in this area is the famous Sharkovsky's theorem which completely describes the coexistence of periods of periodic points for a continuous map from the closed unit interval to itself. One feature of this theorem is that it can be proved using digraphs of a special type (the so-called periodic graphs). In this paper we use Markov graphs (which are the natural generalization of periodic graphs in case of dynamical systems on trees) as a tool to study several classes of maps on trees. The emphasis is put on linear and metric maps.en_US
dc.identifier.citationKozerenko S. Linear and metric maps on trees via Markov graphs / Sergiy Kozerenko // Commentationes Mathematicae Universitatis Carolinae. - 2018. - Vol. 59, Issue 2. - P. 173-187.en_US
dc.identifier.urihttps://ekmair.ukma.edu.ua/handle/123456789/15603
dc.language.isoenen_US
dc.relation.sourceCommentationes Mathematicae Universitatis Carolinaeen_US
dc.statusfirst publisheden_US
dc.subjectMarkov graphsen_US
dc.subjectSharkovsky's theoremen_US
dc.subjectmaps on treesen_US
dc.subjectpreprinten_US
dc.subjectarticleen_US
dc.titleLinear and metric maps on trees via Markov graphs : [preprint]en_US
dc.typeArticleen_US
dc.typePreprinten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kozerenko_Linear_and_metric_maps_on_trees.pdf
Size:
251.83 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
7.54 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Кафедра математики