Analytic calculation of scaling dimensions: Tricritical hard squares and critical hard hexagons

The finite-size corrections, central chargesc, and scaling dimensionsx of tricritical hard squares and critical hard hexagons are calculated analytically. This is achieved by solving the special functional equation or inversion identity satisfied by the commuting row transfer matrices of these lattice models at criticality. The results are expressed in terms of Rogers dilogarithms. For tricritical hard squares we obtainc=7/10,x=3/40, 1/5, 7/8, 6/5 and for hard hexagons we obtainc=4/5,x=2/15, 4/5, 17/15, 4/3, 9/5, in accord with the predictions of conformal and modular invariance.     

Krichever-Novikov global operator formalism: NSR superstring in curved background

The Neveu-Schwarz-Ramond type II closed superstring is considered to evolve in a curved space-time manifold. The Krichever-Novikov global operator formalism is used to construct the generators of a super-conformal algebra on a Riemann surface . The computation for the quantum algebra of these generators is explicitly presented. It is shown that the theory is free from super-conformal anomalies if the target manifold is ten dimensional and satisfies the Ricci flatness condition.     

Wave propagation in a piezoelectric human bone of arbitrary cross section with a circular cylindrical cavity

A theoretical study of wave propagation in a piezoelectric cylinder of infinite length of arbitrary cross section with a circular cylindrical cavity of class 6 is investigated. The frequency equations are obtained by using the Fourier expansion collocation method and are analyzed numerically. The frequencies are evaluated for circular, elliptic, and cardioidal sections of bone and are tabulated. A plot of frequency spectrum is also presented for the cardioidal cross-section bar.     

Half-life of41Ca

The half-life of⁴¹Ca has been redetermined to be (1.01 ±0.10)×10⁵ yr from the specific activity of a sample of enriched calcium material and its⁴¹Ca concentration. The activity was measured with a Si(Li) detector via the 3.3-keV X rays emitted in the electron capture decay of⁴¹Ca to⁴¹K. The⁴¹Ca concentration was measured by mass spectrometry. Since our result agrees well with the two most recent half-life measurements of Mabuchi et al. (1974), (1.13±0.12)×10⁵ yr, and Klein et al. (1990), (1.03±0.07)×10⁵ yr, we recommend the weighted mean of these three measurements, t_1/2=(1.04±0.05)×10⁵ yr, as the most accurate value of the half-life of⁴¹Ca.Dedicated to Prof. Dr. P. Kienle on the occasion of his 60th birthday     

On the spectral picture of an irreducible subnormal operator II

In this paper we show that the spectral picture of an irreducible subnormal operator may be arbitrarily prescribed subject only to certain natural necessary conditions. This completes work begun by the second author.

     

The Orevkov invariant of an affine plane curve

We show that although the fundamental group of the complement of an algebraic affine plane curve is not easy to compute, it possesses a more accessible quotient, which we call the Orevkov invariant.

     

A short note on the generalized Euler transform for the summation of power series

Applying the generalized Euler transform to the firstn partial sums of a power series results in a triangular array whose inferior diagonal givesn approximate values of the sum of this series. The aim of this short note is to estimate the best of thesen values and to compare it with the actual best one for a collection of test series.     

Efficient parallel algorithms for shortest paths in planar digraphs

Efficient parallel algorithms are presented, on the CREW PRAM model, for generating a succinct encoding of all pairs shortest path information in a directed planar graphG with real-valued edge costs but no negative cycles. We assume that a planar embedding ofG is given, together with a set ofq faces that cover all the vertices. Then our algorithm runs inO(log² n) time and employsO(nq+M(q)) processors (whereM(t) is the number of processors required to multiply twot×t matrices inO(logt) time). Let us note here that wheneverq<n then our processor bound is better than the best previous one (M(n)).O(log² n) time,n-processor algorithms are presented for various subproblems, including that of generating all pairs shortest path information in a directedouterplanar graph. Our work is based on the fundamental hammock-decomposition technique of G. Frederickson. We achieve this decomposition inO(logn log*n) parallel time by usingO(n) processors. The hammock-decomposition seems to be a fundamental operation that may help in improving efficiency of many parallel (and sequential) graph algorithms.This work was partially supported by the EEC ESPRIT Basic Research Action No. 3075 (ALCOM) and by the Ministry of Industry, Energy and Technology of Greece.