Edita Pelantová
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Edita Pelantová has a total of 101 co-authors. Here are the top co-authors by number of shared publications:
- Zuzana Masáková
Department of Mathematics FNSPE, Czech Technical University in Prague, Praha 2, Czech Republic
26 shared publications Zuzana Masáková
Czech Technical University in Prague
22 shared publications- Lubomíra Dvořáková
Department of Mathematics Faculty of Nuclear Sciences and Physical Engineering Czech Technical University in Prague Trojanova 13 120 00 Praha 2 Czech Republic
11 shared publications - Lubomira Balkova
Department of Mathematics FNSPE Czech Technical University Trojanova 13 120 00 Praha 2 Czech Republic
9 shared publications - Zuzana Masáková
Doppler Institute for Mathematical Physics and Applied Mathematics & Department of Mathematics, FNSPE, Czech Technical University, Trojanova 13, 120 00 Praha 2, Czech Republic
9 shared publications Štěpán Starosta
8 shared publications
Latest Publications
- Open Access
- 18 May 2026
- Published by Springer Nature in Theory of Computing Systems
- Vol. 70 (2)
Reflection on the Reflection Complexity
The factor complexity $$\mathcal {C}_{{\textbf {u}}}$$ of a sequence $$\textbf{u}= \varvec{u}_{0}\varvec{u}_{1}\varvec{u}_{2} \cdots $$ over a finite alphabet counts the number of factors of length n occurring in $$\textbf{u}$$ , i.e., $$\mathcal {C}_\textbf{u}{(n)} = \#{\mathcal {L}}_n(\textbf{u})$$ , where $${\mathcal {L}}_n\varvec{(}\textbf{u}\varvec{)}= {\{}\varvec{u}_{{i}}\varvec{u}_{{i+1}}\cdots \varvec{u}_{{i+n-1}}{: i} \in \mathbb {N}{\}}$$ . Two factors of $${\mathcal {L}}_{{n}}\varvec{(}\textbf{u}\varvec{)}$$ are said to be equivalent if they are equal or one factor is the reversal of the other one. Recently, Allouche et al. introduced the reflection complexity $${r}_\textbf{u}$$ which counts the number of non-equivalent factors of $${\mathcal {L}}_{{n}}\varvec{(}\textbf{u}\varvec{)}$$ . They formulated the following conjecture: a sequence $$\textbf{u}$$ is eventually periodic if and only if $${r}_\textbf{u}{(n+2)} = {r}_\textbf{u}{(n)}$$ for some $${n} \in \mathbb {N}$$ . Here we prove the conjecture and characterize the sequences for which $${r}_\textbf{u}{(n+2)} = {r}_\textbf{u}{(n)+1}$$ for every $${n} \in \mathbb {N}$$ and also the sequences for which the equality is satisfied for every sufficiently large $${n} \in \mathbb {N}$$ .- 18 May 2026
- Published by Springer Nature in Theory of Computing Systems
- Vol. 70 (2)
Open AccessReflection on the Reflection Complexity
The factor complexity $$\mathcal {C}_{{\textbf {u}}}$$ of a sequence $$\textbf{u}= \varvec{u}_{0}\varvec{u}_{1}\varvec{u}_{2} \cdots $$ over a finite alphabet counts the number of factors of length n occurring in $$\textbf{u}$$ , i.e., $$\mathcal {C}_\textbf{u}{(n)} = \#{\mathcal {L}}_n(\textbf{u})$$ , where $${\mathcal {L}}_n\varvec{(}\textbf{u}\varvec{)}= {\{}\varvec{u}_{{i}}\varvec{u}_{{i+1}}\cdots \varvec{u}_{{i+n-1}}{: i} \in \mathbb {N}{\}}$$ . Two factors of $${\mathcal {L}}_{{n}}\varvec{(}\textbf{u}\varvec{)}$$ are said to be equivalent if they are equal or one factor is the reversal of the other one. Recently, Allouche et al. introduced the reflection complexity $${r}_\textbf{u}$$ which counts the number of non-equivalent factors of $${\mathcal {L}}_{{n}}\varvec{(}\textbf{u}\varvec{)}$$ . They formulated the following conjecture: a sequence $$\textbf{u}$$ is eventually periodic if and only if $${r}_\textbf{u}{(n+2)} = {r}_\textbf{u}{(n)}$$ for some $${n} \in \mathbb {N}$$ . Here we prove the conjecture and characterize the sequences for which $${r}_\textbf{u}{(n+2)} = {r}_\textbf{u}{(n)+1}$$ for every $${n} \in \mathbb {N}$$ and also the sequences for which the equality is satisfied for every sufficiently large $${n} \in \mathbb {N}$$ . - Open Access
Codings of B-Integers in Cantor Numeration Systems as Generators of Aperiodic Potentials
Cantor real numeration systems provide a natural algebraic source of self-similar aperiodic structures, extending the classical -integers framework introduced in quasicrystal modeling by Gazeau. We study how the choice of algebraic parameters of the base influences the self-similarity and other combinatorial properties of the encoding symbolic sequence. These properties, namely repetitivity and palindromicity, are key features deciding the character of the spectrum of the underlying one-dimensional Schrödinger operator with aperiodic potential.Open AccessCodings of B-Integers in Cantor Numeration Systems as Generators of Aperiodic Potentials
Cantor real numeration systems provide a natural algebraic source of self-similar aperiodic structures, extending the classical -integers framework introduced in quasicrystal modeling by Gazeau. We study how the choice of algebraic parameters of the base influences the self-similarity and other combinatorial properties of the encoding symbolic sequence. These properties, namely repetitivity and palindromicity, are key features deciding the character of the spectrum of the underlying one-dimensional Schrödinger operator with aperiodic potential. - Open Access
Reflection on the reflection complexity
The factor complexity ${\mathcal C}_{\mathbf u}$ of a sequence ${\mathbf u} = u_0u_1u_2 \cdots$ over a finite alphabet counts the number of factors of length $n$ occurring in $\mathbf u$, i.e., ${\mathcal C}_{\mathbf u}(n) = \#{\mathcal L}_n(\mathbf u)$, where ${\mathcal L}_n({\mathbf u)}= \{u_iu_{i+1}\cdots u_{i+n-1}: i \in \mathbb N\}$. Two factors of ${\mathcal L}_n(\mathbf u)$ are said to be equivalent if one factor is the reversal of the other one. Recently, Allouche et al. introduced the reflection complexity $r_{\mathbf u}$ which counts the number of non-equivalent factors of $\mathcal{L}_n(\mathbf u)$. They formulated the following conjecture: a sequence $\mathbf u$ is eventually periodic if and only if $r_{\mathbf u}(n+2) = r_{\mathbf u}(n)$ for some $n \in \mathbb N$. Here we prove the conjecture and characterize the sequences for which $r_{\mathbf u}(n+2) = r_{\mathbf u}(n)+1$ for every $n \in \mathbb N$ and also the sequences for which the equality is satisfied for every sufficiently large $n \in \mathbb N$.Open AccessReflection on the reflection complexity
The factor complexity ${\mathcal C}_{\mathbf u}$ of a sequence ${\mathbf u} = u_0u_1u_2 \cdots$ over a finite alphabet counts the number of factors of length $n$ occurring in $\mathbf u$, i.e., ${\mathcal C}_{\mathbf u}(n) = \#{\mathcal L}_n(\mathbf u)$, where ${\mathcal L}_n({\mathbf u)}= \{u_iu_{i+1}\cdots u_{i+n-1}: i \in \mathbb N\}$. Two factors of ${\mathcal L}_n(\mathbf u)$ are said to be equivalent if one factor is the reversal of the other one. Recently, Allouche et al. introduced the reflection complexity $r_{\mathbf u}$ which counts the number of non-equivalent factors of $\mathcal{L}_n(\mathbf u)$. They formulated the following conjecture: a sequence $\mathbf u$ is eventually periodic if and only if $r_{\mathbf u}(n+2) = r_{\mathbf u}(n)$ for some $n \in \mathbb N$. Here we prove the conjecture and characterize the sequences for which $r_{\mathbf u}(n+2) = r_{\mathbf u}(n)+1$ for every $n \in \mathbb N$ and also the sequences for which the equality is satisfied for every sufficiently large $n \in \mathbb N$. - Open Access
- 7 November 2025
- Published by Czech Technical University in Prague - Central Library in Acta Polytechnica
- Vol. 65 (5) , 534-538
Frequencies of letters in infinite k-balanced sequences
The frequency of letters in a symbolic sequence u over a finite alphabet is one of the basic characteristics of u. The notion of k-balancedness captures the property that the number of any letter occurring in two arbitrary factors of u of equal length differs at most by k. For a fixed integer k and alphabet size d ∈ N, we discuss possible frequencies of letters in k-balanced d-ary sequences. For the size d of the alphabet, we introduce the notion of balancedness threshold BT(d) and provide an upper bound on it, where BT(d) is the minimum k such that there exists a k-balanced sequence over a d-letter alphabet for all possible letter frequencies.
- 7 November 2025
- Published by Czech Technical University in Prague - Central Library in Acta Polytechnica
- Vol. 65 (5) , 534-538
Open AccessFrequencies of letters in infinite k-balanced sequences
The frequency of letters in a symbolic sequence u over a finite alphabet is one of the basic characteristics of u. The notion of k-balancedness captures the property that the number of any letter occurring in two arbitrary factors of u of equal length differs at most by k. For a fixed integer k and alphabet size d ∈ N, we discuss possible frequencies of letters in k-balanced d-ary sequences. For the size d of the alphabet, we introduce the notion of balancedness threshold BT(d) and provide an upper bound on it, where BT(d) is the minimum k such that there exists a k-balanced sequence over a d-letter alphabet for all possible letter frequencies.
- Open Access
Frequencies of letters in infinite $k$-balanced sequences
Frequency of letters in a symbolic sequence ${\bf u}$ over a finite alphabet is one of the basic characteristics of ${\bf u}$. The notion of $k$-balancedness captures the property that the number of any letter occurring in two arbitrary factors of ${\bf u}$ of equal length differs at most by $k$. For a fixed integer $k$ and alphabet size $d\in \mathbb N$, we discuss possible frequencies of letters in $k$-balanced $d$-ary sequences. For the size $d$ of the alphabet, we introduce the notion of balancedness threshold $BT(d)$ and give an upper bound on it, where $BT(d)$ is the minimum $k$ such that there exists a $k$-balanced sequence over a $d$-letter alphabet for all possible letter frequencies.Open AccessFrequencies of letters in infinite $k$-balanced sequences
Frequency of letters in a symbolic sequence ${\bf u}$ over a finite alphabet is one of the basic characteristics of ${\bf u}$. The notion of $k$-balancedness captures the property that the number of any letter occurring in two arbitrary factors of ${\bf u}$ of equal length differs at most by $k$. For a fixed integer $k$ and alphabet size $d\in \mathbb N$, we discuss possible frequencies of letters in $k$-balanced $d$-ary sequences. For the size $d$ of the alphabet, we introduce the notion of balancedness threshold $BT(d)$ and give an upper bound on it, where $BT(d)$ is the minimum $k$ such that there exists a $k$-balanced sequence over a $d$-letter alphabet for all possible letter frequencies. - 30 June 2025
- Published by Springer Nature
- p. 116-127
Symmetries of Rich Sequences with Minimum Critical Exponent
- 30 June 2025
- Published by Springer Nature
- p. 116-127
Symmetries of Rich Sequences with Minimum Critical Exponent
- 2 June 2025
- Published by Springer Nature in Acta Mathematica Hungarica
- Vol. 176 (1) , 15-47
Substitutions and Cantor real numeration systems
- 2 June 2025
- Published by Springer Nature in Acta Mathematica Hungarica
- Vol. 176 (1) , 15-47
Substitutions and Cantor real numeration systems
- 8 January 2025
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 119 (2) , 1-25
Finiteness property in Cantor real numeration systems
- 8 January 2025
- Published by Springer Nature in Revista de la Real Academia de Ciencias Exactas, Fisicas y Naturales. Serie A. Matematicas
- Vol. 119 (2) , 1-25
Finiteness property in Cantor real numeration systems
- 10 August 2024
- Published by Springer Nature in Theory of Computing Systems
- Vol. 68 (6) , 1537-1555
2-Balanced Sequences Coding Rectangle Exchange Transformation
- 10 August 2024
- Published by Springer Nature in Theory of Computing Systems
- Vol. 68 (6) , 1537-1555
2-Balanced Sequences Coding Rectangle Exchange Transformation
- Open Access
- 4 June 2024
- Published by Springer Nature in Research in Number Theory
- Vol. 10 (3) , 1-18
Periodicity and pure periodicity in alternate base systems
We study the Cantor real base numeration system which is a common generalization of two positional systems, namely the Cantor system with a sequence of integer bases and the Rényi system with one real base. We focus on the case of an alternate base $$\varvec{\mathcal {B}}$$ given by a purely periodic sequence $$(\beta _n)_{n\ge 1}$$ of real numbers greater than 1. We answer an open question of Charlier et al. (J Number Theory 254:184–198, 2024, https://doi.org/10.1016/j.jnt.2023.07.008) on the set of numbers with eventually periodic $$\varvec{\mathcal {B}}$$ -expansions. We also investigate for which bases all sufficiently small rationals have a purely periodic $$\varvec{\mathcal {B}}$$ -expansion. We show that a necessary condition for this phenomenon is that $$\delta =\prod _{n=1}^{p}\beta _n$$ (where p is the period-length of $$\varvec{\mathcal {B}}$$ ) is a Pisot or a Salem unit. We also provide a sufficient condition. We thus generalize the results known for the Rényi numeration system, i.e. for the case when $$p=1$$ . We provide a class of alternate bases in which all rational numbers in the interval [0, 1) have a purely periodic $$\varvec{\mathcal {B}}$$ -expansion.- 4 June 2024
- Published by Springer Nature in Research in Number Theory
- Vol. 10 (3) , 1-18
Open AccessPeriodicity and pure periodicity in alternate base systems
We study the Cantor real base numeration system which is a common generalization of two positional systems, namely the Cantor system with a sequence of integer bases and the Rényi system with one real base. We focus on the case of an alternate base $$\varvec{\mathcal {B}}$$ given by a purely periodic sequence $$(\beta _n)_{n\ge 1}$$ of real numbers greater than 1. We answer an open question of Charlier et al. (J Number Theory 254:184–198, 2024, https://doi.org/10.1016/j.jnt.2023.07.008) on the set of numbers with eventually periodic $$\varvec{\mathcal {B}}$$ -expansions. We also investigate for which bases all sufficiently small rationals have a purely periodic $$\varvec{\mathcal {B}}$$ -expansion. We show that a necessary condition for this phenomenon is that $$\delta =\prod _{n=1}^{p}\beta _n$$ (where p is the period-length of $$\varvec{\mathcal {B}}$$ ) is a Pisot or a Salem unit. We also provide a sufficient condition. We thus generalize the results known for the Rényi numeration system, i.e. for the case when $$p=1$$ . We provide a class of alternate bases in which all rational numbers in the interval [0, 1) have a purely periodic $$\varvec{\mathcal {B}}$$ -expansion.