Given a k-tuple P=(x 1,x 2,...,x k ) in a finite lattice X endowed with the lattice metric d, a median of P is an element m of X minimizing the sum ∑ i d(m,x i ). If X is an upper semimodular lattice, Leclerc proved that a lower bound of the medians is c(P), the majority rule and he pointed out an open problem: “Is c 1(P)=∨ i x i , the upper bound of the medians?” This paper shows that the upper bound is not c 1(P) and gives the best possible upper bound
AbstractA problem of V. Chvátal is solved. It is proved that if P is a vertically convex lattice pol...
URL des Documents de travail : http://ces.univ-paris1.fr/cesdp/cesdp2016.htmlDocuments de travail du...
URL des Documents de travail : http://ces.univ-paris1.fr/cesdp/cesdp2016.htmlDocuments de travail du...
Given a metric space (X, d) and a k-tuple (profile) P = (x1, x2,...,xk ) of elements of P X, a media...
AbstractA median of a k-tuple π=(x1,…,xk) of elements of a finite metric space (X,d) is an element x...
AbstractBruno Leclerc proved that a finite lattice is upper semimodular if and only if, for any prof...
AbstractA median of a k-tuple π=(x1,…,xk) of elements of a finite metric space (X,d) is an element x...
AbstractWe consider the undirected covering graph G of a finite (meet) semilattice X endowed with a ...
AbstractA median of a k-tuple π=(x1,…,xk) of vertices of a finite connected graph G is a vertex x fo...
A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which mi...
Let Λ be a lattice of full rank in the N-dimensional Euclidean space RN for N ≥ 2. The minimum of Λ ...
Let Λ be a lattice of full rank in the N-dimensional Euclidean space RN for N ≥ 2. The minimum of Λ ...
AbstractFor a lattice L of finite length we denote by J(L) the set of all join-irreducible elements ...
Let L be a lattice of finite length, ξ = (x1,…, xk)∈Lk, and y ∈ L. The remotenessr(y, ξ) of y from ξ...
AbstractLet X be a finite set; we are concerned with the problem of finding a consensus order P that...
AbstractA problem of V. Chvátal is solved. It is proved that if P is a vertically convex lattice pol...
URL des Documents de travail : http://ces.univ-paris1.fr/cesdp/cesdp2016.htmlDocuments de travail du...
URL des Documents de travail : http://ces.univ-paris1.fr/cesdp/cesdp2016.htmlDocuments de travail du...
Given a metric space (X, d) and a k-tuple (profile) P = (x1, x2,...,xk ) of elements of P X, a media...
AbstractA median of a k-tuple π=(x1,…,xk) of elements of a finite metric space (X,d) is an element x...
AbstractBruno Leclerc proved that a finite lattice is upper semimodular if and only if, for any prof...
AbstractA median of a k-tuple π=(x1,…,xk) of elements of a finite metric space (X,d) is an element x...
AbstractWe consider the undirected covering graph G of a finite (meet) semilattice X endowed with a ...
AbstractA median of a k-tuple π=(x1,…,xk) of vertices of a finite connected graph G is a vertex x fo...
A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which mi...
Let Λ be a lattice of full rank in the N-dimensional Euclidean space RN for N ≥ 2. The minimum of Λ ...
Let Λ be a lattice of full rank in the N-dimensional Euclidean space RN for N ≥ 2. The minimum of Λ ...
AbstractFor a lattice L of finite length we denote by J(L) the set of all join-irreducible elements ...
Let L be a lattice of finite length, ξ = (x1,…, xk)∈Lk, and y ∈ L. The remotenessr(y, ξ) of y from ξ...
AbstractLet X be a finite set; we are concerned with the problem of finding a consensus order P that...
AbstractA problem of V. Chvátal is solved. It is proved that if P is a vertically convex lattice pol...
URL des Documents de travail : http://ces.univ-paris1.fr/cesdp/cesdp2016.htmlDocuments de travail du...
URL des Documents de travail : http://ces.univ-paris1.fr/cesdp/cesdp2016.htmlDocuments de travail du...