Stone-Weierstrass-type theorems for groups of group-valued functions with discrete range or discrete domain are obtained. We study criteria for a subgroup of the group of continuou...
In the minimum path coloring problem, we are given a graph and a set of pairs of vertices of the graph and we are asked to connect the pairs by colored paths in such a way that pa...
Uniprocessor schedulability theory made great strides, in part, due to the simplicity of composing the delay of a job from the execution times of higher-priority jobs that preempt...
We show that inclusion order and single-step inclusion coincide for higher Bruhat orders B(n; 2), i.e., B(n; 2) = B (n; 2). Mathematics Subject Classi cations (1991). 06A06, 51G05,...