5 papers
Conjecture on Maximal Sublattices of Finite Semidistributive Lattices and Beyond
K. Adaricheva, A. Mata, S. Silberger +1
We study maximal sublattices of finite semidistributive lattices via their complements. We focus on the conjecture that such complements are always intervals, which is known to be…
Space efficient implementation of hypergraph dualization in the D-basis algorithm
Skylar Homan, Anoop Krishnadas, Kira Adaricheva
We present a new implementation of the -basis algorithm called the Small Space which considerably reduces the algorithm's memory usage for data analysis applications. The previo…
Computing the -base and -relation in finite closure systems
Kira Adaricheva, Lhouari Nourine, Simon Vilmin
Implicational bases (IBs) are a common representation of finite closure systems and lattices, along with meet-irreducible elements. They appear in a wide variety of fields ranging…
On the -base of Finite Lattices: Semidistributive, Modular, and Geometric Lattices
Kira Adaricheva, Simon Vilmin
Implicational bases are a well-known representation of closure spaces and their closure lattices. This representation is not unique, though, and a closure space usually admits mult…
A novel association and ranking approach identifies factors affecting educational outcomes of STEM majors
Kira Adaricheva, Jonathan T. Brockman, Gillian Z. Elston +7
Improving undergraduate success in STEM requires identifying actionable factors that impact student outcomes, allowing institutions to prioritize key leverage points for change. We…