Characteristic-dependent linear rank inequalities in 21 variables
Portada 43 (169) 2019
PDF
XML

How to Cite

Peña-Macias, V., & Sarria - Zapata, H. (2019). Characteristic-dependent linear rank inequalities in 21 variables. Revista De La Academia Colombiana De Ciencias Exactas, Físicas Y Naturales, 43(169), 764–770. https://doi.org/10.18257/raccefyn.928

Downloads

Download data is not yet available.

Métricas Alternativas


Dimensions

Abstract

In Linear Algebra over finite fields, a characteristic-dependent linear rank inequality is a linear inequality that holds by ranks of spans of vector subspaces of a finite dimensional vector space over a finite field of determined characteristic, and does not in general hold over fields with other characteristic. This paper shows a preliminary result in the production of these inequalities. We produce three new inequalities in 21 variables using as guide a particular binary matrix, with entries in a finite field, whose rank is 8, with characteristic 2; 9 with characteristic 3; or 10 with characteristic neither 2 nor 3. The first inequality is true over fields whose characteristic is 2; the second inequality is true over fields whose characteristic is 2 or 3; the third inequality is true over fields whose characteristic is neither 2 nor 3.

https://doi.org/10.18257/raccefyn.928

Keywords

Entropy; Linear rank inequality; Binary matrix; Direct sum in vector spaces.
PDF
XML

References

Blasiak A., Kleinberg R., Lubetzky E. (2011). Lexicographic products and the power of non-Linear Network Coding. Foundations of Computer Science (FOCS) 2011 IEEE 52nd Annual Symposium on. 609-618.

Dougherty R., Freiling C., Zeger K. (2005). Insufficiency of linear coding in network information flow. IEEE Transactions on Information Theory. 51 (8): 2745-2759.

Dougherty R., Freiling C., Zeger K. (2013). Achievable rate regions for Network Coding. IEEE Transactions on Information Theory. 61 (5): 2488-2509.

Freiling E.F. (2014). Characteristic dependent linear rank inequalities and applications to Network Coding. Ph.D. thesis. San Diego, The United States: University of California.

Ingleton W. (1969). Representation of matroids. Combinatorial mathematics and its applications. Oxford. 149-167.

Kinser R. (2011). New inequalities for subspace arrangements. Journal Combinatorial Theory Serie A. 118 (1): 152-161.

Shen A., Hammer D., Romashchenko A.E., Vereshchagin N.K. (2000). Inequalities for Shannon entropy and Kolmogorov complexity. Journal of Computer and Systems Sciences. 60: 442-464.

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Copyright (c) 2019 Revista de la Academia Colombiana de Ciencias Exactas, Físicas y Naturales