Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 80 tok/s
Gemini 2.5 Pro 60 tok/s Pro
GPT-5 Medium 23 tok/s Pro
GPT-5 High 26 tok/s Pro
GPT-4o 87 tok/s Pro
Kimi K2 173 tok/s Pro
GPT OSS 120B 433 tok/s Pro
Claude Sonnet 4 36 tok/s Pro
2000 character limit reached

A bijection between the sets of $(a,b,b^2)$-Generalized Motzkin paths avoiding $\mathbf{uvv}$-patterns and $\mathbf{uvu}$-patterns (2204.07906v1)

Published 17 Apr 2022 in math.CO

Abstract: A generalized Motzkin path, called G-Motzkin path for short, of length $n$ is a lattice path from $(0, 0)$ to $(n, 0)$ in the first quadrant of the XOY-plane that consists of up steps $\mathbf{u}=(1, 1)$, down steps $\mathbf{d}=(1, -1)$, horizontal steps $\mathbf{h}=(1, 0)$ and vertical steps $\mathbf{v}=(0, -1)$. An $(a,b,c)$-G-Motzkin path is a weighted G-Motzkin path such that the $\mathbf{u}$-steps, $\mathbf{h}$-steps, $\mathbf{v}$-steps and $\mathbf{d}$-steps are weighted respectively by $1, a, b$ and $c$. Let $\tau$ be a word on ${\mathbf{u}, \mathbf{d}, \mathbf{v}, \mathbf{d}}$, denoted by $\mathcal{G}_n{\tau}(a,b,c)$ the set of $\tau$-avoiding $(a,b,c)$-G-Motzkin paths of length $n$ for a pattern $\tau$. In this paper, we consider the $\mathbf{uvv}$-avoiding $(a,b,c)$-G-Motzkin paths and provide a direct bijection $\sigma$ between $\mathcal{G}_n{\mathbf{uvv}}(a,b,b2)$ and $\mathcal{G}_n{\mathbf{uvu}}(a,b,b2)$. Finally, the set of fixed points of $\sigma$ is also described and counted.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.