Isolated Suborders and their Application to Counting Closure Operators

02/25/2023
by   Roland Glück, et al.
0

In this paper we investigate the interplay between isolated suborders and closures. Isolated suborders are a special kind of suborders and can be used to diminish the number of elements of an ordered set by means of a quotient construction. The decisive point is that there are simple formulae establishing relationships between the number of closures in the original ordered set and the quotient thereof induced by isolated suborders. We show how these connections can be used to derive a recursive algorithm for counting closures, provided the ordered set under consideration contains suitable isolated suborders.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2022

Belief functions on ordered frames of discernment

Most questionnaires offer ordered responses whose order is poorly studie...
research
02/28/2018

Solving determinantal systems using homotopy techniques

Let be a field of characteristic zero and be an algebraic closure of ....
research
03/11/2022

Tracking Dynamical Features via Continuation and Persistence

Multivector fields and combinatorial dynamical systems have recently bec...
research
09/12/2015

Computing isolated orbifolds in weighted flag varieties

Given a weighted flag variety wΣ(μ,u) corresponding to chosen fixed para...
research
08/19/2020

Counting embeddings of rooted trees into families of rooted trees

The number of embeddings of a partially ordered set S in a partially ord...
research
07/27/2020

Optimal construction of a layer-ordered heap

The layer-ordered heap (LOH) is a simple, recently proposed data structu...
research
07/15/2021

Isolated loops

Many bureaucratic and industrial processes involve decision points where...

Please sign up or login with your details

Forgot password? Click here to reset