2021/04/18 by Higgins, Peter M.
#05A99 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.2104.08905
There are n travellers who have k bicycles and they wish to complete a journey in the shortest possible time. We investigate optimal solutions of this problem, showing they are characterized by a set of words in the Dyck language. Particular solutions with additional desirable properties are introduced and analysed.