Trees in positive entropy subshifts

Tietueen suppeat tiedot
dc.contributor.authorSalo Ville
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id62086434
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/62086434
dc.date.accessioned2022-10-28T13:53:23Z
dc.date.available2022-10-28T13:53:23Z
dc.description.abstract<p>I give a simple proof for the fact that positive entropy subshifts contain infinite binary trees where branching happens synchronously in each branch, and that the branching times form a set with positive lower asymptotic density.<br></p>
dc.identifier.eissn2075-1680
dc.identifier.jour-issn2075-1680
dc.identifier.olddbid184992
dc.identifier.oldhandle10024/168086
dc.identifier.urihttps://www.utupub.fi/handle/11111/41869
dc.identifier.urlhttps://doi.org/10.3390/axioms10020077
dc.identifier.urnURN:NBN:fi-fe2021093048828
dc.language.isoen
dc.okm.affiliatedauthorSalo, Ville
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.internationalcopublicationnot an international co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherMDPI AG
dc.publisher.countrySwitzerlanden_GB
dc.publisher.countrySveitsifi_FI
dc.publisher.country-codeCH
dc.relation.doi10.3390/axioms10020077
dc.relation.ispartofjournalAxioms
dc.relation.issue2
dc.relation.volume10
dc.source.identifierhttps://www.utupub.fi/handle/10024/168086
dc.titleTrees in positive entropy subshifts
dc.year.issued2021

Tiedostot

Näytetään 1 - 1 / 1
Name:
axioms-10-00077.pdf
Size:
251.93 KB
Format:
Adobe Portable Document Format
Description:
Publisher´s PDF
Lataa

Kokoelmat

Rinnakkaistallenteet