9 problems
Let be a field, let be an integer, and let … Here denotes the partition rank of , and is an al…
Hardness conjecture for the discrete iteration problem. Given and , it is computationally hard to recover for general parameter values, input vectors, and sufficiently…
No-closed-form-expression hypothesis. There is no general closed-form expression for the components of in terms of a fixed polynomial formula with finitely many terms whose s…
Lovett–Adiprasito–Kazhdan–Ziegler conjecture. There exists a constant such that for any finite field and multilinear form we have
Let be a vector space over , and let be an -approximately symmetric multilinear form, meaning that the partition rank of…
Let be a field, let be its algebraic closure, let be -vector spaces, and let …
Let be a field, let be its algebraic closure, and let be a multilinear -polynomial of degree . Write for it…
Let , , , and be integers such that and . Let … The main theorem establishes that, when , there exists an…
Let , let , and let be the space of complex hypermatrices of type . For…