Previous Page 6

Displaying 101 – 109 of 109

Showing per page

Coxeter-like complexes.

Babson, Eric, Reiner, Victor (2004)

Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]

Cycle-free cuts of mutual rank probability relations

Karel De Loof, Bernard De Baets, Hans De Meyer (2014)

Kybernetika

It is well known that the linear extension majority (LEM) relation of a poset of size n 9 can contain cycles. In this paper we are interested in obtaining minimum cutting levels α m such that the crisp relation obtained from the mutual rank probability relation by setting to 0 its elements smaller than or equal to α m , and to 1 its other elements, is free from cycles of length m . In a first part, theoretical upper bounds for α m are derived using known transitivity properties of the mutual rank probability...

Currently displaying 101 – 109 of 109

Previous Page 6