MPM. Rajavel Praveen
M. Rajavel Praveen
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
M. Rajavel Praveen has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Rama Raghavan
Indian Institute of Technology Madras
3 shared publications - Ujjwal Kumar Mishra
Indian Institute of Technology Madras
1 shared publication
Latest Publications
- 14 February 2025
- Published by Springer Nature
- p. 13-23
The $\ell $-Rauzy Graphs for Scattered and Non-scattered Subwords of Generalized Rainbow Words- 14 February 2025
- Published by Springer Nature
- p. 13-23
The $\ell $-Rauzy Graphs for Scattered and Non-scattered Subwords of Generalized Rainbow Words- 1 December 2024
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 18 (4) , 824-838
The $ \ell $-Rauzy Graphs on Infinite WordsWord-representable graphs are vital in the Combinatorics of Words and Graph Theory. We define one such graph, the \( \ell \)-Rauzy graph, and study its structural properties for a few infinite words. The \( \ell \)-Rauzy graph of order \( k \) for an infinite word \( w \) is a directed graph in which each vertex is a subword of length \( k \) of \( w \), where any two vertices \( u,v \) form an arc \( uv \) iff the prefix of \( v \) of length \( \ell \) is the same as the suffix of \( u \) of length \( \ell \) and the concatenated word formed by the arc \( uv \) of length \( 2k-\ell \) is a subword of \( w \). As main results, we show that the \( \ell \)-Rauzy graph of order \( k \) for the infinite Fibonacci word \( f \) is strongly connected, and we explicitly find the graph structure of the \( \ell \)-Rauzy graph of order \( k \) for an infinite periodic word, by knowing the locations of subwords of \( f \) and infinite periodic words. As locating the subwords in an infinite word is not easy, we show that the \( \ell \)-Rauzy graph of order \( k \) for an Arnoux-Rauzy word is strongly connected using a different approach. \( \ell \)- 1 December 2024
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 18 (4) , 824-838
The $ \ell $-Rauzy Graphs on Infinite WordsWord-representable graphs are vital in the Combinatorics of Words and Graph Theory. We define one such graph, the \( \ell \)-Rauzy graph, and study its structural properties for a few infinite words. The \( \ell \)-Rauzy graph of order \( k \) for an infinite word \( w \) is a directed graph in which each vertex is a subword of length \( k \) of \( w \), where any two vertices \( u,v \) form an arc \( uv \) iff the prefix of \( v \) of length \( \ell \) is the same as the suffix of \( u \) of length \( \ell \) and the concatenated word formed by the arc \( uv \) of length \( 2k-\ell \) is a subword of \( w \). As main results, we show that the \( \ell \)-Rauzy graph of order \( k \) for the infinite Fibonacci word \( f \) is strongly connected, and we explicitly find the graph structure of the \( \ell \)-Rauzy graph of order \( k \) for an infinite periodic word, by knowing the locations of subwords of \( f \) and infinite periodic words. As locating the subwords in an infinite word is not easy, we show that the \( \ell \)-Rauzy graph of order \( k \) for an Arnoux-Rauzy word is strongly connected using a different approach. \( \ell \)- Open Access
A Note On $\ell$-Rauzy Graphs for the Infinite Fibonacci Word
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,v_2)$ is formed if the concatenation of the word $v_1$ and the suffix of $v_2$ of length $k-\ell$ is a subword of the infinite word. In this paper, we consider one of the important aperiodic recurrent words, the infinite Fibonacci word for discussion. We prove a few basic properties of the $\ell$-Rauzy graph of the infinite Fibonacci word. We also prove that the $\ell$-Rauzy graphs for the infinite Fibonacci word are strongly connected.Open AccessA Note On $\ell$-Rauzy Graphs for the Infinite Fibonacci Word
The $\ell$-Rauzy graph of order $k$ for any infinite word is a directed graph in which an arc $(v_1,v_2)$ is formed if the concatenation of the word $v_1$ and the suffix of $v_2$ of length $k-\ell$ is a subword of the infinite word. In this paper, we consider one of the important aperiodic recurrent words, the infinite Fibonacci word for discussion. We prove a few basic properties of the $\ell$-Rauzy graph of the infinite Fibonacci word. We also prove that the $\ell$-Rauzy graphs for the infinite Fibonacci word are strongly connected.