On Brylawski's generalized duality

From MaRDI portal
Revision as of 16:13, 1 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:1949045

DOI10.1007/S11786-012-0119-4zbMATH Open1262.05017arXiv1201.1831OpenAlexW2121933051MaRDI QIDQ1949045FDOQ1949045

Gary Gordon

Publication date: 25 April 2013

Published in: Mathematics in Computer Science (Search for Journal in Brave)

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.


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





Cites Work


Cited In (6)






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)