activity
20042025
most citedOrdered direct implicational basis of a finite closure system

35 citations · 153 across the 28 of their papers we have counts for

collaborators
Showing 2012Show all

3 papers · 1 filter

math.RA2012★ 24 cited

Notes on the description of join-distributive lattices by permutations

Gábor Czédli, Kira Adaricheva

Let L be a join-distributive lattice with length n and width(Ji L) \leq k. There are two ways to describe L by k-1 permutations acting on an n-element set: a combinatorial way give…

math.OC2012★ 2 cited

Optimum basis of finite convex geometry

Kira Adaricheva

Convex geometries form a subclass of closure systems with unique criticals, or -systems. We show that the -basis introduced in [1] for -systems, becomes optimum in conve…

math.OC2012★ 18 cited

On implicational bases of closure systems with unique critical sets

Kira Adaricheva, J. B. Nation

We show that every optimum basis of a finite closure system, in D.Maier's sense, is also right-side optimum, which is a parameter of a minimum CNF representation of a Horn Boolean…