We show that every free amalgamation class of finite structures with relations and (symmetric) partial functions is a Ramsey class when enriched by a free linear ordering of vertices. This is a common strengthening of the Nešetřil-Rödl Theorem and the second and third authors’ Ramsey theorem for finite models (that is, structures with both relations and functions). We also find subclasses with ...

We study sets of preferences that are convex with respect to the betweeness relation induced by the Kemeny distance for preferences. It appears that these sets consist of all preferences containing a certain partial ordering and the other way around all preferences containing a given partial ordering form a convex set. Next we consider restricted domains where each agent has a convex set of pre...

Some degree of error is inevitable in multi-agent bioassays regardless of design or measurement technology. Estimation error can be reduced post facto by exploiting the matrix partial ordering of the bioassay survival estimates. The standard method for this is order-restricted regression (ORR). If the joint action of the bioassay agents admits a tolerance-based interpretation, additional struct...

This paper compares n-dimensional random vectors in terms of their interdependence. We adopt the stochastic dominance approach, relating orderings of interdependence expressed directly in terms of joint probability distributions to orderings expressed indirectly through properties of objective functions whose expectations are used to evaluate distributions. Since the expected values of additive...

This paper provides a systematic analysis of the relative utility of basing EBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate the potential advantages into those related to storage compaction, and those related to the ability to exploit stored plans. We observe that the storage compactions provided by partially ordered partially instantiated...

The natural partial ordering of the orbit types of the action of the group of local gauge transformations on the space of connections in space-time dimension d ≤ 4 is investigated. For that purpose, a description of orbit types in terms of cohomology elements of space-time, derived earlier, is used. It is shown that, on the level of these cohomology elements, the partial ordering relation is ch...

We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of partially-ordered sets to form host graphs for Ramsey problems. We explore connections to well studied Turán-type problems in partially-ordered sets, particularly th...

For each pair of graphs from among the Archimedean lattices and their dual Laves lattices we demonstrate that one is a subgraph of the other or prove that neither can be a subgraph of the other. Therefore, we determine the entire partial ordering by inclusion of these 19 infinite periodic graphs. There are a total of 72 inclusion relationships, of which 35 are covering relations in the partial ...

This paper presents a new algorithm to implement causal ordering. Causal ordering was first proposed in the ISIS system developed at Cornell University. The interest of causal ordering in a distr ibuted system is that it is cheaper to realize than total ordering. The implementation of causal ordering proposed in this paper uses logical clocks of Mat te rn-Fidge (which define a partial order bet...

Weighted Constraint Satisfaction Problems (WCSP) are used to model and to solve some constraint optimization problems. WCSPs are often solved by complete or partial tree search strategies combined with filtering. For these methods, variable ordering heuristic (MinDom/FutDeg) and value ordering heuristic (MinAC) are considered to be the most efficient ones. In this paper, we propose a new value ...