Name
Abstract | ||
|---|---|---|
From the generating matrix of a linear code, one can construct a sequence of generalized star configurations which are strongly connected to the generalized Hamming weights and the underlying matroid of the code. When the code is MDS, the matrix is generic and we obtain the usual star configurations. In our main result, we show that the degree of a generalized star configuration as a projective scheme is determined by the Tutte polynomial of the code. In the process, we obtain preliminary results on the primary decomposition of the defining ideals of these schemes. Additionally, we conjecture that these ideals have linear minimal free resolutions and prove partial results in this direction. |
Year | DOI | Venue |
|---|---|---|
2016 | https://doi.org/10.1007/s10801-017-0751-9 | Journal of Algebraic Combinatorics |
Keywords | Field | DocType |
Star configuration,Tutte polynomial,Hilbert polynomial,Generalized Hamming weights,Free resolution,Primary 05B35,Secondary: 13D40,94B27,11T71,14G50 | Hamming code,Polynomial code,Cyclic code,Matrix polynomial,Chromatic polynomial,Matroid,Discrete mathematics,Topology,Combinatorics,Algebra,Tutte polynomial,Linear code,Mathematics | Journal |
Volume | Issue | ISSN |
46 | 1 | 0925-9899 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benjamin Anzis | 1 | 0 | 0.34 |
| Mehdi Garrousian | 2 | 0 | 0.68 |
| Stefan O. Tohaneanu | 3 | 15 | 5.03 |