Conjecture on adjacent factorizations in generalized arithmetic monoids with gcd one
Let be the generalized arithmetic monoid under consideration, let , and let be its set of factorizations. For factorizations , write for their lengths and for their distance. Let be the parameter appearing in the source formulas. The adjacent-factorization conjecture. Assume
and that there exist such that , , and . Then there exists such that
Further, if , then
and if , then
The claim is intended to establish the length-adjacent factorization condition needed for strict inequality between regular and monotone catenary degrees in the gcd-one case; the source provides no resolution, so it remains open.
References
Primary source
Daniel Gonzalez Cedre, Cameron Wright and Jenna Zomback, “Monotone Catenary Degree in Numerical Monoids”, arXiv:1912.08114 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.