Geodesic
Some combinatorial characteristics of closure operations
Algebra and discrete mathematics, Tome 28 (2019) no. 1, pp. 144-156.

Voir la notice de l'article provenant de la source Math-Net.Ru

The aim of this paper investigates some combinatorial characteristics of minimal key and antikey of closure operations. We also give effective algorithms finding minimal keys and antikeys of closure operations. We estimate these algorithms. Some remarks on the closeness of closure operations class under the union and direct product operations are also studied in this paper.
Mots-clés : closure operation, closure system, closed set, minimal key, antikey. 
@article{ADM_2019_28_1_a10,
     author = {Nguyen Hoang Son and Vu Duc Thi},
     title = {Some combinatorial characteristics of closure operations},
     journal = {Algebra and discrete mathematics},
     pages = {144--156},
     publisher = {mathdoc},
     volume = {28},
     number = {1},
     year = {2019},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/ADM_2019_28_1_a10/}
}
TY  - JOUR
AU  - Nguyen Hoang Son
AU  - Vu Duc Thi
TI  - Some combinatorial characteristics of closure operations
JO  - Algebra and discrete mathematics
PY  - 2019
SP  - 144
EP  - 156
VL  - 28
IS  - 1
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/ADM_2019_28_1_a10/
LA  - en
ID  - ADM_2019_28_1_a10
ER  - 
%0 Journal Article
%A Nguyen Hoang Son
%A Vu Duc Thi
%T Some combinatorial characteristics of closure operations
%J Algebra and discrete mathematics
%D 2019
%P 144-156
%V 28
%N 1
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/ADM_2019_28_1_a10/
%G en
%F ADM_2019_28_1_a10
Nguyen Hoang Son; Vu Duc Thi. Some combinatorial characteristics of closure operations. Algebra and discrete mathematics, Tome 28 (2019) no. 1, pp. 144-156. https://geodesic-test.mathdoc.fr/item/ADM_2019_28_1_a10/

[1] W. W. Armstrong, “Dependency structures of database relationships”, Information processing, 74 (1974), 580–583 | MR | Zbl

[2] N. Caspard, B. Monjardet, “The lattices of closure systems, closure operators, and implicational systems on a finite set: a survey”, Discrete Applied Mathematics, 127 (2003), 241–269 | DOI | MR | Zbl

[3] J. Demetrovics, Z. Furedi, G. O. H. Katona, “Minimum matrix representation of closure operations”, Discrete Applied Mathematics, 11 (1985), 115–128 | DOI | MR | Zbl

[4] J. Demetrovics, G. Hencsey, L. Libkin, I. Muchnik, “On the interaction between closure operations and choice functions with applications to relational databases”, Acta Cybernetica, 10 (1992), 129–139 | MR | Zbl

[5] Hirohisa S., Yuga H., Shinya N., “On Enumerating Frequent Closed Patterns with Key in Multi-relational Data”, Discovery Science, 13th International Conference, DS 2010 (Canberra, Australia, October, 2010), Lecture Notes in Computer Science, 6332, 2010, 72–86 | DOI

[6] C. Lucchese, S. Orlando, R. Perego, “Mining frequent closed itemsets out of core”, Proceedings of the Sixth SIAM International Conference on Data Mining, 2006, 419–429 | MR

[7] H. Mao, S. Liu, “Posets and closure operators relative to matroids”, Matematika, 2012, 77–85 | MR

[8] Vu Duc Nghia, Bina Ramamurthy, “Properties of composite of closure operations and choice functions”, Acta Cybernetica, 15 (2002), 457–465 | MR

[9] Vu Duc Nghia, “Relationships between closure operations and choice functions equivalent descriptions of a family of functional dependencies”, Acta Cybernetica, 16 (2004), 485–506 | MR