Search arXivSearch

arXiv · 2208.03745

On the algorithmic construction of the 1960 sectional complement

Abstract

In 1960, G. Grätzer and E.\,T. Schmidt proved that every finite distributive lattice can be represented as the congruence lattice of a sectionally complemented finite lattice $L$. For $u \leq v$ in $L$, they constructed a sectional complement, which is now called the \emph{1960 sectional complement}. In 1999, G. Grätzer and E.\,T. Schmidt discovered a very simple way of constructing a sectional complement in the ideal lattice of a chopped lattice made up of two sectionally complemented finite lattices overlapping in only two elements -- the Atom Lemma. The question was raised whether this simple process can be generalized to an algorithm that finds the 1960 sectional complement. In 2006, G.~Grätzer and M. Roddy discovered such an algorithm -- allowing a wide latitude how it is carried out. In this paper we prove that the wide latitude apparent in the algorithm is deceptive: whichever way the algorithm is carried out, it~produces the same sectional complement. This solves, in fact, Problems 2 and 3 of the Grätzer-Roddy paper. Surprisingly, the unique sectional complement provided by the algorithm is the 1960 sectional complement, solving Problem 1 of the same paper.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G. Grätzer, G. Klus, A. Nguyen. 2022-08-07. On the algorithmic construction of the 1960 sectional complement. https://arxiv.org/abs/2208.03745

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Maximal tails,character fibres and induced modules for pullback Kumjian-Pask algebras

Let $f:\N^{k}\to\N^{\ell}$ be a surjective monoid homomorphism and let $Γ$ be a row-finite $\ell$-graph with no sources and finitely many vertices. We give an explicit graded isomorphism from the Kumjian--Pask algebra of the pullback $f^{*}Γ$ onto the tensor product of $\KP_{\K}(Γ)$ and the group algebra of the kernel of the group completion of $f$. When $Γ$ is strongly aperiodic, but need not be cofinal, every maximal tail $T$ and every maximal ideal $\mathfrak m$ of the kernel group algebra determine an explicit primitive ideal and primitive quotient. If, in addition, $\K$ is uncountable and algebraically closed, these ideals exhaust the primitive spectrum. We prove that the resulting parametrisation is a homeomorphism for the product of the maximal-tail and Zariski topologies. Each primitive ideal is realised as the annihilator of a simple module induced from the isotropy of a path which is cofinal in $T$, and the character fibres are algebraic tori. Two examples exhibit, respectively, a single character fibre and the non-Hausdorff gluing of two such fibres.

math.RA

A classification of group gradings on incidence algebras over commutative rings

Let $R$ be a commutative ring with 1, $P$ a locally finite partially ordered set, and $G$ a group. We derive necessary and sufficient conditions for an $R$-algebra isomorphism between the incidence algebra $I(P,R)$ and the group algebra $RG$. Then, for an indecomposable ring $R$, a finite poset $P$ and an arbitrary group $G$, we classify the $G$-gradings of $I(P,R)$ up to graded isomorphism. The classification rests on a complete set of primitive orthogonal homogeneous idempotents. The corner algebras are split group algebras of finite abelian subgroups of $G$, and the off-diagonal Peirce blocks are multiplicity-free sums of bimodules induced from characters of double coset stabilizers. Graded isomorphisms are shown to have a rigid form, and a grading is determined up to graded isomorphism by the poset of idempotents, the corner groups, the types of the atomic bimodules and the structure constants of their multiplication. The data which occur are characterized by polynomial conditions, and over an algebraically closed field of characteristic zero only finitely many graded isomorphism classes share given partial invariants. An example shows that the structure constants cannot be omitted. Some previous results are extended and enhanced, while providing alternative proofs for some known facts.

math.RA