A subset U of vertices of a graph G is called a determining set if every automorphism of G is uniquely determined by its action on the vertices of U . A subset W is called a resolving set if every vertex in G is uniquely determined by its distances to the vertices of W . Determining (resolving) sets are said to have the exchange property in G if whenever S and R are minimal determining (resolvi...

We define a notion of determining sets for the discrete Laplacian in a domain Ω. A set D is called determining if harmonic functions are uniquely determined by providing their values on D, and if D has the same size as the boundary of Ω. It is shown that there exist determining sets that are fairly evenly distributed in Ω. A number of basic properties of determining sets are derived.

In reply to Péter Majlender, the connection between the (maximum spread) equidifferent OWA operator weights and the analytical method for the minimum variance OWA operator problem [R. Fullér, P. Majlender, On obtaining minimal variability OWA operator weights, Fuzzy Sets and Systems 136 (2003) 203–215] is pointed out and the differences between them are clarified. 2006 Elsevier Inc. All rights ...

Signaling theory typically assumes that attention is always given to observable signals. We study signal receivers’ formation of sets—the signals which receivers attend and they can use for subsequent interpretations. Drawing on a cognitive perspective, we argue human capital influences the volume type time take form sets. Using eye tracking, show equity crowdfunders do not many are easily camp...

In this paper, we consider Nearest points" and Farthestpoints" in normed linear spaces. For normed space (X; ∥:∥), the set W subset X,we dene Pg; Fg;Rg where g 2 W. We obtion results about on Pg; Fg;Rg. Wend new results on Chebyshev centers in normed spaces. In nally we deneremotal center in normed spaces.

Because antimatroid closure spaces satisfy the anti-exchange axiom, it is easy to show that they are uniquely generated. That is, the minimal set of elements determining a closed set is unique. A prime example is a discrete geometry in Euclidean space where closed sets are uniquely generated by their extreme points. But, many of the geometries arising in computer science, e.g. the world wide we...