A new BCSFR algorithm uses characteristic sets to characterize full-rank equivalence conditions for binary symbolic matrices as zeros of triangular sets, enabling simpler optimization of linear coding schemes.
An elimination method for polynomial systems
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
method 1polarities
use method 1representative citing papers
Constructs silting t-structures in the Q-shaped derived category from admissible partitions of Q, with explicit cotorsion pairs, homological descriptions, and examples of when none exist.
citing papers explorer
-
An Algebraic Method for Full-Rank Characterization in Binary Linear Coding
A new BCSFR algorithm uses characteristic sets to characterize full-rank equivalence conditions for binary symbolic matrices as zeros of triangular sets, enabling simpler optimization of linear coding schemes.
-
Silting t-structures in $Q$-shaped derived categories
Constructs silting t-structures in the Q-shaped derived category from admissible partitions of Q, with explicit cotorsion pairs, homological descriptions, and examples of when none exist.