Refinement Order

Refinement Order is a partial order on partitions of a set in which one partition is considered less than or equal to another if every block of the first is contained in a block of the second, thereby formalizing the notion of increasingly finer division within the framework of combinatorial set theory.

10

Publications

334

Citations

24

Authors

20

Institutions

Publications per year

2017–2026

5

Authors

24

  1. RC
    Reynold Cheng

    University of Hong Kong, Hong Kong SAR China

    1 publications · 45 citations

    1

    h-index

  2. AC
    A. Colombo

    University of Bergamo, Italy

    1 publications · 31 citations

    1

    h-index

  3. LM
    Larissa Meinicke

    Macquarie University, Australia

    1 publications · 19 citations

    1

    h-index

  4. KF
    Krzysztof Fidkowski

    University of Michigan, United States

    1 publications · 31 citations

    1

    h-index

  5. AG
    A. Ghidoni

    University of Brescia, Italy

    1 publications · 31 citations

    1

    h-index

1–5 of 24

Venues

  1. The Electronic Journal of Combinatorics

    1 publications · 23 citations

    1

    h-index

  2. IEEE Transactions on Image Processing

    1 publications · 119 citations

    1

    h-index

  3. Proceedings of the VLDB Endowment

    PVLDB · 1 publications · 45 citations

    1

    h-index

  4. Quantum

    1 publications · 29 citations

    1

    h-index

  5. 1

    h-index

1–5