Edge Imbalance Sequences and Their Graphicness: [preprint]

Simple item page
dc.contributor.authorKozerenko, Sergiy
dc.date.accessioned2019-06-25T15:01:21Z
dc.date.available2019-06-25T15:01:21Z
dc.date.issued2019
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. Edge Imbalance Sequences and Their Graphicness / Kozerenko Sergiy // Journal of Advanced Mathematical Studies. - 2019. - Vol. 12, No. 1. - P. 50-62.en_US
dc.identifier.issn2065-3506
dc.identifier.urihttps://ekmair.ukma.edu.ua/handle/123456789/16073
dc.language.isoenen_US
dc.relation.sourceJournal of Advanced Mathematical Studies. - 2019. - Vol. 12, No. 1en_US
dc.statusfirst publisheden_US
dc.subjectMarkov graphsen_US
dc.subjectSharkovsky’s theoremen_US
dc.subjectmaps on treesen_US
dc.subjectarticleen_US
dc.subjectpreprinten_US
dc.titleEdge Imbalance Sequences and Their Graphicness: [preprint]en_US
dc.typeArticleen_US
dc.typePreprinten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Kozerenko_Edge_Imbalance_Sequences_and_Their_Graphicness.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
Кафедра математики