3 papers
math.CO2026
The scramble number of outerplanar graphs
Doel Rivera Laboy
For planar graphs, it is known that their treewidth is bounded by , where is the number of vertices of the graph. A related invariant to treewidth, is the scramble…
math.CO2022
Computing the minimum distance of the polar Orthogonal Grassmann code with elementary methods
Sarah Gregory, Fernando Piñero-González, Doel Rivera-Laboy +1
The polar orthogonal Grassmann code is the linear code associated to the Grassmann embedding of the Dual Polar space of . In this manuscript we stud…
cs.IT2021
Affine Hermitian Grassmann Codes
Fernando Piñero González, Doel Rivera Laboy
The Grassmannian is an important object in Algebraic Geometry. One of the many techniques used to study the Grassmannian is to build a vector space from its points in the projectiv…