当前位置: X-MOL 学术arXiv.cs.DM › 论文详情
Representations for the largest Extension of a closure system
arXiv - CS - Discrete Mathematics Pub Date : 2020-02-18 , DOI: arxiv-2002.07680
Karima Ennaoui; Khaled Maafa; Lhouari Nourine

We consider extension of a closure system on a finite set S as a closure system on the same set S containing the given one as a sublattice. A closure system can be represented in different ways, e.g. by an implicational base or by the set of its meet-irreducible elements. When a closure system is described by an implicational base, we provide a characterization of the implicational base for the largest extension. We also show that the largest extension can be handled by a small modification of the implicational base of the input closure system. This answers a question asked in [12]. Second, we are interested in computing the largest extension when the closure system is given by the set of all its meet-irreducible elements. We give an incremental polynomial time algorithm to compute the largest extension of a closure system, and left open if the number of meet-irreducible elements grows exponentially.
更新日期:2020-02-19

 

全部期刊列表>>
向世界展示您的会议墙报和演示文稿
全球疫情及响应:BMC Medicine专题征稿
欢迎探索2019年最具下载量的化学论文
新版X-MOL期刊搜索和高级搜索功能介绍
化学材料学全球高引用
ACS材料视界
南方科技大学
x-mol收录
南方科技大学
自然科研论文编辑服务
西湖大学
中国科学院长春应化所于聪-4-8
武汉工程大学
课题组网站
X-MOL
深圳大学二维材料实验室张晗
中山大学化学工程与技术学院
试剂库存
天合科研
down
wechat
bug