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.     

Encapsulation of magnetite in vesicles

The encapsulation of fine magnetite particles of 10 nm size and marker ANS within asolectin vesicles has been made by sonication of the mixture in water. For the proof of encapsulation of magnetite in vesicles the electron microscope and spectrofluoriphotometer technique were used. The theory for the calculation of the magnetic force acting on the system consisted of non-capsulated magnetic particles dispersed in water and magnetic vesicles was developed.This work was supported by the Slovak Academy of Sciences within the framework of Project GAV No. 1361.     

On the critical regimes in the theory of randomly forced magnetohydrodynamic turbulence

In this paper large-scale properties of developed magnetohydrodynamic turbulence have been investigated by using double expansion method in the frame of quantum field renormalization group. It has been shown that universal kinetic scaling regime exists, but the double expansion in general leads to qualitatively different results than those provided by the usual -expansion treatment.This work was supported by Slovak Grant Agency for Science.     

The SO(3,3) group as a common basis for Dirac's and Proca's equations

Dirac's and Proca's equations are unified in the sense that the algebras of Dirac -matrices and Duffin-Kemmer-matrices are shown to furnish two distinct matrix representations of the Lie algebra of the SO(3,3)-group. This fact is then interpreted as evidence for the classical picture of particles described by the above-mentioned equations to be a relativistic top. It is also argued that the shape of the top is rod-like.