5 problems

M5GB performance conjecture. The M5GB algorithm will continue to outperform the classic algorithm for even larger systems, as long as they are sufficiently overdefined.

Isohexagon conjecture. All case one examples are isohexagons.

Let $p,p_i,q$ be pairwise distinct primes greater than $2$, and let $k,k_i$ be positive integers. For cyclotomy $l$, let ${\sf N}(l)$ denote the number of basis elements at weight…

Let $bc$ be an indeterminate. Define the rising factorial $(a)_m=a(a+1)\cdots(a+m-1)$, with $(a)_0=1$, and let $C(n)$, $F(n)$, and $G(n)$ be the sequences defined by the displayed…

Let $x^n-1$ be a sparse polynomial, whose input size is $O(\log n)$, and consider algorithms that factor polynomials while representing the output as expanded polynomials. Cyclotom…