Zobrazeno 1 - 10
of 92
pro vyhledávání: '"Zuzana Masáková"'
Publikováno v:
Journal of Number Theory. 249:470-499
The first aim of this article is to give information about the algebraic properties of alternate bases $\boldsymbol{\beta}=(\beta_0,\dots,\beta_{p-1})$ determining sofic systems. We show that a necessary condition is that the product $\delta=\prod_{i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9a94015edf4f93c514706a845d671b54
https://doi.org/10.1016/j.jnt.2023.02.012
https://doi.org/10.1016/j.jnt.2023.02.012
Autor:
Zuzana Masáková, Jan Mazáč
Publikováno v:
Acta Polytechnica, Vol 57, Iss 6, Pp 430-445 (2017)
Among the commonly used mathematical models of quasicrystals are Delone sets constructed using a cut-and-project scheme, the so-called cut-and-project sets. A cut-and-project scheme (L,π1, π2) is given by a lattice L in Rs and projections π1, π2
Externí odkaz:
https://doaj.org/article/3c3484eb3d2647b7a4fa05f3354d48f7
Publikováno v:
Acta Polytechnica, Vol 56, Iss 6, Pp 462-471 (2016)
We focus on a generalization of the three gap theorem well known in the framework of exchange of two intervals. For the case of three intervals, our main result provides an analogue of this result implying that there are at most 5 gaps. To derive thi
Externí odkaz:
https://doaj.org/article/d0464954876241ec9f1f5e8c163d331f
Publikováno v:
Developments in Language Theory ISBN: 9783031332630
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::199cb1cce35d46e71a8eb72344d6f9f9
https://doi.org/10.1007/978-3-031-33264-7_16
https://doi.org/10.1007/978-3-031-33264-7_16
Publikováno v:
Theoretical Computer Science. 780:74-83
We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class P introduced by Hof, Knill and Simon. We show that it grows at most logarithmically with the length of the factor. For the Fibonacci word and the T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c907a300dae0337b3f87bcfd3b885c35
https://doi.org/10.1016/j.tcs.2019.02.024
https://doi.org/10.1016/j.tcs.2019.02.024
Autor:
Zuzana Masáková, Edita Pelantová
Publikováno v:
Acta Polytechnica, Vol 53, Iss 5 (2013)
We focus on the exchange T of two intervals with an irrational slope α. For a general subinterval I of the domain of T, the first return time to I takes three values. We describe the structure of the set of return itineraries to I. In particular, we
Externí odkaz:
https://doaj.org/article/cd084816a2e14e27be19aebd5d8a2b4b
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol Vol. 13 no. 3, Iss Graph Theory (2011)
Graph Theory
Externí odkaz:
https://doaj.org/article/9634ebf58ce44de798de67dae2e732da
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 9, Iss 2 (2007)
We study properties of β-numeration systems, where β > 1 is the real root of the polynomial x 3 - mx 2 - x - 1, m ∈ ℕ, m ≥ 1. We consider arithmetic operations on the set of β-integers, i.e., on the set of numbers whose greedy expansion in b
Externí odkaz:
https://doaj.org/article/e4f6b2a8145f41b8be4bf47a396a7c84
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 9, Iss 2 (2007)
A Parry number is a real number β >1 such that the Rényi β-expansion of 1 is finite or infinite eventually periodic. If this expansion is finite, β is said to be a simple Parry number. Remind that any Pisot number is a Parry number. In a previous
Externí odkaz:
https://doaj.org/article/c1f8c2aae205406e832c8410aa04e41b
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 9, Iss 2 (2007)
We study the properties of the function R (m) (n) defined as the number of representations of an integer n as a sum of distinct m-Bonacci numbers F (m) k, given by F i (m) =2 i-1, for i∈ { 1, 2, …, m}, F k+m (m) =F k+m-1 (m) +F k+m-2 (m) + ⋯ +
Externí odkaz:
https://doaj.org/article/22dd75c437bc4efe9c443c4385886d90