Josef Rukavicka

activity

20172026

most citedOn Number of Rich Words

8 citations · 28 across the 18 of their papers we have counts for

collaborators

Showing 2021Show all

3 papers · 1 filter

math.CO2021★ 2 cited

Palindromic factorization of rich words

Josef Rukavicka

A finite word $w$ is called \emph{rich} if it contains $∣ w ∣ + 1$ distinct palindromic factors including the empty word. For every finite rich word $w$ there are distinct non…

math.PR2021

Secretary problem and two almost the same consecutive applicants

Josef Rukavicka

We present a new variant of the secretary problem. Let $A$ be a totally ordered set of $n$ \emph{applicants}. Given $P \subseteq A$ and $x \in A$ , let $rr(P,x)=\vert\{z\in P \mid z\l…

math.CO2021★ 3 cited

Palindromic Length and Reduction of Powers

Josef Rukavicka

Given a nonempty finite word $v$ , let $P L (v)$ be the palindromic length of $v$ ; it means the minimal number of palindromes whose concatenation is equal to $v$ . Let $v^{R}$ denote the…