Sciweavers

7758 search results - page 11 / 1552
» On the Number of Distributive Lattices
Sort
View
ORDER
2011
13 years 3 months ago
Cancellation in Skew Lattices
Distributive lattices are well known to be precisely those lattices that possess cancellation: x ∨ y = x ∨ z and x ∧ y = x ∧ z imply y = z. Cancellation, in turn, occurs wh...
Karin Cvetko-Vah, Michael K. Kinyon, Jonathan Leec...
DM
2010
96views more  DM 2010»
13 years 8 months ago
On well-rounded sublattices of the hexagonal lattice
Abstract. We produce an explicit parameterization of well-rounded sublattices of the hexagonal lattice in the plane, splitting them into similarity classes. We use this parameteriz...
Lenny Fukshansky, Daniel Moore, R. Andrew Ohana, W...
IPPS
2002
IEEE
14 years 1 months ago
Concept-Based Component Libraries and Optimizing Compilers
This paper discusses concept lattices and some of their applications in component library development and compiler optimizations. Ongoing work on concept-based userextensible simp...
Sibylle Schupp, D. P. Gregor, B. Osman, David R. M...
ICGI
2010
Springer
13 years 5 months ago
Learning Context Free Grammars with the Syntactic Concept Lattice
The Syntactic Concept Lattice is a residuated lattice based on the distributional structure of a language; the natural representation based on this is a context sensitive formalism...
Alexander Clark
CORR
2004
Springer
106views Education» more  CORR 2004»
13 years 8 months ago
Why Delannoy numbers?
This article is not a research paper, but a little note on the history of combinatorics: we present here a tentative short biography of Henri Delannoy, and a survey of his most no...
Cyril Banderier, Sylviane R. Schwer