3 problems

Linear-time algorithm conjecture. The problem can be solved in $O(n)$ time; however, any approach that requires unmarking already visited cells is unlikely to achieve this complexi…

Let $G$ be a finite abelian group, let $\exp(G)$ denote its exponent, and let $\mathsf{D}(G)$ denote its Davenport constant. Let $\mathsf{s}_{k\exp(G)}(G)$ be the smallest length f…

Erdős–Ginzburg–Ziv conjecture for semigroups. For any finite commutative semigroup $\mathcal{S}$,