Global rank axioms for poset matroids (Q1882496): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-004-0319-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1988375385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids on partially ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5532570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4464129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4543335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Report on the present state of combinatorics / rank
 
Normal rank

Latest revision as of 12:03, 7 June 2024

scientific article
Language Label Description Also known as
English
Global rank axioms for poset matroids
scientific article

    Statements

    Global rank axioms for poset matroids (English)
    0 references
    0 references
    0 references
    1 October 2004
    0 references
    Poset matroid is a notion similar to matroid where the bases are necessarily filters of a given poset. Poset matroids are related to combinatorial schemes defined for distributive lattices. In this article the authors give an axiom system for the rank function of a poset matroid very similar to the ordinary matroid rank function axioms.
    0 references
    0 references
    poset matroid
    0 references
    combinatorial scheme
    0 references
    rank function
    0 references
    0 references