Graph automorphism of a finite modular lattice

DOI10.1023/A:1022425007638MaRDI QIDQ4515386zbMATH OpenOpenAlexFDO

Authors Ján Jakubík

Publication date 13 November 2000

Published in Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/30497, http://hdl.handle.net/10338.dmlcz/127500

zbMATH Keywords

finite modular latticegraph

Mathematics Subject Classification ID

Modular lattices, Desarguesian lattices (06C05)

Review text

The author obtained the following result. Let \(L\) be a finite modular lattice. Then any automorphism of the unoriented graph corresponding to \(L\) is a lattice automorphism if and only if no direct factor of \(L\) having at least two elements is self-dual. Thus the paper gives a partial solution of a problem concerning unoriented graphs of finite lattices (Problem 6 in [\textit{G. Birkhoff}, Lattice theory, AMS, Providence, R.I. (1967; Zbl 0153.02501)]).

Recommendations

• scientific article; zbMATH DE number 3929071
• scientific article; zbMATH DE number 3918425
• scientific article; zbMATH DE number 1261224
• On centrally symmetric graphs
• On lattices determined up to isomorphisms by their graphs

Cites work

• Convex isomorphisms of directed multilattices
• scientific article; zbMATH DE number 3245483 (Why is no real title available?)
• scientific article; zbMATH DE number 3050845 (Why is no real title available?)

Cited in

(5)

• The complexity of modular graph automorphism
• The complexity of modular graph automorphism
• Graph automorphisms of multilattices
• Graph automorphisms and cells of lattices
• Automorphisms with eigenvalues in \(S^1\) of a \(\mathbb{Z}\)-lattice with cyclic finite monodromy

This page was built for publication: Graph automorphism of a finite modular lattice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4515386)