3 papers
math.CO2025
Structure and growth of -bonacci words
Sergey Dovgal, Sergey Kirgizov
A binary word is called -decreasing, for , if inside this word each of length-maximal (in the local sense) occurrences of a factor of the form , , satisfies $q…
math.CO2025
Maximal entropy random walks and central Markov chains
Yoann Offret, Sergey Dovgal
We introduce and develop the concept of Maximal Entropy Random Walks (MERWs) on Weighted Bratteli Diagrams (WBDs), maximizing entropy production along paths as a natural criterion…
math.CO2024
Asymptotics for graphically divergent series: dense digraphs and 2-SAT formulae
Sergey Dovgal, Khaydar Nurligareev
We propose a new method for obtaining complete asymptotic expansions in a systematic manner, which is suitable for counting sequences of various graph families in dense regime. The…