On the approximability of automorphism groups of lattices by automorphism groups of totally ordered sets

DOI10.1134/S0001434608090095MaRDI QIDQ2518059zbMATH OpenOpenAlexFDO

Authors V. M. Tararin

Publication date 12 January 2009

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s0001434608090095

zbMATH Keywords

approximabilityautomorphism group of a latticeautomorphism group of a totally ordered setdistributive lattice

Mathematics Subject Classification ID

Total orders (06A05) Structure theory of lattices (06B05) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Review text

The main goal of this note is to establish several criteria for the approximability of some classes of automorphism groups of lattices by automorphism groups of totally ordered sets. An interesting result is obtained in the particular case of distributive lattices.

Recommendations

• Automorphism groups of algebraic lattices
• scientific article; zbMATH DE number 703522
• Automorphism groups of geometric lattices.
• On automorphism groups of graphs and distributive lattices
• Groups acting on distributive lattices

This page was built for publication: On the approximability of automorphism groups of lattices by automorphism groups of totally ordered sets

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