EPEdita Pelantová

Edita Pelantová

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Edita Pelantová has a total of 101 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Reflection on the Reflection Complexity

    by Lubomíra Dvořáková, Edita Pelantová

    The factor complexity $$\mathcal {C}_{{\textbf {u}}}$$ C u of a sequence $$\textbf{u}= \varvec{u}_{0}\varvec{u}_{1}\varvec{u}_{2} \cdots $$ u = u 0 u 1 u 2 ⋯ over a finite alphabet counts the number of factors of length n occurring in $$\textbf{u}$$ u , i.e., $$\mathcal {C}_\textbf{u}{(n)} = \#{\mathcal {L}}_n(\textbf{u})$$ C u ( n ) = # L n ( 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}{\}}$$ L n ( u ) = { u i u i + 1 ⋯ u i + n - 1 : i ∈ N } . Two factors of $${\mathcal {L}}_{{n}}\varvec{(}\textbf{u}\varvec{)}$$ L n ( u ) 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}$$ r u which counts the number of non-equivalent factors of $${\mathcal {L}}_{{n}}\varvec{(}\textbf{u}\varvec{)}$$ L n ( u ) . They formulated the following conjecture: a sequence $$\textbf{u}$$ u is eventually periodic if and only if $${r}_\textbf{u}{(n+2)} = {r}_\textbf{u}{(n)}$$ r u ( n + 2 ) = r u ( n ) for some $${n} \in \mathbb {N}$$ n ∈ N . Here we prove the conjecture and characterize the sequences for which $${r}_\textbf{u}{(n+2)} = {r}_\textbf{u}{(n)+1}$$ r u ( n + 2 ) = r u ( n ) + 1 for every $${n} \in \mathbb {N}$$ n ∈ N and also the sequences for which the equality is satisfied for every sufficiently large $${n} \in \mathbb {N}$$ n ∈ N .

  • Open Access

    Codings of B-Integers in Cantor Numeration Systems as Generators of Aperiodic Potentials

    by Lubomíra Dvořáková, Zuzana Masáková, Edita Pelantová

    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 B=(βi)i∈Z 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

    by Lubomíra Dvořáková, Edita Pelantová

    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

    Frequencies of letters in infinite k-balanced sequences

    by L’ubomíra Dvořáková, Edita Pelantová

    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

    by Lubomíra Dvořáková, Edita Pelantová

    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.

  • Symmetries of Rich Sequences with Minimum Critical Exponent

    by L’Ubomíra Dvořáková, Edita Pelantová

  • Substitutions and Cantor real numeration systems

    by É. Charlier, C. Cisternino, Z. Masáková, E. Pelantová


  • 2-Balanced Sequences Coding Rectangle Exchange Transformation

    by Lubomíra Dvořáková, Zuzana Masáková, Edita Pelantová


  • Open Access

    Periodicity and pure periodicity in alternate base systems

    by Zuzana Masáková, Edita Pelantová

    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}}$$ B given by a purely periodic sequence $$(\beta _n)_{n\ge 1}$$ ( β n ) n ≥ 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}}$$ B -expansions. We also investigate for which bases all sufficiently small rationals have a purely periodic $$\varvec{\mathcal {B}}$$ B -expansion. We show that a necessary condition for this phenomenon is that $$\delta =\prod _{n=1}^{p}\beta _n$$ δ = ∏ n = 1 p β n (where p is the period-length of $$\varvec{\mathcal {B}}$$ 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$$ 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}}$$ B -expansion.