Zobrazeno 1 - 10
of 114
pro vyhledávání: '"Nation, J. B."'
Autor:
Nation, J. B., Paolini, Gianluca
We start a systematic analysis of the first-order model theory of free lattices. Firstly, we prove that the free lattices of finite rank are not positively indistinguishable, as there is a positive $\exists \forall$-sentence true in $\mathbf F_3$ and
Externí odkaz:
http://arxiv.org/abs/2310.03366
A single deletion error correcting code (SDECC) is a set of fixed-length sequences consisting of two types of symbols, 0 and 1, such that the original sequence can be recovered for at most one deletion error. The upper bound for the size of SDECC is
Externí odkaz:
http://arxiv.org/abs/2309.14736
Autor:
Grätzer, George, Nation, J. B.
An FN lattice $F$ is a simple, infinite, semidistributive lattice. Its existence was recently proved by R. Freese and J.\,B. Nation. Let $\mathsf{B}_n$ denote the Boolean lattice with $n$ atoms. For a lattice $K$, let $K^+$ denote $K$ with a new unit
Externí odkaz:
http://arxiv.org/abs/2306.04113
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
David C.Wyld et al. (Eds) : CSITY, DTMN, NWCOM, SIGPRO - 2018, pp. 39-51, 2018
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. Nation (TCS 2017), which is performed on multiple sub-tables of a ta
Externí odkaz:
http://arxiv.org/abs/1808.01703
Autor:
Adaricheva, Kira, Nation, J. B.
Publikováno v:
Theoretical Computer Science, v.658 Part B, 307-315 (2017)
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 web. We introduce a novel approach for the discovery of a specific se
Externí odkaz:
http://arxiv.org/abs/1504.02875
Autor:
Adaricheva, Kira, Nation, J. B.
Publikováno v:
Electronic Journal of Combinatorics, v.23(1), paper #1.56 (2016)
Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes of example
Externí odkaz:
http://arxiv.org/abs/1501.04174
We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using geometric noti
Externí odkaz:
http://arxiv.org/abs/1311.7038
Autor:
Adaricheva, Kira, Nation, J. B.
Publikováno v:
Discrete Applied Mathematics (2014), pp. 51-69
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 function. New parameters for the size of the binary part are also esta
Externí odkaz:
http://arxiv.org/abs/1205.2881
Publikováno v:
Discrete Applied Mathematics 161 (2013), pp. 707-723
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, and the tools of economic description of a finite lattice have long exis
Externí odkaz:
http://arxiv.org/abs/1110.5805