Sciweavers

7758 search results - page 7 / 1552
» On the Number of Distributive Lattices
Sort
View
SIAMDM
2008
140views more  SIAMDM 2008»
13 years 8 months ago
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
Daniel Král, Petr Skoda
DAM
2007
141views more  DAM 2007»
13 years 8 months ago
On the packing chromatic number of Cartesian products, hexagonal lattice, and trees
The packing chromatic number χρ(G) of a graph G is the smallest integer k such that the vertex set of G can be partitioned into packings with pairwise different widths. Several...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
DM
2008
103views more  DM 2008»
13 years 8 months ago
A note on lattice chains and Delannoy numbers
Fix nonnegative integers n1, . . . , nd and let L denote the lattice of integer points (a1, . . . , ad) Zd satisfying 0 ai ni for 1 i d. Let L be partially ordered by the usua...
John S. Caughman IV, Clifford R. Haithcock, J. J. ...
IFSA
2007
Springer
159views Fuzzy Logic» more  IFSA 2007»
14 years 2 months ago
Counting Finite Residuated Lattices
We study finite residuated lattices with up to 11 elements. We present an algorithm for generating all non-isomorphic finite residuated lattices with a given number of elements. ...
Radim Belohlávek, Vilém Vychodil
CLA
2004
13 years 10 months ago
Fast Factorization of Concept Lattices by Similarity: Solution and an Open Problem
An important problem in applications of formal concept analysis is a possibly large number of clusters extracted from data. Factorization is one of the methods being used to cope w...
Radim Belohlávek, Jiri Dvorak, Jan Outrata