Semimodular lattice
id:
semimodular-lattice-203-2180501
title:
Semimodular lattice
text:
In the branch of mathematics known as order theory, a semimodular lattice, is a lattice that satisfies the following condition: The notation a <: b means that b covers a, i.e. a < b and there is no element c such that a < c < b. An atomistic semimodular bounded lattice is called a matroid lattice because such lattices are equivalent to (simple) matroids. An atomistic semimodular bounded lattice of finite length is called a geometric lattice and corresponds to a matroid of finite rank. Semimodula
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Semimodular_lattice
date created:
date modified:
2023-07-11T19:17:59Z
main entity:
{"identifier":"Q1748671","url":"https://www.wikidata.org/entity/Q1748671"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/1/1a/Centred_hexagon_lattice_D2.svg","width":140,"height":180}
fields total:
13
integrity:
14