R. P. Dilworth

1. A Decomposition Theorem for Partially Ordered Sets
   1950/01/01 by R. P. Dilworth · 9 citations
   Computer Science · Mathematics · #Advanced Algebra and Logic #Advanced Banach Space Theory #Combinatorics #Decomposition #Decomposition theorem #Discrete mathematics #Functional Equations Stability Results #Mathematics #Pure mathematics
2. Lattices with Unique Irreducible Decompositions
   1940/10/01 by R. P. Dilworth · 2 citations
   Computer Science · Mathematics · #Advanced Algebra and Logic #Algebra over a field #Mathematics #Pure mathematics
3. Proof of a Conjecture on Finite Modular Lattices
   1954/09/01 by R. P. Dilworth · 1 citation
   Computer Science · Mathematics · #Advanced Algebra and Logic #Algebra over a field #Computer science #Conjecture #Discrete mathematics #Mathematics #Modular design #Programming language #Pure mathematics #Rings, Modules, and Algebras
4. Proof of a Conjecture on Finite Modular Lattices
   1990/01/01 by R. P. Dilworth · 1 citation
   Computer Science · Mathematics · #Advanced Algebra and Logic #Conjecture #Modular design #Lattice (music) #Mathematics #Modular form #Join (topology) #Pure mathematics #Combinatorics #Discrete mathematics #Computer science #Physics #Programming language