Spanning tree formulas and chebyshev polynomials

The Kirchhoff Matrix Tree Theorem provides an efficient algorithm for determiningt(G), the number of spanning trees of any graphG, in terms of a determinant. However for many special classes of graphs, one can avoid the evaluation of a determinant, as there are simple, explicit formulas that give the value oft(G). In this work we show that many of these formulas can be simply derived from known properties of Chebyshev polynomials. This is demonstrated for wheels, fans, ladders, Moebius ladders, and squares of cycles. The method is then used to derive a new spanning tree formula for the complete prismR _n (m) =K _m ×C _n . It is shown that $$2^{\left( {\begin{array}{*{20}c} n \\ 2 \\ \end{array} } \right)\left( {1 - \frac{1}{{r - 1}} + o\left( 1 \right)} \right)} $$ whereT _n (x) is then ^th order Chebyshev polynomial of the first kind.     

Nucleon-nucleon forces in a nonrelativistic quark model

Conclusion We have considered allNN-partial waves simultaneously. The central part of the one gluon exchange is always repulsive, the tensor part can be neglected and the spin-orbit part is too weak for this choice of parameters. An additional colourless V^MEP potential allows us to reproduce the experimental data. However, this potential cannot be related to a long range one-pion exchange potential.Presented at the symposium Mesons and Light Nuclei, Bechyn, Czechoslovakia, May 27–June 1, 1985.     

Pionic decay of hypernuclei

The mass number dependence of the total pionic decay rate of hypernuclei is evaluated under the closure approximation by using DDHF single-particle wave functions and taking into account the pion distortion and absorption. The effect ofNN andN correlations are then incorporated and found to give a drastic enhancement especially in heavy hypernuclei. More detailed features are discussed for partial and total decay rates of typical light hypernuclei.Presented at the symposium Mesons and Light Nuclei, Bechyn, Czechoslovakia, May 27–June 1, 1985.     

On subharmonic functions dominated by certain functions

Given two kinds of functionsf(X) andh(y) defined on them-dimensional Euclidean spaceR ^m (m≧1) and the set of positive real numbers respectively, we give an estimation of growth of subharmonic functionsu(P) defined onR ^m+n (n≧1) such that $$u(P) \leqq f\left( X \right)h\left( {\left\| Y \right\|} \right)$$ for anyP=(X, Y),X ∈R ^m, Y ∈R ⁿ, where ‖Y ‖ denotes the usual norm ofY. Using an obtained result, we give a sharpened form of an ordinary Phragmén-Lindelöf theorem with respect to the generalized cylinderD ×R ⁿ, with a bounded domainD inR ^m.     

The uniqueness of the adjoint operation I

Let H be a complex, infinite-dimensional Hilbert space. Let B(H) denote the set of bounded linear operators on H. This paper contains a nonlinear characterization of the adjoint operation on B(H). The statement of this result is:THEOREM:Let h: B(H) B(H)be a function such that h(I)0.Then h(ST)=h(T)h(S)and h(S)S0for all elements Sand Tof B(H)if and only if h(S)=S^* for all S B(H).     

Melnikov's criterion for nondifferentiable weak-noise potentials

The stationary probability density of Fokker-Planck models with weak noise is asymptotically of the form exp[–1 /(q)]. If is smooth, it satisfies a Hamilton-Jacobi equation at zero energy and can be interpreted as the action of an associated Hamiltonian system. Under this assumption, has the properties of a Liapounov function, and can be used, e.g., as a thermodynamic potential in nonequilibrium steady states. We consider systems having several attractors and show, by applying Melnikov's method to the associated Hamiltonian, that in general is not differentiable. A small perturbation of a model with differentiable leads to a nondifferentiable . The method is illustrated on a model used in the treatment of the unstable mode in a laser.     

On the nature and origin of complexity in discrete,homogeneous, locally-interacting systems

The observed complexity of nature is often attributed to an intrinsic propensity of matter to self-organize under certain (e.g., dissipative) conditions. In order better to understand and test this vague thesis, we define complexity as logical depth, a notion based on algorithmic information and computational time complexity. Informally, logical depth is the number of steps in the deductive or causal path connecting a thing with its plausible origin. We then assess the effects of dissipation, noise, and spatial and other symmetries of the initial conditions and equations of motion on the asymptotic complexity-generating abilities of statistical-mechanical model systems. We concentrate on discrete, spatially-homogeneous, locally-interacting systems such as kinetic Ising models and cellular automata.     

A geometrical approach to bifurcation for nonlinear boundary value problems

Summary In this note we use a new averaging method, which was introduced in [2], to explain the geometrical behaviour of systems governed by nonlinear boundary value problems of the formy+g(y)=K sin(t),y(0)=y(/)=0. We show by numerical computations that global features of the solutions (such as the number of solutions, their magnitude, bifurcation behaviour, etc.) agree in both the original and averaged model. As an example, the pendulum equation is discussed in detail.

---

Zusammenfassung In dieser Arbeit benutzen wir eine neue, in [2] eingeführte Mittelwertmethode, um das geometrische Verhalten nichtlinearer Randwertprobleme der Formy+g(y)=K sin(t),y(0)=y(/)=0. zu erklären. Wir belegen durch numerische Untersuchungen, daß globale Eigenschaften der Lösungen (wie z. B. die Anzahl der Lösungen, ihre Größenordnung, das Verzweigungsverhalten usw.) in der originalen und genäherten Gleichung übereinstimmen. Als Beispiel wird die Pendelgleichung ausführlich diskutiert.

---

---

Supported by the Deutsche Forschungsgemeinschaft under grant No. BA 735/3-1     

Applying a fuzzy relation to describe influence of flux behaviour in a printed coil

Summary Being a subject of expectedly fuzzy character, an attempt is made to apply fuzzy functions, more precisely fuzzy relations to investigate the problem of flux distortion in a printed coil.

---

Zusammenfassung Da die Vorgänge in einer gedruckten Spule sich aus einer Vielzahl schwerer erfaßbarer Einzeleinflüsse zusammensetzen, die insbesondere den Magnetfluß verzerren, lag es nahe, den Versuch zu machen, die Fuzzy Functions (die logische Algebra, gemäß [1]) darauf anzuwenden. Die Fuzzy Functions sind gedacht für das Beschreiben von Vorgängen, oder Ereignissen, die im Ansatz ein breit gefächertes (fuzzy) Verhalten, ohne scharfe Grenzen aufweisen; siehe Fig. 4.Dieser gefächerten logischen Funktion entspricht eine reguläre mathematische Kurvenschar, die meßtechnisch nachgewiesen werden muß.Im vorliegenden Falle ergab sich eine Korrekturfunktion (5), die es gestattet, die Induktivität gedruckter Spulen, in einem weiten Bereich von Abmessungen und Windungen, mit einer Genauigkeit von –2% bis +5% zu bestimmen.