Subspace Arrangements as Generalized Star Configurations
classification
🧮 math.AG
math.AC
keywords
generalizedstarconfigurationsubspaceansweringarrangementarrangementsasked
read the original abstract
In these notes we show that any projective subspace arrangement can be realized as a generalized star configuration variety. This type of interpolation result may be useful in designing linear codes with prescribed codewords of minimum weight, as well as in answering a couple of questions asked by the author in previous work, about the number of equations needed to define a generalized star configuration.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.