Harmonic Tutte polynomials of matroids
From MaRDI portal
Publication:6041585
Abstract: In the present paper, we introduce the concept of harmonic Tutte polynomials of matroids and discuss some of their properties. In particular, we generalize Greene's theorem, thereby expressing harmonic weight enumerators of codes as evaluations of harmonic Tutte polynomials.
Recommendations
Cites work
- scientific article; zbMATH DE number 420868 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 5182595 (Why is no real title available?)
- A Contribution to the Theory of Chromatic Polynomials
- A generalization of the Tutte polynomials
- A new proof of the Assmus-Mattson theorem for non-binary codes
- A note on Assmus-Mattson type theorems
- An elementary approach to toy models for D. H. Lehmer's conjecture
- An upper bound of the value of t of the support t-designs of extremal binary doubly even self-dual codes
- Codes, arrangements and matroids
- Conformal designs and D.H. Lehmer's conjecture
- Design-theoretic analogies between codes, lattices, and vertex operator algebras
- Designs from matroids
- Designs from subcode supports of linear codes
- Fundamentals of Error-Correcting Codes
- Hahn Polynomials, Discrete Harmonics, andt-Designs
- Harmonic weight enumerators of nonbinary codes and MacWilliams identities
- New 5-designs
- On dichromatic polynomials
- On harmonic weight enumerators of binary codes
- On t-designs
- On the support designs of extremal binary doubly even self-dual codes
- The Tutte polynomial
- The support designs of the triply even binary codes of length 48
- Toy models for D. H. Lehmer's conjecture
- Toy models for D. H. Lehmer's conjecture. II
- Weight Enumeration and the Geometry of Linear Codes
Cited in
(4)
This page was built for publication: Harmonic Tutte polynomials of matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6041585)