Remarks on power structures

Chris Brink, in his paper,Power Structures, describes the construction ofgeneralized quotient algebras. IfA is any algebra, the corresponding generalized quotient algebraA/R is defined for every value-preserving relation . As we will see in the present paper, in order to make the corresponding operations on the setA/R well-defined, it is not enough forR to be value-preserving. The only redundancy in the definition of the usual quotient algebra is symmetry.Presented by G. Grätzer.     

Smallest maximal snakes of translates of convex domains

LetK be a convex domain. A maximal snake of sizen is a set of non-overlapping translatesK ₁, ...,K _N ofK, whereK _i touchesK _j if and only if |i –j|=1 and no translate ofK can touchK ₁ orK _n without intersecting an additionalK _i ,i=1, ...,n. The size of the smallest maximal snake is proved to be 11 ifK is a parallelogram and to be 10 otherwise.     

A note on packing paths in planar graphs

Seymour (1981) proved that the cut criterion is necessary and sufficient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, Middendorf and Pfeiffer (1993) proved the problem to be NP-complete. For this case, Korach and Penn (1992) proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths.Analogously to Seymour's approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of Seb (1990) on the structure of ±1 weightings of a bipartite graph with no negative circuits.Research partially supported by the Hungarian National Foundation for Scientific Research Grants OTKA 2118 and 4271.     

Lines of curvature near umbilical points on surfaces immersed in R4

LetM be a compact orientable surface,I:M R⁴ an immersion of classC ^r and a normal unitary smooth vector field. We prove that in the space of pairs (I, ) the family of pairs all whose umbilical points are Darbouxian is generic.     

Classical limit of the quantized hyperbolic toral automorphisms

The canonical quantization of any hyperbolic symplectomorphismA of the 2-torus yields a periodic unitary operator on aN-dimenional Hilbert space,N=1/h. We prove that this quantum system becomes ergodic and mixing at the classical limit (N,N prime) which can be interchanged with the time-average limit. The recovery of the stochastic behaviour out of a periodic one is based on the same mechanism under which the uniform distribution of the classical periodic orbits reproduces the Lebesgue measure: the Wigner functions of the eigenstates, supported on the classical periodic orbits, are indeed proved to become uniformly speread in phase space.     

On the capacity of boolean graph formulæ

In a recent paper we have solved several well-known combinatorial problems treating them as special cases of our generalization of Shannon's notion of graph capacity. We present a new simple formalism to deal with all such problems in a unified manner, considering graphs or families of graphs as special formulæ the variables of which are pairs of vertices of their common vertex sets. In all of these problems, the maximum size of a set ofn-length sequences from a fixed alphabet is to be determined under various restrictions on the element pairs present in the same coordinate of any two sequences from the set. For sufficiently homogeneous formulæ capacity becomes computable.New applications include generalizations of our result on the maximum number of pairwise qualitatively independentk-partitions of ann-set from independence to various forms of qualitative dependence.Work partially supported by the Italian Ministry of the University and Scientific Research, Project: Algoritmi, Modelli di Calcolo e Strutture Informative.     

Spectra of graphs and fractal dimensions II

This paper continues the study of exponentsd(x), d (x), d _R (x) andd (x) for graphG; and the nearest neighbor random walk {X _n } _nN onG, if the starting pointX ₀=x is fixed. These exponents are responsible for the geometric, resistance, diffusion and spectral properties of the graph. The main concern of this paper is the relation of these exponents to the spectral density of the transition matrix. A series of new exponentse, e ,e _R ,e are introduced by allowingx to vary along the vertices. The results suggest that the geometric and resistance properties of the graph are responsible for the diffusion speed on the graph.     

Covering with blocks in the non-symmetric case

Considering an infinite string of i.i.d. random letters drawn from a finite alphabet we define the cover timeW _n as the number of random letters needed until each pattern of lenghtn appears at least once as a substring. Sharp weak and a.s. limit results onW _n are known in the symmetric case, i.e., when the random letters are uniformly distributed over the alphabet. In this paper we determine the limit distribution ofW _n in the nonsymmetric case asn. Generalizations in terms of point processes are also proved.Dedicated to Endre Csáki on his 60th birthday.     

Deposition of copper films by unbalanced d.c. magnetron sputtering

The electrical resistivity of as deposited polycrystalline copper thin films as a function of varying the process parameters has been investigated. Trying to minimize the resistivity of the copper thin films is important in the semiconductor industry, due to the fact that low resistivity copper can be employed to great advantage for new metallization schemes in advanced ultralarge scale integrated circuits. This paper presents the optimum choice of parameters that are necessary to achieve low resistivities of the thin films in reproducible experiments. All the depositions were performed using an unbalanced d.c. planar magnetron sputtering source (consisting of a circular copper target (98% purity, 0.01% Fe, 0.005% Ni, 0.005% Si) with a diameter of 100mm fitted with two electromagnets). The copper thin films were deposited onto glass substrates with argon being used as the sputtering gas. The resistivity was studied as a function of the pressure of the sputtering gas, the substrate bias, the substrate to target distance, the magnetron power, and the substrate temperature. It was found that depositions producing thin films with a resistivity of that approaching the bulk material (1.7×10^–8m) were obtained if the sputtering gas pressure was below 0.2 Pa. The effect of the substrate bias was insignificant at these pressures. The crystallographic structure of the copper thin films, determined by X-ray diffraction, is also reported.The authors would like to thank Dr. Soukup for his support during this research. We would also like to express our gratitude to Mr. A. Rajský for improving the design of the sputtering device. This work was partially financed by a grant from the Grant Agency of the Czech Republic No. 202/93/0508.