Sobolev-Type Classes of Functions with Values in a Metric Space. II

We prove equivalence of the definitions by the author and by Korevaar and Schoen of the Sobolev classes of mappings of a domain of an arithmetic n-dimensional space to a metric space.     

Recognition of the Finite Simple Groups F 4(2m) by Spectrum

The spectrum of a finite group is the set of its element orders. A finite group G is said to be recognizable by spectrum, if every finite group with the same spectrum as G is isomorphic to G. The purpose of the paper is to prove that for every natural m the finite simple Chevalley group F ₄(2 ^m ) is recognizable by spectrum.     

A Stability Estimate for a Solution of the Problem of Determining the Dielectric Permittivity

We consider the problem of determining the dielectric permittivity for a nonconducting and nonmagnetic medium. As information we take the traces of the tangential components of the electromagnetic field on the lateral surface of a cylindrical domain. These traces correspond to a solution to some direct problem for the Maxwell system. The impulse source of the current flux lies outside the domain in which the coefficient is sought. The main result of the article is a stability estimate for a solution to the inverse problem in question.     

Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows

This note introduces a refinement to a previously proposed tabu search algorithm for vehicle routing problems with time windows. This refinement yields new best known solutions on a set of benchmark instances of the multi-depot, the periodic and the site-dependent vehicle routing problems with time windows.     

Heat polynomial analogues for equations with higher order time derivatives

We generalize the heat polynomials for the heat equation to more general partial differential equations, of higher order with respect to both the time variable and the space variables. Whereas the heat equation requires only one family of polynomials, for an equation of the ?th order with respect to time we introduce ? families of polynomials. These families correspond to the ? initial conditions specified by the Cauchy problem.     

An effect of application of chiral aluminium alkoxides and amides as adducts to zirconium catalyzed carbo- and cycloalumination of olefins

This paper is dedicated to a study of properties of the following novel optically active organoaluminium compounds (OACs): (1S,2S)-l,7,7-trimethyl-2-[(dialkylalumina)oxy]-bicyclo[2.2.1]heptanes and (1S)-N-(dialkylalumina)-6,7-dimethoxy-1-methyl-1,2,3,4- tetrahydroisoquinolines. The synthesis of the chiral OACs was carried out in the reaction of either natural camphor or salsolidine with both AlEt₃ and i-Bu₂AlH. The main goal of the research was to investigate the stereodifferentiating activity of the chiral OACs in the olefin carbo- and cycloalumination reactions, catalyzed by Cp₂ZrCl₂.     

Gamow Vectors in Exactly Solvable Models

Through two examples: the Friedrichs model and a particular case of central potential scattering, we illustrate the way of constructing Gamow vectors.     

1,1,3-Trimethyl-3-phenylindan as a Luminescent Additive to a Plastic Scintillator Based on Poly(methyl Methacrylate)

The luminescence and scintillation properties of poly(methyl methacrylate) containing 1,1,3-trimethyl-3-phenylindan were studied.     

Identifying Linking-Pin Organizations in Inter-Organizational Networks

Within the large literature on inter-organizational networks, there has been some discussion of linking-pin organizations and the role they play in integrating these networks. Based on this verbal specification of linking-pin organizations, we construct operational criteria and empirical methods for identifying these structurally important organizations in potentially large and complex inter-organizational networks. These methods are based on ideas drawn from blockmodeling, structural holes, centrality and centralization of networks, and identifying cut-points in networks. These methods are applied to a constructed example and then to real empirical inter-organizational networks. Implications and contrasts with other methods are discussed, together with some open problems.     

Random Walks And The Colored Jones Function

It can be conjectured that the colored Jones function of a knot can be computed in terms of counting paths on the graph of a planar projection of a knot. On the combinatorial level, the colored Jones function can be replaced by its weight system. We give two curious formulas for the weight system of a colored Jones function: one in terms of the permanent of a matrix associated to a chord diagram, and another in terms of counting paths of intersecting chords. Electronic supplementary material to this article is available at and is accessible to authorized users. * S. G. was partially supported by an NSF and by an Israel-US BSF grant. † M. L. was partly supported by GAUK 158 grant and by the Project LN00A056 of the Czech Ministry of Education.