On Brylawski's generalized duality
From MaRDI portal
Publication:1949045
Abstract: We introduce a notion of duality (due to Brylawski) that generalizes matroid duality to arbitrary rank functions. This generalized duality allows for generalized operations (deletion and contraction) and a generalized polynomial based on the matroid Tutte polynomial. This polynomial satisfies a deletion-contraction recursion. We explore this notion of duality for greedoids, antimatroids and demi-matroids, proving that matroids correspond precisely to objects that are simultaneously greedoids and "dual" greedoids.
Recommendations
Cites work
- scientific article; zbMATH DE number 3742601 (Why is no real title available?)
- scientific article; zbMATH DE number 67324 (Why is no real title available?)
- scientific article; zbMATH DE number 5873618 (Why is no real title available?)
- A Greedoid Polynomial Which Distinguishes Rooted Arborescences
- A characterization of orthogonal duality in matroid theory
- A use for frequently rediscovering a concept
- An abstract duality
- Duality in Polymatroids and Set Functions
- Generalized Hamming weights for linear codes
- Generalized activities and the Tutte polynomial
- Introduction to Greedoids
- Lattices with unique irreducible decompositions
- Thomas H. Brylawski (1944--2007)
- Wei-type duality theorems for matroids
Cited in
(9)- An abstract duality
- Relative profiles and extended weight polynomials of almost affine codes
- Linear relations for a generalized Tutte polynomial
- scientific article; zbMATH DE number 4077457 (Why is no real title available?)
- Hamming polynomial of a demimatroid
- Flags of almost affine codes and the two-party wire-TAP channel of type II
- Generalized Benson-Carlson duality
- Wei-type duality theorems for rank metric codes
- Wei-type duality theorems for matroids
This page was built for publication: On Brylawski's generalized duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949045)