On mixed $b$-concatenations of Fibonacci and Lucas numbers that are Lucas numbers

Let $(F_n{)}_{n\ge 0}$ and $(L_n{)}_{n\ge 0}$ denote the sequences of Fibonacci and Lucas numbers respectively. This paper determines all Lucas numbers that can be represented as base $b$ mixed concatenations of a Fibonacci number and a Lucas number. Mathematically, we study of two Diophantine equations $L_n=b^d{L}_m+F_k$ and $L_n=b^d{F}_m+L_k$, where $d$ is the number of digits of $F_k$ or $L_k$ in base $b$. To tackle these equations, we combine tools from Diophantine approximation on non-zero linear forms in logarithms and reduction methods based on continued fractions. This allows us to prove that only finitely many such Lucas numbers exist.