Let L be a finite lattice and let L ̂ = L − {0̂, 1̂}. It is shown that if the order complex ∆(L̂) satisfies H̃k−2 ∆(L̂)) 6 = 0 then |L | ≥ 2k. Equality |L | = 2k holds iff L is isomorphic to the Boolean lattice {0, 1}k.
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
We study the lattice nite representability of the Bochner space Lp(1; Lq(2)) in ‘pf‘qg, 1 p; q <...
International audienceWe determine the dimension of every simple module for the algebra of the monoi...
the notation and terminology for this paper. 1. PRELIMINARIES In this paper x, X, X1, Y, Z are sets....
We study the lattice finite representability of the Bochner space L p(P1, Lq(P2)) in lp{lq}, 1 = p, ...
AbstractFor a finite lattice L, denote by l∗(L) and l∗(L) respectively the upper length and lower le...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
A family F of s-subsets of [t]is a (ϑ,s,t)-family iff the intersection of any two distinct elements ...
AbstractLet B(j, k; n) be the ordered set obtained by ordering the j element and k element subsets o...
the set of surjective lattice homomorphisms from P to {0, 1}. For p ∈ P set π(p) = {z: z ∈ Z, z(p) ...
AbstractThe dimension of a partially ordered set P is the smallest integer n (if it exists) such tha...
International audienceWe introduce the dimension monoid of a lattice L, denoted by Dim L. The monoid...
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ...
AbstractLet 2[n] denote the Boolean lattice of order n, that is, the poset of subsets of {1,…,n} ord...
AbstractA cutset in the poset 2[n], of subsets of {1, …, n} ordered by inclusion, is a subset of 2[n...
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
We study the lattice nite representability of the Bochner space Lp(1; Lq(2)) in ‘pf‘qg, 1 p; q <...
International audienceWe determine the dimension of every simple module for the algebra of the monoi...
the notation and terminology for this paper. 1. PRELIMINARIES In this paper x, X, X1, Y, Z are sets....
We study the lattice finite representability of the Bochner space L p(P1, Lq(P2)) in lp{lq}, 1 = p, ...
AbstractFor a finite lattice L, denote by l∗(L) and l∗(L) respectively the upper length and lower le...
Using known facts we give a simple characterization of the distributivity of lattices of finite leng...
A family F of s-subsets of [t]is a (ϑ,s,t)-family iff the intersection of any two distinct elements ...
AbstractLet B(j, k; n) be the ordered set obtained by ordering the j element and k element subsets o...
the set of surjective lattice homomorphisms from P to {0, 1}. For p ∈ P set π(p) = {z: z ∈ Z, z(p) ...
AbstractThe dimension of a partially ordered set P is the smallest integer n (if it exists) such tha...
International audienceWe introduce the dimension monoid of a lattice L, denoted by Dim L. The monoid...
For a finite lattice L, the congruence lattice Con L of L can be easily computed from the partially ...
AbstractLet 2[n] denote the Boolean lattice of order n, that is, the poset of subsets of {1,…,n} ord...
AbstractA cutset in the poset 2[n], of subsets of {1, …, n} ordered by inclusion, is a subset of 2[n...
summary:We use graph-algebraic results proved in [8] and some results of the graph theory to charact...
We study the lattice nite representability of the Bochner space Lp(1; Lq(2)) in ‘pf‘qg, 1 p; q <...
International audienceWe determine the dimension of every simple module for the algebra of the monoi...