Combinatorial characterization of inrankings as weak orders induced by intervals

S. V. Muravyov, E. Y. Emelyanova

Research output: Contribution to journalConference articlepeer-review


The problem of reliable processing of heteroscedastic interval data occupies an important niche among urgent topics of measurement science. The paper is devoted to a combinatorial characterization of so called 'inrankings' which are weak orders induced by input intervals of the interval fusion with preference aggregation (IF&PA) procedure. The procedure transforms the given m initial real line intervals into inrankings, which are a specific case of weak order relations (or rankings) over a set of n discrete values belonging to these intervals. The new notation of inranking appears as a result of restrictions imposed on the ordinary rankings by interval character of the initial data. In the paper, the inranking spaces properties are investigated from the combinatorial theory point of view. It is shown that the inranking space is a subset of the set of all weak orders with a single symbol of strict order. The cardinality of inranking space is defined by the triangle number for the given number n of the discrete elements. Cardinalities of other adjacent spaces are considered.

Original languageEnglish
Article number012052
JournalJournal of Physics: Conference Series
Issue number1
Publication statusPublished - 29 Nov 2019
EventJoint IMEKO TC1-TC7-TC13-TC18 Symposium 2019 - St. Petersburg, Russian Federation
Duration: 2 Jul 20195 Jul 2019

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'Combinatorial characterization of inrankings as weak orders induced by intervals'. Together they form a unique fingerprint.

Cite this