In Search of a Pappian Lattice Identity

1981 ◽  
Vol 24 (2) ◽  
pp. 187-198 ◽  
Author(s):  
Alan Day

In [8] and subsequent papers, Jônsson (et al) developed a lattice identity which reflects precisely Desargues Law in projective geometry in that a projective geometry satisfies Desargues Law if and only if the geometry, qua lattice, satisfies this identity. This identity, appropriately called the Arguesian law, has become exceedingly important in recent investigations in the variety of modular lattices (see for example [2], [3], [9], and [12]). In this note, we supply two possible lattice identities for the Pappus' Law of projective geometry.

1995 ◽  
pp. 1115-1142 ◽  
Author(s):  
Ulrich Brehm ◽  
Marcus Greferath ◽  
Stefan E. Schmidt

1993 ◽  
Vol 54 (2) ◽  
pp. 191-206 ◽  
Author(s):  
K.C. Gupta ◽  
Suryansu Ray
Keyword(s):  

Author(s):  
Tilman Sauer ◽  
Tobias Schütz

AbstractWe discuss Einstein’s knowledge of projective geometry. We show that two pages of Einstein’s Scratch Notebook from around 1912 with geometrical sketches can directly be associated with similar sketches in manuscript pages dating from his Princeton years. By this correspondence, we show that the sketches are all related to a common theme, the discussion of involution in a projective geometry setting with particular emphasis on the infinite point. We offer a conjecture as to the probable purpose of these geometric considerations.


1969 ◽  
Vol 76 (10) ◽  
pp. 1168
Author(s):  
Josephine H. Chanler ◽  
Robert J. Bumcrot
Keyword(s):  

2003 ◽  
Vol 99 (2) ◽  
pp. 361-372 ◽  
Author(s):  
Heng Huat Chan ◽  
Kok Seng Chua ◽  
Patrick Solé

1987 ◽  
Vol 101 (2) ◽  
pp. 221-231 ◽  
Author(s):  
Joseph P. S. Kung

AbstractLet and ℳ be subsets of a finite lattice L. is said to be concordant with ℳ if, for every element x in L, either x is in ℳ or there exists an element x+ such that (CS1) the Möbius function μ(x, x+) ≠ 0 and (CS2) for every element j in , x ∨ j ≠ x+. We prove that if is concordant with ℳ, then the incidence matrix I(ℳ | ) has maximum possible rank ||, and hence there exists an injection σ: → ℳ such that σ(j) ≥ j for all j in . Using this, we derive several rank and covering inequalities in finite lattices. Among the results are generalizations of the Dowling-Wilson inequalities and Dilworth's covering theorem to semimodular lattices, and a refinement of Dilworth's covering theorem for modular lattices.


1991 ◽  
Vol 290 (1) ◽  
pp. 441-462 ◽  
Author(s):  
Mark McConnell

Sign in / Sign up

Export Citation Format

Share Document