Maximal rank of $4\times 4\times 4$ and $k\times 4\times 3$ tensors over $\mathbb{F}_2$

Jason Yang

Home/Archive/arXiv

arXiv · 2609.05648

Maximal rank of $4\times 4\times 4$ and $k\times 4\times 3$ tensors over $\mathbb{F}_2$

Jason Yang

View original source ↗Read source document ↗Export metadata ↓

Abstract

We determine the maximum rank of $4\times 4\times 4$ and $k\times 4\times 3$ multidimensional arrays over the finite field $\mathbb{F}_2$. These results are made possible by a new method of enumerating non-isomorphic tensors.

Explore related subjects

cs.SC math.CO

Keep this discovery

BibTeX RIS

Jason Yang. 2026-09-04. Maximal rank of $4\times 4\times 4$ and $k\times 4\times 3$ tensors over $\mathbb{F}_2$. https://arxiv.org/abs/2609.05648

Cite the original work for its findings. Save a collection to share your selection of sources.

Discover connections

cs.SC subject math.CO subject

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

arXiv2026

Recurrences for permutations with long increasing subsequences

We prove two simple bivariate recurrences for the number of permutations with a long increasing subsequence. The two recurrences imply D-finiteness of the sequence in a certain range. As a consequence, we also obtain a proof of a conjecture posed by Kauers and Koutschan in 2023.

math.CO↗

arXiv2026

Deciding superellipticity and computing the Weierstrass normal form

Let $ \mathcal{S}_{g,n} \subset \mathcal{M}_g $ be the locus of curves of genus $ g \geq 2 $ admitting a model $ y^n = h(x) $ with $ h $ separable; such curves $C$ have a cyclic group $ C_n \leq \operatorname{Aut}(C) $ of order $ n $ with $ C/C_n \cong \mathbb{P}^1 $. % We give an algorithm which, given an absolutely irreducible plane model $ F(x,y) = 0 $ of a curve $ C $ over a field $ k_0 $ of characteristic zero, decides for which $ n $ the curve lies in $ \mathcal{S}_{g,n} $ and returns a model $ y^n = h(x) $ together with the birational transformation to it.

math.AG↗

arXiv2026

Standard bases for shift-stable groups and Subgroup Membership in wreath products

We develop a notion of standard bases for subgroups of the restricted direct product $G^{(\mathbb{N}^n)}$ that are stable under translation by $\mathbb{N}^n$, where $G$ is an arbitrary finite group. We construct an algorithm that computes standard bases for such subgroups and use them to solve several algorithmic problems, including membership, saturation, and variable elimination. Our approach is inspired by Buchberger's algorithm and the theory of Gröbner bases for ideals in polynomial rings. Building on the standard bases and our solutions to the algorithmic problems above, we prove that Subgroup Membership is decidable in wreath products $G \wr \mathbb{Z}^n$ for finite $G$ and $n \in \mathbb{N}$.

math.GR↗