The authors define divisible weighted projective spaces, give sharp bounds for minimal-degree non-degenerate subvarieties therein, and develop a theory of weighted determinantal scrolls that achieve minimal degree while satisfying weighted N_p properties tied to regularity notions.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
The paper surveys Iiro Honkala's contributions to identifying codes across complexity, combinatorics, grids, graph parameters, structural properties, and optimal code counts.
citing papers explorer
-
Varieties of minimal degree in weighted projective space
The authors define divisible weighted projective spaces, give sharp bounds for minimal-degree non-degenerate subvarieties therein, and develop a theory of weighted determinantal scrolls that achieve minimal degree while satisfying weighted N_p properties tied to regularity notions.
-
On Iiro Honkala's contributions to identifying codes
The paper surveys Iiro Honkala's contributions to identifying codes across complexity, combinatorics, grids, graph parameters, structural properties, and optimal code counts.