A computational algorithm for the verification of tautologies in propositional calculus

A computational algorithm (based on Smullyan's analytic tableau method) that varifies whether a given well-formed formula in propositional calculus is a tautology or not has been implemented on a DEC system 10. The stepwise refinement approch of program development used for this implementation forms the subject matter of this paper. The top-down design has resulted in a modular and reliable program package. This computational algoritlhm compares favourably with the algorithm based on the well-known resolution principle used in theorem provers.

Resonances, scattering theory, and rigged Hilbert spaces

The problem of decaying states and resonances is examined within the framework of scattering theory in a rigged Hilbert space formalism. The stationary free,''in,'' and ''out'' eigenvectors of formal scattering theory, which have a rigorous setting in rigged Hilbert space, are considered to be analytic functions of the energy eigenvalue. The value of these analytic functions at any point of regularity, real or complex, is an eigenvector with eigenvalue equal to the position of the point. The poles of the eigenvector families give origin to other eigenvectors of the Hamiltonian: the singularities of the ''out'' eigenvector family are the same as those of the continued S matrix, so that resonances are seen as eigenvectors of the Hamiltonian with eigenvalue equal to their location in the complex energy plane. Cauchy theorem then provides for expansions in terms of ''complete'' sets of eigenvectors with complex eigenvalues of the Hamiltonian. Applying such expansions to the survival amplitude of a decaying state, one finds that resonances give discrete contributions with purely exponential time behavior; the background is of course present, but explicitly separated. The resolvent of the Hamiltonian, restricted to the nuclear space appearing in the rigged Hilbert space, can be continued across the absolutely continuous spectrum; the singularities of the continuation are the same as those of the ''out'' eigenvectors. The free, ''in'' and ''out'' eigenvectors with complex eigenvalues and those corresponding to resonances can be approximated by physical vectors in the Hilbert space, as plane waves can. The need for having some further physical information in addition to the specification of the total Hamiltonian is apparent in the proposed framework. The formalism is applied to the Lee–Friedrichs model and to the scattering of a spinless particle by a local central potential. Journal of Mathematical Physics is copyrighted by The American Institute of Physics.

Generalized pencils of rays in statistical wave optics

The recently introduced generalized pencil of Sudarshan which gives an exact ray picture of wave optics is analysed in some situations of interest to wave optics. A relationship between ray dispersion and statistical inhomogeneity of the field is obtained. A paraxial approximation which preserves the rectilinear propagation character of the generalized pencils is presented. Under this approximation the pencils can be computed directly from the field conditions on a plane, without the necessity to compute the cross-spectral density function in the entire space as an intermediate quantity. The paraxial results are illustrated with examples. The pencils are shown to exhibit an interesting scaling behaviour in the far-zone. This scaling leads to a natural generalization of the Fraunhofer range criterion and of the classical van Cittert-Zernike theorem to planar sources of arbitrary state of coherence. The recently derived results of radiometry with partially coherent sources are shown to be simple consequences of this scaling.

Vertical uplift capacity of two interfering horizontal anchors in sand using an upper bound limit analysis

The vertical uplift resistance of two interfering rigid rough strip anchors embedded horizontally in sand at shallow depths has been examined. The analysis is performed by using an upper bound theorem o limit analysis in combination with finite elements and linear programming. It is specified that both the anchors are loaded to failure simultaneously at the same magnitude of the failure load. For different clear spacing (S) between the anchors, the magnitude of the efficiency factor (xi(gamma)) is determined. On account of interference, the magnitude of xi(gamma) is found to reduce continuously with a decrease in the spacing between the anchors. The results from the numerical analysis were found to compare reasonably well with the available theoretical data from the literature.

On the Arrangement of Cliques in Chordal Graphs with respect to the Cuts

A cut (A, B) (where B = V - A) in a graph G = (V, E) is called internal if and only if there exists a vertex x in A that is not adjacent to any vertex in B and there exists a vertex y is an element of B such that it is not adjacent to any vertex in A. In this paper, we present a theorem regarding the arrangement of cliques in a chordal graph with respect to its internal cuts. Our main result is that given any internal cut (A, B) in a chordal graph G, there exists a clique with kappa(G) + vertices (where kappa(G) is the vertex connectivity of G) such that it is (approximately) bisected by the cut (A, B). In fact we give a stronger result: For any internal cut (A, B) of a chordal graph, and for each i, 0 <= i <= kappa(G) + 1 such that vertical bar K-i vertical bar = kappa(G) + 1, vertical bar A boolean AND K-i vertical bar = i and vertical bar B boolean AND K-i vertical bar = kappa(G) + 1 - i. An immediate corollary of the above result is that the number of edges in any internal cut (of a chordal graph) should be Omega(k(2)), where kappa(G) = k. Prompted by this observation, we investigate the size of internal cuts in terms of the vertex connectivity of the chordal graphs. As a corollary, we show that in chordal graphs, if the edge connectivity is strictly less than the minimum degree, then the size of the mincut is at least kappa(G)(kappa(G)+1)/2 where kappa(G) denotes the vertex connectivity. In contrast, in a general graph the size of the mincut can be equal to kappa(G). This result is tight.

Foldable compatibility matrix for the folding of programmable logic arrays

This paper describes a switching theoretic algorithm for the folding of programmable logic arrays (PLA). The algorithm is valid for both column and row folding, although it has been presented considering only the simple column folding. The pairwise compatibility relations among all the pairs of the columns of the PLA are mapped into a square matrix, called the compatibility matrix of the PLA. A foldable compatibility matrix (FCM), a new concept introduced by the author, is then derived from the compatibility matrix. A new theorem called the folding theorem is then proved. The theorem states that the existence of an m by 2m FCM is both necessary and sufficient to fold 2m columns of the n column PLA (2m ≤ n). Once an FCM is obtained, the ordered pairs of foldable columns and the re-ordering of the rows are readily determined.

Stresses around two equal circular elastic inclusions in a pressurised cylindrical shell

The stress problem of two equal circular elastic inclusions in a pressurised cylindrical shell has been solved by using single inclusion solutions together with Graf’s addition theorem. The effect of the inter-inclusion distance on the interface stresses in the shell as well as in the inclusion is studied. The results obtained for small values of curvature parameter fi @*=(a*/8Rt) [12(1-v*)]“*, a, R, t being inclusion radius and shell radius and thickness) when compared with the flat-plate results show good agreement. The results obtained in non-dimensional form are presented graphically.

Improvement On Brooks Chromatic Bound For A Class Of Graphs

Brooks' Theorem says that if for a graph G,Δ(G)=n, then G is n-colourable, unless (1) n=2 and G has an odd cycle as a component, or (2) n>2 and Kn+1 is a component of G. In this paper we prove that if a graph G has none of some three graphs (K1,3;K5−e and H) as an induced subgraph and if Δ(G)greater-or-equal, slanted6 and d(G)<Δ(G), then χ(G)<Δ(G). Also we give examples to show that the hypothesis Δ(G)greater-or-equal, slanted6 can not be non-trivially relaxed and the graph K5−e can not be removed from the hypothesis. Moreover, for a graph G with none of K1,3;K5−e and H as an induced subgraph, we verify Borodin and Kostochka's conjecture that if for a graph G,Δ(G)greater-or-equal, slanted9 and d(G)<Δ(G), then χ(G)<Δ(G).

The dynamic stability of degenerate systems under parametric excitation

The parametric resonance in a system having two modes of the same frequency is studied. The simultaneous occurence of the instabilities of the first and second kind is examined, by using a generalized perturbation procedure. The region of instability in the first approximation is obtained by using the Sturm's theorem for the roots of a polynomial equation.

Formal description, compression and transformation of digital pictures

This paper describes the application of vector spaces over Galois fields, for obtaining a formal description of a picture in the form of a very compact, non-redundant, unique syntactic code. Two different methods of encoding are described. Both these methods consist in identifying the given picture as a matrix (called picture matrix) over a finite field. In the first method, the eigenvalues and eigenvectors of this matrix are obtained. The eigenvector expansion theorem is then used to reconstruct the original matrix. If several of the eigenvalues happen to be zero this scheme results in a considerable compression. In the second method, the picture matrix is reduced to a primitive diagonal form (Hermite canonical form) by elementary row and column transformations. These sequences of elementary transformations constitute a unique and unambiguous syntactic code-called Hermite code—for reconstructing the picture from the primitive diagonal matrix. A good compression of the picture results, if the rank of the matrix is considerably lower than its order. An important aspect of this code is that it preserves the neighbourhood relations in the picture and the primitive remains invariant under translation, rotation, reflection, enlargement and replication. It is also possible to derive the codes for these transformed pictures from the Hermite code of the original picture by simple algebraic manipulation. This code will find extensive applications in picture compression, storage, retrieval, transmission and in designing pattern recognition and artificial intelligence systems.

Orbital diamagnetism of a charged Brownian particle undergoing a birth-death process

Considers the magnetic response of a charged Brownian particle undergoing a stochastic birth-death process. The latter simulates the electron-hole pair production and recombination in semiconductors. The authors obtain non-zero, orbital diamagnetism which can be large without violating the Van Leeuwen theorem (1921).

The Hamilton-Jacobi equation revisited

A new analysis of the nature of the solutions of the Hamilton-Jacobi equation of classical dynamics is presented based on Caratheodory’s theorem concerning canonical transformations. The special role of a principal set of solutions is stressed, and the existence of analogous results in quantum mechanics is outlined.

Characteristics of Proportional Weirs

A theorem termed the Geometrical Continuity Theorem is enunciated and proven. This theorem throws light on the aspects of the continuity of the proportional portion with the base weir portion. These two portions constitute the profile of a proportional weir. A weir of this type with circular bottom is designed. The theorem is used to establish the continuity at the junction of the proportional and the base weir portions of this weir. The coordinates of the weir profile are obtained by numerical methods and are furnished in tabular form for ready use by designers. The discharge passing through the weir is a linear function of the head. The verification of the assumed linear discharge-head relation is furnished for one of the three weirs with which experiments were conducted. The coefficient of discharge for this typical weir is found to be a constant with a value of 0.59.

Stability of large flexible damped spacecraft modeled as elastic continua

Vibrational stability of a large flexible, structurally damped spacecraft subject to large rigid body rotations is analysed modelling the system as an elastic continuum. Using solution of rigid body attitude motion under torque free conditions and modal analysis, the vibrational equations are reduced to ordinary differential equations with time-varying coefficients. Stability analysis is carried out using Floquet theory and Sonin-Polya theorem. The cases of spinning and non-spinning spacecraft idealized as a flexible beam plate undergoing simple structural vibration are analysed in detail. The critical damping required for stabilization is shown to be a function of the spacecraft's inertia ratio and the level of disturbance.

The Electronic Structure of Graphite from Compton Profile Measurements

Compton profile data are used to investigate the ground state wavefunction of graphite. The results of two new $\gamma$-ray measurements are reported and compared with the results of earlier $\gamma$-ray and electron scattering measurements. A tight-binding calculation has been carried out and the results of earlier calculations based on a molecular model and a pseudo-potential wavefunction are considered. The analysis, in terms of the reciprocal form factor, shows that none of the calculations gives an adequate description of the data in the basal plane although the pseudo-potential calculation describes the anisotropy in the plane reasonably well. In the basal plane the zero-crossing theorem appears to be violated and this problem must be resolved before more accurate models can be derived. In the c-axis direction the molecular model and the tight binding calculation give better agreement with the experimental data than does the pseudopotential calculation.