Displaying similar documents to “The automorphism group of the random lattice is not amenable”

Dynamical properties of the automorphism groups of the random poset and random distributive lattice

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...

On lattice automorphisms of the special linear group

Mauro Costantini (1989)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti Lincei. Matematica e Applicazioni

Similarity:

We show, with a counterexample, that proposition 3 in [2], as it stands, is not correct; we prove however that by changing the hypothesis the thesis of the proposition remains still valid.

On lattice automorphisms of the special linear group

Mauro Costantini (1989)

Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Rendiconti

Similarity:

We show, with a counterexample, that proposition 3 in [2], as it stands, is not correct; we prove however that by changing the hypothesis the thesis of the proposition remains still valid.

Classification systems and their lattice

Sándor Radeleczki (2002)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

We define and study classification systems in an arbitrary CJ-generated complete lattice L. Introducing a partial order among the classification systems of L, we obtain a complete lattice denoted by Cls(L). By using the elements of the classification systems, another lattice is also constructed: the box lattice B(L) of L. We show that B(L) is an atomistic complete lattice, moreover Cls(L)=Cls(B(L)). If B(L) is a pseudocomplemented lattice, then every classification system of L is independent...

About the equivalence of nullnorms on bounded lattice

M. Nesibe Kesicioğlu (2017)

Kybernetika

Similarity:

In this paper, an equivalence on the class of nullnorms on a bounded lattice based on the equality of the orders induced by nullnorms is introduced. The set of all incomparable elements w.r.t. the order induced by nullnorms is investigated. Finally, the recently posed open problems have been solved.

Dual Lattice of ℤ-module Lattice

Yuichi Futa, Yasunari Shidama (2017)

Formalized Mathematics

Similarity:

In this article, we formalize in Mizar [5] the definition of dual lattice and their properties. We formally prove that a set of all dual vectors in a rational lattice has the construction of a lattice. We show that a dual basis can be calculated by elements of an inverse of the Gram Matrix. We also formalize a summation of inner products and their properties. Lattice of ℤ-module is necessary for lattice problems, LLL(Lenstra, Lenstra and Lovász) base reduction algorithm and cryptographic...