Skip to content
DraconiticResearch
Search Sources API
197,788 studies31 sourcesUpdated 46 min ago
PreprintCC BY 4.0arXiv

On the relations among algebraic models for the MinRank problem

  • Peigen Li
  • Siyong Tao
Open at sourcePDFDOICite

Abstract

In this article, we study the relations between algebraic models for the MinRank problem, which is a well-known NP-hard problem. We establish connections between the minors modeling, the Kipnis-Shamir modeling, and the support minors modeling, providing insights into their equivalences and differences. Our results contribute to a deeper understanding of the algebraic structures underlying the MinRank problem and may inform future research on efficient algorithms for solving it.

Related

  1. On a Digital Signature Based on Matrix Decomposition and the MinRank Problem
    Miguel Ángel López
    arXivPreprintCC BY-SA 4.0Full textAlgebra & number theoryarXiv
  2. Lie Algebraic Uncertainty Relations
    Xiaoli Hu, Naihuan Jing, Jian Zhang +1
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryQuantum physics & quantum informationarXiv
  3. Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes
    Thai Hung Le
    arXivPreprintCC BY 4.0Full textGeneral mathematicsarXiv
  4. Executive Functions Among Kindergarteners in the Capital of Laos: Relations with Socialization Practices and Later Mathematics Skills.
    Yoko Kajiyama, Yusuke Takahashi, Yusuke Moriguchi
    Developmental sciencePeer-reviewedCC BYFull textStatisticsEurope PMCPMC
  5. A Van Hiele–Newman model analysis of geometric reasoning and problem-solving errors among final-year students in a selected senior high school
    Ebenezer Owusu, Yarhands Dissou Arthur, Ernest Larbi
    Frontiers in PsychologyPeer-reviewedCC BY 4.0Full textGeneral mathematicsPMCEurope PMC

Cite

BibTeXRIS
BibTeX
@misc{li2026relations,
  title = {{On the relations among algebraic models for the MinRank problem}},
  author = {Peigen Li and Siyong Tao},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.07223},
  eprint = {2609.07223},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.07223},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - On the relations among algebraic models for the MinRank problem
AU  - Peigen Li
AU  - Siyong Tao
PY  - 2026
DA  - 2026/09/07
PB  - arXiv
DO  - 10.48550/arxiv.2609.07223
UR  - https://arxiv.org/abs/2609.07223
AB  - In this article, we study the relations between algebraic models for the MinRank problem, which is a well-known NP-hard problem. We establish connections between the minors modeling, the Kipnis-Shamir modeling, and the support minors modeling, providing insights into their equivalences and differences. Our results contribute to a deeper understanding of the algebraic structures underlying the MinRank problem and may inform future research on efficient algorithms for solving it.
ER  -