Related papers: Lattice decompositions through methods using congr…
This work investigates the factorization of finite lattices to implode selected intervals while preserving the remaining order structure. We examine how complete congruence relations and complete tolerance relations can be utilized for this…
We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.
The first aim of this work is to characterize when the lattice of all submodules of a module is a direct product of two lattices. In particular, which decompositions of a module $M$ produce these decompositions: the \emph{lattice…
Attribute and size reductions are key issues in formal concept analysis. In this paper, we consider a special kind of equivalence relation to reduce concept lattices, which will be called local congruence. This equivalence relation is based…
As the second part of the treatise 'A General Theory of Concept Lattice', this paper speaks of the tractability of the general concept lattice for both its lattice structure and logic content. The general concept lattice permits a feasible…
We present an approach to decomposition and factor analysis of matrices with ordinal data. The matrix entries are grades to which objects represented by rows satisfy attributes represented by columns, e.g. grades to which an image is red, a…
In this paper, we characterize the congruences of an arbitrary i--lattice, investigate the structure of the lattice they form and how it relates to the structure of the lattice of lattice congruences, then, for an arbitrary non--zero…
The decomposition of datasets is a useful mechanism in the processing of large datasets and it is required in many cases. In formal concept analysis (FCA), the dataset is interpreted as a context and the notion of independent context is…
Lattice structures have great potential for several application fields ranging from medical and tissue engineering to aeronautical one. Their development is further speeded up by the continuing advances in additive manufacturing…
We consider a graph called a lattice diagram, which is a graph in the $xy$-plane such that each edge is parallel to the $x$-axis or the $y$-axis. In [4], we investigated transformations of certain lattice diagrams, and we considered the…
A higher dimensional lattice space can be decomposed into a number of four-dimensional lattices called as layers. The higher dimensional gauge theory on the lattice can be interpreted as four-dimensional gauge theories on the multi-layer…
The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…
Computing the theta series of an arbitrary lattice, and more specifically a related quantity known as the flatness factor, has been recently shown to be important for lattice code design in various wireless communication setups. However,…
Formal Concept Analysis (FCA) offers several tools for qualitative data analysis. One possibility is to group objects that share common attributes together and get a concept lattice that describes the data. Quite often the size of this…
In a previous paper I showed how the ideal SLAC derivative and second-derivative operators for an infinite lattice can be obtained in simple closed form in position space, and implemented very efficiently in a stochastic fashion for…
This paper studies the differential lattice, defined to be a lattice $L$ equipped with a map $d:L\to L$ that satisfies a lattice analog of the Leibniz rule for a derivation. Isomorphic differential lattices are studied and classifications…
A non-perturbative algebraic theory of lattice Boltzmann method is developed based on a symmetry of a product. It involves three steps: (i) Derivation of admissible lattices in one spatial dimension through a matching condition which…
The concept of cutting is first explicitly introduced. By the concept, a convex expansion for finite distributive lattices is considered. Thus, a more general method for drawing the Hasse diagram is given, and the rank generating function…
We analyze the factorization process for lattice maps, searching for integrable cases. The maps were assumed to be at most quadratic in the dependent variables, and we required minimal factorization (one linear factor) after 2 steps of…
Continuous reducibilities are a proven tool in computable analysis, and have applications in other fields such as constructive mathematics or reverse mathematics. We study the order-theoretic properties of several variants of the two most…