Petr Ambrož
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Petr Ambrož has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Edita Pelantová
Department of Mathematics Faculty of Nuclear Sciences and Physical Engineering Czech Technical University in Prague Trojanova 13 120 00 Praha 2 Czech Republic
7 shared publications - Zuzana Masáková
Department of Mathematics FNSPE, Czech Technical University in Prague, Praha 2, Czech Republic
5 shared publications Edita Pelantová
2 shared publicationsZuzana Masáková
2 shared publicationsOndřej Kadlec
1 shared publication- Ondřej Kadlec
FNSPE Czech Technical University Trojanova 13 120 00 Prague Praha 2 Czech Republic
1 shared publication
Latest Publications
- Open Access
Lattice Bounded Distance Equivalence for 1D Delone Sets with Finite Local Complexity
Spectra of suitably chosen Pisot-Vijayaraghavan numbers represent non-trivial examples of self-similar Delone point sets of finite local complexity, indispensable in quasicrystal modeling. For the case of quadratic Pisot units we characterize, dependingly on digits in the corresponding numeration systems, the spectra which are bounded distance to an average lattice. Our method stems in interpretation of the spectra in the frame of the cut-and-project method. Such structures are coded by an infinite word over a finite alphabet which enables us to exploit combinatorial notions such as balancedness, substitutions and the spectrum of associated incidence matrices.
Open AccessLattice Bounded Distance Equivalence for 1D Delone Sets with Finite Local Complexity
Spectra of suitably chosen Pisot-Vijayaraghavan numbers represent non-trivial examples of self-similar Delone point sets of finite local complexity, indispensable in quasicrystal modeling. For the case of quadratic Pisot units we characterize, dependingly on digits in the corresponding numeration systems, the spectra which are bounded distance to an average lattice. Our method stems in interpretation of the spectra in the frame of the cut-and-project method. Such structures are coded by an infinite word over a finite alphabet which enables us to exploit combinatorial notions such as balancedness, substitutions and the spectrum of associated incidence matrices.
- 1 October 2020
- Published by Elsevier in European Journal of Combinatorics
- Vol. 89
Morphisms generating antipalindromic words
- 1 October 2020
- Published by Elsevier in European Journal of Combinatorics
- Vol. 89
Morphisms generating antipalindromic words
- Open Access
- 1 January 2020
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1458 (1) , 012007
Description of Voronoi tiles in quasicrystals with octagonal symmetry
We describe families of Voronoi tiles which appear in tilings of certain standard quasicrystal-like point sets with octagonal symmetry built using the cut-and-project construction.
- 1 January 2020
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 1458 (1) , 012007
Open AccessDescription of Voronoi tiles in quasicrystals with octagonal symmetry
We describe families of Voronoi tiles which appear in tilings of certain standard quasicrystal-like point sets with octagonal symmetry built using the cut-and-project construction.
- 1 August 2019
- Published by Elsevier in Theoretical Computer Science
- Vol. 780, 74-83
Palindromic length of words and morphisms in class- 1 August 2019
- Published by Elsevier in Theoretical Computer Science
- Vol. 780, 74-83
Palindromic length of words and morphisms in class- Open AccessPalindromic length of words and morphisms in class $\mathcal{P}$We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class $\mathcal{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 Thue-Morse word we provide estimates on the constants of the growth. We also construct an infinite word rich in palindromes for which the palindromic length grows as $\sqrt{n}$.Open AccessPalindromic length of words and morphisms in class $\mathcal{P}$We study the palindromic length of factors of infinite words fixed by morphisms of the so-called class $\mathcal{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 Thue-Morse word we provide estimates on the constants of the growth. We also construct an infinite word rich in palindromes for which the palindromic length grows as $\sqrt{n}$.
- 1 January 2010
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 44 (1) , 3-17
Morphisms fixing words associated with exchange of three intervals
We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms fixing a 3iet word? We reveal a narrow connection of such morphisms and morphisms fixing Sturmian words using the new notion of amicability.
- 1 January 2010
- Published by EDP Sciences in RAIRO - Theoretical Informatics and Applications
- Vol. 44 (1) , 3-17
Morphisms fixing words associated with exchange of three intervals
We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms fixing a 3iet word? We reveal a narrow connection of such morphisms and morphisms fixing Sturmian words using the new notion of amicability.
- Open Access
A note on 3iet preserving morphisms
An infinite word, which is aperiodic and codes the orbit of a transformation of the exchange of three intervals is called 3iet word. Such a word is thus a natural generalization of a sturmian word to a word over 3-letter alphabet. A morphism is said to be 3iet preserving if it maps any 3iet word to another 3iet word. It is known that the monoid of morphisms preserving sturmian words is finitely generated. On the contrary, in this note we prove that the monoid of 3iet preserving morphisms is not finitely generated, that is, there are infinitely many 3iet preserving morphisms, which cannot be written as a non-trivial decomposition of other 3iet preserving morphisms.
Open AccessA note on 3iet preserving morphisms
An infinite word, which is aperiodic and codes the orbit of a transformation of the exchange of three intervals is called 3iet word. Such a word is thus a natural generalization of a sturmian word to a word over 3-letter alphabet. A morphism is said to be 3iet preserving if it maps any 3iet word to another 3iet word. It is known that the monoid of morphisms preserving sturmian words is finitely generated. On the contrary, in this note we prove that the monoid of 3iet preserving morphisms is not finitely generated, that is, there are infinitely many 3iet preserving morphisms, which cannot be written as a non-trivial decomposition of other 3iet preserving morphisms.
- Open Access
Matrices of 3iet preserving morphisms
We study matrices of morphisms preserving the family of words coding 3-interval exchange transformations. It is well known that matrices of morphisms preserving sturmian words (i.e. words coding 2-interval exchange transformations with the maximal possible factor complexity) form the monoid $\{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \det\boldsymbol{M}=\pm1\} = \{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E}\}$, where $\boldsymbol{E} = (\begin{smallmatrix}0&1 -1&0\end{smallmatrix})$. We prove that in case of exchange of three intervals, the matrices preserving words coding these transformations and having the maximal possible subword complexity belong to the monoid $\{\boldsymbol{M}\in\mathbb{N}^{3\times 3} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E},\ \det\boldsymbol{M}=\pm 1\}$, where $\boldsymbol{E} = \Big(\begin{smallmatrix}0&1&1 -1&0&1 -1&-1&0\end{smallmatrix}\Big)$.Open AccessMatrices of 3iet preserving morphisms
We study matrices of morphisms preserving the family of words coding 3-interval exchange transformations. It is well known that matrices of morphisms preserving sturmian words (i.e. words coding 2-interval exchange transformations with the maximal possible factor complexity) form the monoid $\{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \det\boldsymbol{M}=\pm1\} = \{\boldsymbol{M}\in\mathbb{N}^{2\times 2} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E}\}$, where $\boldsymbol{E} = (\begin{smallmatrix}0&1 -1&0\end{smallmatrix})$. We prove that in case of exchange of three intervals, the matrices preserving words coding these transformations and having the maximal possible subword complexity belong to the monoid $\{\boldsymbol{M}\in\mathbb{N}^{3\times 3} | \boldsymbol{M}\boldsymbol{E}\boldsymbol{M}^T = \pm\boldsymbol{E},\ \det\boldsymbol{M}=\pm 1\}$, where $\boldsymbol{E} = \Big(\begin{smallmatrix}0&1&1 -1&0&1 -1&-1&0\end{smallmatrix}\Big)$.