[Problem proposal] counting non-decreasing path between two sequence with certain transition polynomial about library-checker-problems HOT 3 OPEN

Thank you for suggesting the problem!

Regarding the suggested problem, I am unsure whether it can be considered a typical problem suitable for verifying the Library.

For the problem of counting monotonic increasing sequences that can be solved using the proposed method, there has already been a suggestion for Library Checker (although it is not yet prepared).

#1019

For the purpose of verifying the Library, is counting such unweighted monotonic increasing sequences insufficient?

If there is a reason why it is difficult to verify methods without a version that includes weighted transitions, I think we can consider this problem as well.

from library-checker-problems.

I thought the first algorithm can only handle unweighted version (to my understanding, it can only handle $\frac{1}{1-x}$) while the second one can handle more diverse transition under stricter constraint, in such case, I think it is reasonable to have a separate problem since the problems they can handle are kind of disjoint, and neither first problem can test second algorithm nor second problem can test first algorithm.

Or do I have some misunderstanding about the capability of these two algorithm? In such case, please tell me, thanks you!

from library-checker-problems.

Thank you. I am considering adopting the problem.

I am struggling with the problem title. Currently, the following names have been proposed. Do you like any of them, or do you have any other suggestions?

• Counting Non-Decreasing Paths Between Two Sequences with a Certain Transition Polynomial
• Number of Increasing Sequences Between Two Sequences (with Transition Weights)
  • Use the name of an existing similar problem
• (Repeated) Weighted Transition with Side Boundaries

from library-checker-problems.