arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2605.12232math.CO
收藏

关于有限域上子空间的集状无花椰菜族

On set-like sunflower-free families of subspaces over finite fields

TÜBİTAK BİLGEM UEKAE(土耳其科学院信息通信技术研究所电子与密码学国家研究院);National Research Institute of Electronics and Cryptology(电子与密码学国家研究院)

Kamil Otal

AI总结:

本文探讨了有限域上子空间的集状无花椰菜族,提出了一种基于修改后的提升构造的新方法,解决了传统定义下的无花椰菜族问题。

摘要:

Erdős--Rado无花椰菜问题在有限向量空间中有两种自然类比,对应于两种不同的集合论无花椰菜概念的推广。第一种由Ihringer和Kupavskii提出,要求花瓣在核域上处于一般位置;第二种在子空间码文献中使用,仅要求核等于不同花瓣的 pairwise 交集。本文聚焦于第二种版本,称为集状无花椰菜。我们发现Ihringer-Kupavskii的构造在传统定义下正确,但不产生集状无花椰菜族,并提出了一种基于修改提升构造的集状s-无花椰菜族构造,这是首次针对此设置的系统性构造。

英文摘要:

The Erdős--Rado sunflower problem admits two natural analogues in finite vector spaces, corresponding to two different ways of generalising the set-theoretic notion of a sunflower. The first, used by Ihringer and Kupavskii [FFA 110 (2026) 102746], requires the petals to be in general position over the kernel; the second, used in the subspace codes literature (cf.\ Etzion--Raviv [DAM 186 (2015) 87-97], Blokhuis--De Boeck--D'haeseleer [DCC 90 (2022) 2101-2111]), requires only that the kernel equals the pairwise intersection of distinct petals. We refer to the second version as a \emph{set-like sunflower}, following Blokhuis, De Boeck and D'haeseleer. In this note, we focus on the set-like setting. {We first observe by illustrations that general-position sunflower-freeness does not imply set-like sunflower-freeness.} We then present a construction of set-like $s$-sunflower-free families of $k$-spaces \revised{in $\mathbb{F}_q^n$ for $\lceil(n+1)/2\rceil \leq k \leq n-1$, of size $q^{n-k}$ (and $q^{n-k}+1$ for even $q$),} based on a manipulated version of the lifting construction; to our knowledge, this is the first systematic construction tailored to this setting. Finally, we compare the size of the construction with the exact optimum for small parameters, computed by exhaustive search.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑