Indexed metadata

Counting subspaces with prescribed Welch sums

Kaimin Cheng, Jie Hu

Source record

Source: arXiv

Published: Oct 11, 2026

arXiv: 2610.15694

Open original source ↗

Source abstract

Let q=2nq=2^n with n=2m+1n=2m+1 for an integer m≥1m\ge1, and let Fq{\mathbb F}_q be the finite field with qq elements. Let Wn(x)=x2m+3W_n(x)=x^{2^m+3} be the Welch function on Fq{\mathbb F}_q. For 1≤k≤n1\le k\le n and b∈Fqb\in{\mathbb F}_q, denote by Nn,k(b)N_{n,k}(b) the number of kk-dimensional F2{\mathbb F}_2-subspaces EE of $\mathbb F}_q$ such that ∑x∈EWn(x)=b. \sum_{x\in E}W_n(x)=b. In this paper, we determine Nn,k(b)N_{n,k}(b) for all kk. The only nontrivial case is k=3k=3, for which the answer is given in terms of a binary Kloosterman sum. As a consequence, we prove a recent conjecture of Hou and Zhao on the third-order sum-freedom of the Welch function.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Counting subspaces with prescribed Welch sums — Mathematical Frontier Network