Coding and counting arrangements of pseudolines (Q644821): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4003411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of arrangements of pseudolines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic sets of linear orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic sets of linear orders via the Bruhat orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Burr, Grünbaum, and Sloane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400995 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axioms and hulls / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3283895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4530626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher Bruhat orders and cyclic hyperplane arrangements / rank
 
Normal rank

Latest revision as of 15:35, 4 July 2024

scientific article
Language Label Description Also known as
English
Coding and counting arrangements of pseudolines
scientific article

    Statements

    Coding and counting arrangements of pseudolines (English)
    0 references
    0 references
    0 references
    7 November 2011
    0 references
    0 references
    combinatorial geometry
    0 references
    enumeration
    0 references
    pseudoline
    0 references
    cutpath
    0 references
    0 references