Disordered charge distributions and dielectric loss in extra dense flint glasses

The complex permittivities of some extra dense flint glasses (EDF glasses) have been studied. The dielectric features of the samples are dominated by their PbO content. Both refractive indices and dielectric losses exhibit a close relation to the concentration of Pb ions. The latter are located either at sites of the network atoms or filling the potential minima interstitially. They can be identified by their different relaxation mechanisms. The dispersion in the submillimeter wave and FIR area is characterized by a very broad distribution of comparably sharp resonant states. Thermal lens — or hysteresis effects can be excluded.     

Large deviation estimates for a conditional probability distribution. Applications to random interaction Gibbs measures

Summary Let (X _i ,Y _i ) ^d , be independent identically distributed random variables with arbitrary distribution. We show that, for almost every(Y _i ) _i , the conditional law of the empirical field given(Y _i ) _i satisfies to large deviation inequalities. This applies to the study of Gibbs measures with random interaction, in the case of some mean-field models as well as of short range summable interaction. We show that the pressure is nonrandom, and is given by a variational formula. These random Gibbs measures have the same large deviation rate, which does not depend on the particular realization of the interaction; their local behaviour is described in terms of conditional probabilities given the interaction of solutions to the variational formula.     

A Dynamic location problem for graphs

We introduce a class of optimization problems, calleddynamic location problems, involving the processing of requests that occur sequentially at the nodes of a graphG. This leads to the definition of a new parameter of graphs, called the window indexWX(G), that measures how large a window into the future is needed to solve every instance of the dynamic location problem onG optimally on-line. We completely characterize this parameter:WX(G)k if and only ifG is a weak retract of a product of complete graphs of size at mostk. As a byproduct, we obtain two (polynomially recognizable) structural characterizations of such graphs, extending a result of Bandelt.     

Markovian network processes: Congestion-dependent routing and processing

A Markovian network process describes the movement of discrete units among a set of nodes that process the units. There is considerable knowledge of such networks, often called queueing networks, in which the nodes operate independently and the routes of the units are independent. The focus of this study, in contrast, is on networks with dependent nodes and routings. Examples of dependencies are parallel processing across several nodes, blocking of transitions because of capacity constraints on nodes, alternate routing of units to avoid congestion, and accelerating or decelerating the processing rate at a node depending on downstream congestion. We introduce a general network process representing the numbers of units at the nodes and derive its equilibrium distribution. This distribution takes the form of a product of functions of vectors in which the arguments of the functions satisfy an interchangeability property. This new type of distribution may apply to other multi-variate processes as well. A basic idea in our approach is a linking of certain micro-level balance properties of the network routing to the processing rates at the nodes. The link is via routing-balance partitions of nodes that are inherent in any network. A byproduct of this approach is a general characterization of blocking of transitions without the restriction that the process is reversible, which had been a standard assumption. We also give necessary and sufficient conditions under which a unit moving in the network sees a time average for the unmoved units (called the MUSTA property). Finally, we discuss when certain flows between nodes in an open network are Poisson processes.This research was sponsored in part by Air Force Office of Scientific Research contract 84-0367.     

On two mean value properties and functional equations associated with them

Summary Motivated by different mean value properties, the functional equationsf(x) – f(y)/x–y=[(x, y)], (i)xf(y) – yf(x)/x–y=[(x, y)] (ii) (x y) are completely solved when, are arithmetic, geometric or harmonic means andx, y elements of proper real intervals. In view of a duality between (i) and (ii), three of the results are consequences of other three.The equation (ii) is also solved when is a (strictly monotonic) quasiarithmetic mean while the real interval contains 0 and when is the arithmetic mean while the domain is a field of characteristic different from 2 and 3. (A result similar to the latter has been proved previously for (i).)     

Crystal structure oftrans-[PtCl2(Me2PhP)(cis-2,5-dimethylpyrrolidine)]

The complextrans-[PtCl₂ (Me₂PhP)(cis-2,4-dimethylpyrrolidine)] has been characterized by X-ray crystallography. It crystallizes in the monoclinic space group P 2₂/c witha=8.762(3),b=16.034(5),c=12.600(4)Å,=93.43(3)° andZ=4. The structure was solved by heavy atom method and refined toR=0.052 for 3251 observed counter reflections. The coordination sphere of the Pt atom is square-planar with a geometry very similar to that of the studied complexes of the type trans-[PtCl₂(R₃P)L] whereL is either one of the possible isomers of theC,C-dimethylpyrrolidine or the unsubstituted pyrrolidine. In the present complex the puckered five-membered ring of the dimethylpyrrolidine ligand assumes an envelope conformation with the maximum puckering at the N atom.     

Lattice-point examples for a question of Erdős

Here we establish a set of eight points in general position in the plane, i.e. no three on a line, no four on a circle, and they determine 7 distinct distances, so that, thei-th distance occursi times,i = 1, 2, , 7. The points are embedded in a triangular net, and the distances are not ordered by size or in any other way. We shall show that some known and unknown examples forn < 8 with the above properties may also be lattice points of a similar net.Research (partially) supported by the Hungarian National Foundation for Scientific Research (OTKA) grant, no. 1808.