Evaluating the financial performance of bank branches

We evaluate the financial performance of most of the branch offices of a large European savings bank for a recent accounting period. We employ a complementary pair of nonparametric techniques to evaluate their financial performance, in terms of their ability to conserve on the expenses they incur in building their customer bases and providing customer services. We find variation in the ability of branch offices to perform this task, and agreement on the identity of the laggard branches. We then employ parametric techniques to determine that the list of indicators on which their financial performance is evaluated can be reduced without statistically significant loss of information to bank management. Both findings suggest ways in which the bank can increase the profitability of its branch network. A previous version of this paper was presented at CORE, Université Catholique de Louvain, Louvain-la-Neuve, Belgium, where we received many helpful comments from the audience. We are grateful to three referees for their helpful comments as well.     

Thickness dependence of the magnetic anisotropy of Fe layers separated by Al

Magnetic multilayers of ⁵⁷Fe with nominal thickness, T _nom, between 0.4 and 1.0 nm separated by 3.0 nm Al spacer layers were prepared by alternate deposition of the constituents in high vacuum. The samples were investigated at 4.2 K in external magnetic field. A fraction of Fe atoms corresponding to about 0.3 nm equivalent Fe-thickness was found to mix into the Al spacer. The extremely strong magnetic anisotropy observed for T _nom < 0.8 nm is attributed to Fe layers of approximately two atomic planes thick. The anisotropy decreases considerably after the building up of the third Fe atomic layer starts at T _nom = 0.8 nm, but full saturation was not achieved even for T _nom = 1 nm and 3 T magnetic field applied perpendicularly to the sample plane.     

Algebraic Dirichlet-to-Neumann mapping for linear elasticity problems with extreme contrasts in the coefficients

The convergence of iterative based domain decomposition methods is linked with the absorbing boundary conditions defined on the interface between the sub-domains. For linear elasticity problems, the optimal absorbing boundary conditions are associated with non-local Dirichlet-to-Neumann maps. Most of the methods to approximate these non-local maps are based on a continuous analysis. In this paper, an original algebraic technique based on the computation of local Dirichlet-to-Neumann maps is investigated. Numerical experiments are presented for linear elasticity problems with extreme contrasts in the coefficients.     

A new interpretation of quantum mechanics and its consequences in epistemology

A rather recent interpretation of quantum mechanics, known under the various names of consistent histories, decohering histories, or logical interpretation, has brought interpretation into a standard deductive theory and is now investigated in many places. A key difference with the Copenhagen interpretation is the status of classical physics, now derived completely from quantum principles in both its dynamical and logical aspects. After describing briefly this new interpretation in its essentials, leaving aside technical details, it is shown how its consequences in epistemology differ drastically from the familiar outcomes of the Copenhagen interpretation, leading in particular to a well-defined theory of knowledge. Some more speculative philosophical consequences associated with the unsolved problem of actuality are also mentioned.     

A strange pigeon-hole principle

Using Ramsey theory, we establish the following pigeon-hole type principle: From a large number of random variables (functions, vectors, etc.) one can always select two, X and Y, such that P(X < Y) 1/2. We apply the principle for a poset problem.     

Variations on the theme of repeated distances

We give an asymptotically sharp estimate for the error term of the maximum number of unit distances determined byn points in ^{d, d}4. We also give asymptotically tight upper bounds on the total number of occurrences of the favourite distances fromn points in ^{d, d}4. Related results are proved for distances determined byn disjoint compact convex sets in ².At the time this paper was written, both authors were visiting the Technion — Israel Institute of Technology.     

On the second smallest distance between finitely many points on the sphere

In the following note we investigate the second smallest distance between finitely many points on the sphere. Actually we look for the smallest upper bound for the second smallest distance between n points on the unit sphere. We solve this problem for n=9 and also we give a general, non-trivial upper bound for the second smallest distance of n points with n9.Supported by the Hungarian National Foundation for Scientific Research, Number 1238.