Advanced search
Start date
Betweenand


On counting and constructing all admissible orders of the non-empty intervals in any finite chain

Full text
Author(s):
Sussner, Peter ; Vicentin, Felipe Scherer
Total Authors: 2
Document type: Journal article
Source: FUZZY SETS AND SYSTEMS; v. 511, p. 9-pg., 2025-07-01.
Abstract

In many fields, there is a need to process data that only includes a finite number of values. To express the uncertainty regarding these values, one can use non-empty intervals, called epistemic, that are usually ordered in terms of the product, aka marginal, order. However, a partial order of this form is often insufficient in applications such as decision making, optimization, image segmentation, and edge detection. To this end, the given partial order of the non-empty intervals in a finite chain must be extended to a linear order, known as an admissible order. In this paper, we determine the number of all of these linear extensions and present an algorithm for generating them. (AU)

FAPESP's process: 23/03449-0 - Investigations on the Construction and Number of Linear Extensions of the Marginal Order on the Class of Subintervals of Any Finite Chain
Grantee:Felipe Scherer Vicentin
Support Opportunities: Scholarships in Brazil - Scientific Initiation
FAPESP's process: 20/09838-0 - BI0S - Brazilian Institute of Data Science
Grantee:João Marcos Travassos Romano
Support Opportunities: Research Grants - Research Centers in Engineering Program