Automorphism Groups of Posets and Lattices with a Given Subset of Fixed Points.
M.E. Adams, J. Sichler (1982)
Monatshefte für Mathematik
Similarity:
M.E. Adams, J. Sichler (1982)
Monatshefte für Mathematik
Similarity:
Joanna Grygiel (2004)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
We present a construction of finite distributive lattices with a given skeleton. In the case of an H-irreducible skeleton K the construction provides all finite distributive lattices based on K, in particular the minimal one.
Jerzy Płonka, Werner Poguntke (1976)
Colloquium Mathematicae
Similarity:
Gabriele H. Greco (1988)
Colloquium Mathematicae
Similarity:
Gábor Czédli, Ildikó V. Nagy (2013)
Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica
Similarity:
A rotational lattice is a structure where is a lattice and is a lattice automorphism of finite order. We describe the subdirectly irreducible distributive rotational lattices. Using Jónsson’s lemma, this leads to a description of all varieties of distributive rotational lattices.
Dietmar Schweigert (1985)
Mathematica Slovaca
Similarity:
Ottmar Loos (1983)
Monatshefte für Mathematik
Similarity:
David C. Feinstein (1975)
Colloquium Mathematicae
Similarity:
Adam Grabowski (2014)
Formalized Mathematics
Similarity:
Almost Distributive Lattices (ADL) are structures defined by Swamy and Rao [14] as a common abstraction of some generalizations of the Boolean algebra. In our paper, we deal with a certain further generalization of ADLs, namely the Generalized Almost Distributive Lattices (GADL). Our main aim was to give the formal counterpart of this structure and we succeeded formalizing all items from the Section 3 of Rao et al.’s paper [13]. Essentially among GADLs we can find structures which are...
Joel Berman (1977)
Aequationes mathematicae
Similarity:
Alexander S. Kechris, Miodrag Sokić (2012)
Fundamenta Mathematicae
Similarity:
A method is developed for proving non-amenability of certain automorphism groups of countable structures and is used to show that the automorphism groups of the random poset and random distributive lattice are not amenable. The universal minimal flow of the automorphism group of the random distributive lattice is computed as a canonical space of linear orderings but it is also shown that the class of finite distributive lattices does not admit hereditary order expansions with the Amalgamation...
J. Płonka (1968)
Fundamenta Mathematicae
Similarity:
Naveen Kumar Kakumanu, Kar Ping Shum (2016)
Discussiones Mathematicae General Algebra and Applications
Similarity:
In this paper, we prove that the class of P₂-Almost Distributive Lattices and Post Almost Distributive Lattices are equationally definable.