arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1903.11587cs.ITmath.IT
收藏

互补向量空间上的特征依赖线性秩不等式

Characteristic-Dependent Linear Rank Inequalities via Complementary Vector Spaces

Victor Pena, Humberto Sarria

摘要:

特征依赖线性秩不等式(英语:Characteristic dependent linear rank inequality)是一个线性不等式,它在一个确定特征的有限域上由向量空间的子空间的秩成立,而在其他特征上一般不成立。本文用一种不同于通常的Doughnut反函数方法的技巧[9],给出了一个新的特征依赖的线性秩不等式.我们采用Blasiak [4]的一些思想,应用于某些互补向量空间,以便产生它们。此外,我们提出了一些应用网络编码。特别是,对于每一个有限或有限的素数集$P$,我们表明,存在一个网络序列$\mathcal{N}\left(k\right)$,其中每个成员是线性可解的领域,当且仅当该领域的特点是在$P$,和线性容量,在领域的特点是不是在$P$,$\rightarrow0$作为$k\rightarrow\infty$。

英文摘要:

A characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of subspaces of a vector space over a finite field of determined characteristic, and does not in general hold over other characteristics. In this paper, we produce new characteristic-dependent linear rank inequalities by an alternative technique to the usual Dougherty's inverse function method [9]. We take up some ideas of Blasiak [4], applied to certain complementary vector spaces, in order to produce them. Also, we present some applications to network coding. In particular, for each finite or co-finite set of primes $P$, we show that there exists a sequence of networks $\mathcal{N}\left(k\right)$ in which each member is linearly solvable over a field if and only if the characteristic of the field is in $P$, and the linear capacity, over fields whose characteristic is not in $P$, $\rightarrow0$ as $k\rightarrow\infty$.

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

↑