An axiomatization of the lattice of higher relative commutants of a subfactor.

Sorin Popa

Displaying similar documents to “An axiomatization of the lattice of higher relative commutants of a subfactor.”

A Characterisation of Leech's Lattice.

CONWAY.J.H. (1969)

Inventiones mathematicae

Similarity:

A Characterization of Orders of Finite Lattice Type.

M. Auslander, K.W. Roggenkamp (1972)

Inventiones mathematicae

Similarity:

Unit-distance graphs, graphs on the integer lattice and a Ramsey type result.

K.B. Chilakamarri, C.B. Mahoney (1996)

Aequationes mathematicae

Similarity:

Unit-distance graphs, graphs on the integer lattice and a Ramsey type result. (Summary).

K.B. Chilakamarri, Carolyn R. Mahoney (1995)

Aequationes mathematicae

Similarity:

New Omega Theorems for Two Classical Lattice Points Problems.

James Lee Hafner (1981)

Inventiones mathematicae

Similarity:

Cyclic congruences of slim semimodular lattices and non-finite axiomatizability of some finite structures

Gábor Czédli (2022)

Archivum Mathematicum

Similarity:

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among finite graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the counterpart of this fact for all bipartite graphs in the class of all graphs is a well-known consequence of the compactness theorem.) Also, to exemplify that our method is applicable in various fields of mathematics, we prove that neither finite simple groups,...

On weak direct product decompositions of lattices and graphs

Ján Jakubík (1985)

Czechoslovak Mathematical Journal

Similarity: