Related papers: Tensor products and transferability of semilattice…
Let L_1 and L_2 be complete atomistic lattices. In a previous paper, we have defined a set S=S(L_1,L_2) of complete atomistic lattices, the elements of which are called weak tensor products of L_1 and L_2. S is defined by means of three…
This article is part of my upcoming masters thesis which investigates the following open problem from the book, Free Lattices, by R.Freese, J.Jezek, and J.B. Nation published in 1995: "Which lattices (and in particular which countable…
Hemi-implicative semilattices (lattices), originally defined under the name of weak implicative semilattices (lattices), were introduced by the second author of the present paper. A hemi-implicative semilattice is an algebra…
A distributive lattice $L$ with minimum element $0$ is called decomposable if $a$ and $b$ are not comparable elements in $L$ then there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
Suppose $\Sigma$ is a topological space and $S(\Sigma)$ is the vector lattice of all equivalent classes of continuous real-valued functions defined on open dense subsets of $\Sigma$. In this paper, we establish some lattice and topological…
Let $L$ be a lattice. We call a congruence relation $\gQ$ of $L$ isoform, if any two congruence classes of $\gQ$ are isomorphic (as lattices). Let us call the lattice $L$ isoform, if all congruences of $L$ are isoform. G. Gr\"atzer and…
We discuss the exact non-invertible Kramers-Wannier symmetry of 1+1d lattice models on a tensor product Hilbert space of qubits. This symmetry is associated with a topological defect and a conserved operator, and the latter can be presented…
We prove that every distributive algebraic lattice with at most $\aleph\_1$ compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The $\aleph\_1$ bound is optimal, as…
A lattice $L$ is said lowly finite if the set $[\mathsf{0},a]$ is finite for every element $a$ of $L$. We mainly aim to provide a complete proof that, if $M$ is a subset of a complete lowly finite distributive lattice $L$ containing its…
A classical result of R.\,P. Dilworth states that every finite distributive lattice $D$ can be represented as the congruence lattice of a finite lattice~$L$. A~sharper form was published in G.~Gr\"atzer and E.\,T. Schmidt in 1962, adding…
A distributive lattice $L$ with minimum element $0$ is called decomposable lattice if $a$ and $b$ are not comparable elements in $L$ there exist $\overline{a},\overline{b}\in L$ such that $a=\overline{a}\vee(a\wedge b),…
For a distributive join-semilattice S with zero, a S-valued poset measure on a poset P is a map m:PxP->S such that m(x,z) <= m(x,y)vm(y,z), and x <= y implies that m(x,y)=0, for all x,y,z in P. In relation with congruence lattice…
Theorem. Let $\pi$ be a finite group of order $n$, $R$ be a Dedekind domain satisfying that (i) $\fn{char}R=0$, (ii) every prime divisor of $n$ is not invertible in $R$, and (iii) $p$ is unramified in $R$ for any prime divisor $p$ of $n$.…
It is known that by using the commutator operation, for each congruence modular algebra $A$ one can define a notion of prime congruence. The set $Spec(A)$ of prime congruences of $A$ is endowed with a Zariski style topology. The…
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 a lattice determination of the hadronic susceptibilities that, thanks to unitarity and analyticity, constrain the form factors entering the semileptonic $b\rightarrow c$ transitions. We evaluate the transverse and longitudinal…
We continue our work on the model theory of free lattices, solving two of the main open problems from our first paper on the subject. Our main result is that the universal (existential) theory of infinite free lattices is decidable. Our…
In this paper, we introduce the zero divisor graph of a multiplicative lattice. We provide a counter example to Beck's conjecture for multiplicative lattices. Further, we prove that Beck's conjecture is true for reduced multiplicative…
A (discrete) group is called amenable whenever there exists a finitely additive right invariant probablity measure on it. For Thompson's group $F$ the problem whether it is amenable is a long-standing open question. We consider presentation…
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 multiple bases. Among these, the canonical base, the canonical…