Premium
Subspace arrangements as generalized star configurations
Author(s) -
Tohǎneanu Ştefan O.
Publication year - 2017
Publication title -
mathematische nachrichten
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.913
H-Index - 50
eISSN - 1522-2616
pISSN - 0025-584X
DOI - 10.1002/mana.201700230
Subject(s) - mathematics , star (game theory) , subspace topology , variety (cybernetics) , projective test , interpolation (computer graphics) , projective variety , type (biology) , pure mathematics , algebra over a field , discrete mathematics , mathematical analysis , computer science , artificial intelligence , statistics , motion (physics) , ecology , biology
In this note, 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 about the number of equations needed to define a generalized star configuration variety.