Stochastic quantization and regularization

In this paper the method of stochastic quantization introduced by Parisi and Wu is extended to field theories that include fermions and are supersymmetric. A new non-perturbative regulator based on stochastic quantization is introduced. This regulator preserves all the symmetries of the lagrangian, including gauge, chiral, and supersymmetries, at the expense of introducing non-locality.     

On the correlation dimension of the spectral measure for the thue-morse sequence

Using the relationship between the decay rate of autocorrelation and the characteristics of singular Fourier spectra, we show that the correlation dimension of the spectral measure for the infinite Thue-Morse symbolic sequence equals 3 − log(1 + √17)/log 2=0.64298….     

Pairs of Hamiltonian circuits in 5-connected planar graphs

Settling a problem raised by B. Grünbaum, J. Malkevitch, and the author, we present 5-valent 5-connected planar graphs that admit no pairs of edgedisjoint Hamiltonian circuits; our smallest example has 176 vertices. This is used to construct an infinite family of 5-valent 5-connected planar graphs, in which every member has the property that any pair of Hamiltonian circuits in it share at least about $\text{1}\text{168}$ of their edges. We construct 4- and 5-valent, 3-connected non-Hamiltonian planar graphs.     

On the 1-factors of n-connected graphs

L. W. Beineke and M. D. Plummer have recently proved [1] that every n-connected graph with a 1-factor has at least n different 1-factors. The main purpose of this paper is to prove that every n-connected graph with a 1-factor has at least as many as n(n − 2)(n − 4) … 4 · 2, (or: n(n − 2)(n − 4) … 5 · 3) 1-factors. The main lemma used is: if a 2-connected graph G has a 1-factor, then G contains a vertex V (and even two such vertices), such that each edge of G, incident to V, belongs to some 1-factor of G.     

6-Valent analogues of Eberhard’s theorem

It is shown that for every sequence of non-negative integers (p _n|1≦n≠3) satisfying the equation {ie19-1} (respectively, =0) there exists a 6-valent, planar (toroidal, respectively) multi-graph that has preciselyp _n n gonal faces for alln, 1≦n≠3. This extends Eberhard’s theorem that deals, in a similar fashion, with 3-valent, 3-connected planar graphs; the equation involved follows from the famous Euler’s equation.     

Protecting convex sets

A point-setS is protecting a collection F =T ₁,T ₂,..., _n ofn mutually disjoint compact sets if each one of the setsT _i is visible from at least one point inS; thus, for every setT _i ∈F there are points xS andy T _i such that the line segment joining x to y does not intersect any element inF other thanT _i . In this paper we prove that [2(n-2)/3] points are always sufficient and occasionally necessary to protect any family F ofn mutually disjoint compact convex sets. For an isothetic family F, consisting ofn mutually disjoint rectangles, [n/2] points are always sufficient and [n/2] points are sometimes necessary to protect it. IfF is a family of triangles, [4n/7] points are always sufficient. To protect families ofn homothetic triangles, [n/2] points are always sufficient and [n/2] points are sometimes necessary.     

Phase synchronization of chaotic oscillations in terms of periodic orbits

We consider phase synchronization of chaotic continuous-time oscillator by periodic external force. Phase-locking regions are defined for unstable periodic cycles embedded in chaos, and synchronization is described in terms of these regions. A special flow construction is used to derive a simple discrete-time model of the phenomenon. It allows to describe quantitatively the intermittency at the transition to phase synchronization. (c) 1997 American Institute of Physics.     

On convergence of random walks generated by compound Cox processes to Lévy processes

A functional limit theorem is proved establishing weak convergence of random walks generated by compound doubly stochastic Poisson processes to Lévy processes in the Skorokhod space. As corollaries, theorems are proved on convergence of random walks with jumps having finite variances to Lévy processes with mixed normal distributions, and in particular, to stable Lévy processes.