Generalized star configurations and the Tutte polynomial

DOI10.1007/S10801-017-0751-9zbMATH Open1368.05071arXiv1604.01311OpenAlexW2963723896MaRDI QIDQ2014258FDOQ2014258

Stefan O. Tohǎneanu, Benjamin Anzis, Mehdi Garrousian

Publication date: 10 August 2017

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1604.01311

zbMATH Keywords

Tutte polynomialHilbert polynomialfree resolutionstar configurationgeneralized Hamming weights

Mathematics Subject Classification ID

Graph polynomials (05C31) Combinatorial aspects of matroids and geometric lattices (05B35) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Hilbert-Samuel and Hilbert-Kunz functions; Poincaré series (13D40) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cites Work

• Title not available (Why is that?)
• Products of linear forms and Tutte polynomials
• Linear free resolutions and minimal multiplicity
• Star configurations in \(\mathbb{P}^n\)
• Generalized Hamming weights for linear codes
• Codes, Arrangements and Matroids
• Title not available (Why is that?)
• Minimum distance of linear codes and the \(\alpha\)-invariant
• Title not available (Why is that?)
• Error-correction of linear codes via colon ideals
• A commutative algebraic approach to the fitting problem
• On the De Boer-Pellikaan method for computing minimum distance
• Title not available (Why is that?)

Cited In (11)

• Linear codes over signed graphs
• Counting Star-Battle configurations
• Symbolic powers of generalized star configurations of hypersurfaces
• Symbolic powers and free resolutions of generalized star configurations of hypersurfaces
• Homological properties of ideals generated by fold products of linear forms
• Demailly's conjecture and the containment problem
• On the structure of matroids arising from the gain graphs
• A blowup algebra for hyperplane arrangements
• On ideals generated by \(a\)-fold products of linear forms
• Subspace arrangements as generalized star configurations
• On the Geramita-Harbourne-Migliore conjecture

Uses Software

• Macaulay2

This page was built for publication: Generalized star configurations and the Tutte polynomial

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014258)