3 citations · 4 across the 3 of their papers we have counts for
6 papers
Direct and Binary Direct Bases for One-set Updates of a Closure System
Kira Adaricheva, Taylor Ninesling
We introduce a concept of a binary-direct implicational basis and show that the shortest binary-direct basis exists and it is known as the -basis introduced in Adaricheva, Natio…
Description of closure operators in convex geometries of segments on a line
Kira Adaricheva, Gent Gjonbalaj
Convex geometry is a closure space with the anti-exchange property. A classical result of Edelman and Jamison (1985) claims that every finite convex geometry is a join of s…
The Bases of Association Rules of High Confidence
Oren Segal, Justin Cabot-Miller, Kira Adaricheva +2
We develop a new approach for distributed computing of the association rules of high confidence in a binary table. It is derived from the D-basis algorithm in K. Adaricheva and J.B…
On scattered convex geometries
Kira Adaricheva, Maurice Pouzet
A convex geometry is a closure space satisfying the anti-exchange axiom. For several types of algebraic convex geometries we describe when the collection of closed sets is order sc…
Stasheff polytope as a sublattice of permutohedron
Kira Adaricheva
An assosiahedron , known also as Stasheff polytope, is a multifaceted combinatorial object, which, in particular, can be realized as a convex hull of certain points…
Embedding finite lattices into finite biatomic lattices
Friedrich Wehrung, Kira Adaricheva
For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above…