35 citations · 153 across the 28 of their papers we have counts for
28 papers
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…
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…
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…
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…
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…
Importance of overnight parameters to predict Sea Breeze on Long Island
Kira Adaricheva, Jase E. Bernhardt, Wenxin Liu +1
The sea breeze is a phenomenon frequently impacting Long Island, New York, especially during the spring and early summer, when land surface temperatures can exceed ocean temperatur…
Representation of convex geometries of convex dimension 3 by spheres
Kira Adaricheva, Arav Agarwal, Na'ama Nevo
A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of Adaricheva and Bolat (2019) and the Polymath REU (2020), continues to…
Convex geometries representable with colors, by ellipses on the plane, and impossible by circles
Kira Adaricheva, Evan Daisy, Ayush Garg +5
A convex geometry is a closure system satisfying the anti-exchange property. This paper, following the work of K. Adaricheva and M. Bolat (2016) and the Polymath REU 2020 team, con…
Eigenfunctions restriction estimates for curves with nonvanishing geodesic curvatures in compact Riemannian surfaces with nonpositive curvature
Chamsol Park
For , we study the norms of restrictions of eigenfunctions of the Laplace-Beltrami operator on smooth compact -dimensional Riemannian manifolds. Burq, Gérard, a…
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…
Representation of convex geometries by circles on a plane
Kira Adaricheva, Madina Bolat
Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimens…
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…
Discovery of the -basis in binary tables based on hypergraph dualization
Kira Adaricheva, J. B. Nation
Discovery of (strong) association rules, or implications, is an important task in data management, and it finds application in artificial intelligence, data mining and the semantic…
A class of infinite convex geometries
Kira Adaricheva, J. B. Nation
Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed s…
Algebraic convex geometries revisited
Kira Adaricheva
Representation of convex geometry as an appropriate join of compatible total orderings of the base set can be achieved, when closure operator of convex geometry is algebraic, or fi…
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…
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…
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…
Ordered direct implicational basis of a finite closure system
Kira Adaricheva, J. B. Nation, Robert Rand
Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, an…
Lattices of quasi-equational theories as congruence lattices of semilattices with operators, Part II
Kira Adaricheva, J. B. Nation
Part I proved that for every quasivariety K of structures (which may have both operations and relations) there is a semilattice S with operators such that he lattice of quasi-equat…
Lattices of quasi-equational theories as congruence lattices of semilattices with operators, Part I
Kira Adaricheva, J. B. Nation
We show that for every quasivariety K of structures (where both functions and relations are allowed) there is a semilattice S with operators such that the lattice of quasi-equation…
Representing finite convex geometries by relatively convex sets
Kira Adaricheva
A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of…