Related papers: Regular Antilattices
For a slim, planar, semimodular lattice $L$ and covering square~$S$, G.~Cz\'edli and E.\,T.~Schmidt introduced the fork extension, $L[S]$, which is also a slim, planar, semimodular lattice. We investigate when a congruence of $L$ extends to…
We calculate the resistance between two arbitrary grid points of several infinite lattice structures of resistors by using lattice Green's functions. The resistance for $d$ dimensional hypercubic, rectangular, triangular and honeycomb…
By a twenty year old result of Ralph Freese, an $n$-element lattice $L$ has at most $2^{n-1}$ congruences. We prove that if $L$ has less than $2^{n-1}$ congruences, then it has at most $2^{n-2}$ congruences. Also, we describe the…
For a lattice L, let Princ L denote the ordered set of principal congruences of L. In a pioneering paper, G. Gratzer characterized the ordered sets Princ L of finite lattices L; here we do the same for countable lattices. He also showed…
In this paper we characterize those linear bijective maps on the monoid of all $n \times n$ square matrices over an anti-negative semifield which preserve and strongly preserve each of Green's equivalence relations $\mathcal{L},…
We reinterpret the Rhodes semilattices $R_n(\mathfrak{G})$ of a group $\mathfrak{G}$ in terms of gain graphs and generalize them to all gain graphs, both as sets of partition-potential pairs and as sets of subgraphs, and for the latter,…
The resistance between arbitrary nodes of infinite networks of resistors is studied when the network is perturbed by removing one bond from the perfect lattice. A connection is made between the resistance and the lattice Green's function of…
We give several characterizations of order continuous vector lattice homomorphisms between Archimedean vector lattices. We reduce the proofs of some of the equivalences to the case of composition operators between vector lattices of…
We study the multiplicative lattices L which satisfy the condition a = (a : (a : b))(a : b) for all a,b in L.
We attach to each $\langle 0, \vee \rangle$-semilattice a graph $\boldsymbol{G}_{\boldsymbol{S}}$ whose vertices are join-irreducible elements of $\boldsymbol{S}$ and whose edges correspond to the reflexive dependency relation. We study…
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
One of the longstanding problems in universal algebra is the question of which finite lattices are isomorphic to the congruence lattices of finite algebras. This question can be phrased as which finite lattices can be represented as…
An infinite regular three-dimensional network is composed of identical resistors each of resistance joining adjacent nodes. What is the equivalent resistance between the lattice site and the lattice site, when two bonds are removed from the…
We review recent results on congruence lattices of (infinite) lattices. We discuss results obtained with box products, as well as categorical, ring-theoretical, and topological results.
Let $L$ be a finite lattice and let $I$ be an ideal of $L$. Then the restriction map is a bounded lattice homomorphism of the congruence lattice of~$L$ into the congruence lattice of $I$. In a 2009 paper, the authors proved the converse. In…
We prove that an infinite (bounded) involution lattice and even pseudo--Kleene algebra can have any number of congruences between $2$ and its number of elements or equalling its number of subsets, regardless of whether it has as many ideals…
It is shown that the Green's function on a finite lattice in arbitrary space dimension can be obtained from that of an infinite lattice by means of translation operator. Explicit examples are given for one- and two-dimensional lattices.
Properties of several sorts of lattices of convex subsets of R^n are examined. The lattice of convex sets containing the origin turns out, for n>1, to satisfy a set of identities strictly between those of the lattice of all convex subsets…
We characterize vector lattices in which unbounded order convergence is eventually order bounded. Among other things, the characterization provides a solution to \cite[Probl.23]{Az}.
There exist as many index-$k$ sublattices of the hexagonal lattice up to isometry as there exist lattice triangles with normalized volume $k$ up to unimodular equivalence, which can be explained using orbifolds. In dimension 3, it was noted…