Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K_n, is a 3‐factorization of K_n in which the components of each factor are cubes. We show that there exists a cube factorization of K_n if and only if n ≡ 16 (mod 24), thus providing a new family of uniform 3‐factorizations as well as a partial solution to an open problem posed by Kotzig in 1979. © 2004 Wiley Periodicals, Inc.     

THE ENERGY ASPECT OF THE RECIPROCAL INTERACTIONS OF PAIRS OF TWO DIFFERENT VIBRATION MODES OF A CLAMPED ANNULAR PLATE

The standardized mutual active and reactive sound power of a clamped plate, representing the energy aspect of the reciprocal interactions of two different in vacuo modes, has been computed. It was assumed that the vibrations are axisymmetric, elastic and time harmonic, the plate's transverse deflection is small as compared with the plate's size, and that the vibration velocity is small as compared with the acoustic wavenumber generated. The Kirchhoff-Love theory of a perfectly elastic plate was used. The integral formulae for the mutual sound power were transformed into their Hankel representations which made possible their subsequent computation. A closed path integral was used to express the integral in its Hankel representation to compute the mutual active sound power. The asymptotic stationary phase method was used to compute the two magnitudes, i.e., the mutual active and reactive sound power. The results obtained are the asymptotic formulae valid for the acoustically fast waves. The oscillating as well as the non-oscillating terms have been identified in the formulae to make possible their further separate analysis. The availability of the asymptotic formulae makes possible some fast numerical computations of the mutual sound power. Moreover, the formulae presented herein, together with those for the individual modes known from the literature, make a complete basis for further computations of the total sound power of the plate's damped and forced vibrations in fluid.     

A Generalized Markov Sampler

A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis–Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis.     

The Small Index Property for Free Groups and Relatively Free Groups

1. Some groups with the small index property In this paper we shall use the methods of the paper [6] by Hodges,Hodkinson, Lascar and Shelah to show that the free group ofcountably infinite rank and certain relatively free groups ofcountably infinite rank have the small index property.     

Asymptotic Analysis of a Hyperbolic Mixed Problem in One-Dimensional Viscoelasticity

We present an asymptotic analysis of the boundary-generated, small-amplitude, high-frequency waves in a one-dimensional, semi-infinite, viscoelastic solid characterized by a single-integral constitutive functional. The equations governing the wave motion constitute a 2×2 system of hyperbolic Volterra integrodifferential equations. The method of analysis is based on a single-wave expansion of nonlinear geometric optics.     

Fast 3D shape screening of large chemical databases through alignment-recycling

Background  

Large chemical databases require fast, efficient, and simple ways of looking for similar structures. Although such tasks are now fairly well resolved for graph-based similarity queries, they remain an issue for 3D approaches, particularly for those based on 3D shape overlays. Inspired by a recent technique developed to compare molecular shapes, we designed a hybrid methodology, alignment-recycling, that enables efficient retrieval and alignment of structures with similar 3D shapes.     

Decomposing the complete graph into cycles of many lengths

For all oddv 3 the complete graph onvK _v vertices can be decomposed intov – 2 edge disjoint cycles whose lengths are 3, 3, 4, 5,...,v – 1. Also, for all oddv 7,K _v can be decomposed intov – 3 edge disjoint cycles whose lengths are 3, 4,...,v – 4,v – 2,v – 1,v. Research supported by Australian Research Council grant A49130102