On the problem of algebraic completeness for the invariants of the Riemann Tensor: I

We present a new determining set, CZ, of Riemann invariants which possesses the minimum degree property. From an analysis on the possible independence of CZ, we are led to the division of all space-times into two distinct, invariantly characterized, classes: a general class M_G+, and a special, singular class M_S For each class, we provide an independent set of invariants (I_G+) ⊂ CZ and I_S ⊂ CZ, respectively) which, with the results of a sequel paper, will be shown to be algebraically complete.

On the problem of algebraic completeness for the invariants of the Riemann tensor. III.

We study the set CZ of invariants [Zakhary and Carminati, J. Math. Phys. 42, 1474 (2001)] for the class of space-times whose Ricci tensors possess a null eigenvector. We show that all cases are maximally backsolvable, in terms of sets of invariants from CZ, but that some cases are not completely backsolvable and these all possess an alignment between an eigenvector of the Ricci tensor with a repeated principal null vector of the Weyl tensor. We provide algebraically complete sets for each canonically different space-time and hence conclude with these results and those of a previous article [Carminati, Zakhary, and McLenaghan, J. Math. Phys. 43, 492 (2002)] that the CZ set is determining or maximal.

A comparative study of some computer algebra packages which determine the lie point symmetries of differential equations

The study seeks to determine which of five computer algebra packages is best at finding the Lie point symmetries of systems of partial differential equations with minimal user intervention. The chosen packages are LIEPDE and DIMSYM for REDUCE, LIE and BIGLIE for MUMATH, DESOLV for MAPLE, and MATHLIE for MATHEMATICA. A series of systems of partial differential equations are used in the study. The paper concludes that while all of the computer packages are useful, DESOLV appears to be the most successful system at determining the complete set of Lie point symmetries of systems of partial differential equations.

The determination of all syzygies for the dependent polynomial invariants of the Riemann tensor. I. Pure Ricci and pure Weyl invariants

In this paper, we shall consider all pure Ricci and pure Weyl scalar invariants of any degree, in a four-dimensional Lorentzian space. We present a general graph-theoretic based reduction algorithm which decomposes, using syzygies, any pure invariant in terms of the independent base invariants {r₁,r₂,r₃} or {w₁,w₂}

The determination of all syzygies for the dependent polynomial invariants of the Riemann Tensor. II. mixed invariants of Eeven degree in the Ricci Spinor

We continue our analysis of the polynomial invariants of the Riemann tensor in a four-dimensional Lorentzian space. We concentrate on the mixed invariants of even degree in the Ricci spinor Φ_ABȦḂ and show how, using constructive graph-theoretic methods, arbitrary scalar contractions between copies of the Weyl spinor ψ_ABCD, its conjugate ψ_ȦḂĊḊ and an even number of Ricci spinors can be expressed in terms of paired contractions between these spinors. This leads to an algorithm for the explicit expression of dependent invariants as polynomials of members of the complete set. Finally, we rigorously prove that the complete set as given by Sneddon [J. Math. Phys. 39, 1659-1679 (1998)] for this case is both complete and minimal.

Determination of all syzygies for the dependent polynomial invariants of the Riemann Tensor. III. mixed invariants of arbitrary degree in the Ricci Spinor

In this paper, we rigorously prove that the complete set of Riemann tensor invariants given by Sneddon [J. Math. Phys. 40, 5905 (1999)] is both minimal and complete. Furthermore, we provide a two-stage algorithm for the explicit construction of polynomial syzygies relating any dependent Riemann tensor invariant to members of the complete set.

Similarity solutions of partial differential equations using DESOLV

We present and describe new reduction routines included in DESOLV which, in many cases, may allow the complete automation of the determination of similarity solutions of partial differential equations.

Fractional polynomials and model selection in generalized estimating equations analysis, with an application to a longitudinal epidemiologic study in Australia

In epidemiologic studies, researchers often need to establish a nonlinear exposure-response relation between a continuous risk factor and a health outcome. Furthermore, periodic interviews are often conducted to take repeated measurements from an individual. The authors proposed to use fractional polynomial models to jointly analyze the effects of 2 continuous risk factors on a health outcome. This method was applied to an analysis of the effects of age and cumulative fluoride exposure on forced vital capacity in a longitudinal study of lung function carried out among aluminum workers in Australia (1995-2003). Generalized estimating equations and the quasi-likelihood under the independence model criterion were used. The authors found that the second-degree fractional polynomial models for age and fluoride fitted the data best. The best model for age was robust across different models for fluoride, and the best model for fluoride was also robust. No evidence was found to suggest that the effects of smoking and cumulative fluoride exposure on change in forced vital capacity over time were significant. The trend 1 model, which included the unexposed persons in the analysis of trend in forced vital capacity over tertiles of fluoride exposure, did not fit the data well, and caution should be exercised when this method is used.

On the problem of algebraic completeness for the invariants of the Riemann tensor. II

We study the set of invariants CZ [E. Zakhary and J. Carminati, J. Math. Phys. 42, 1474 (2001)] for the class of space-times whose Ricci tensors do not possess a null eigenvector. We show that all cases are completely backsolvable in terms of sets of invariants from CZ. We provide algebraically complete sets for each canonically different space-time.

Application of the Hottel-Whillier equations to the analysis of a building integrated photovoltaic/thermal solar collector

The idea of combining photovoltaic and solar thermal collectors (PVT collectors) to provide electrical and heat energy is not new, however it is an area that has received only limited attention. With concern growing over energy sources and their usage, PVTs have become an area receiving more attention. Although PVTs are not as prevalent as solar thermal systems, the integration of photovoltaic and solar thermal collectors into the walls or roofing structure of a building could provide greater opportunity for the use of renewable solar energy technologies in domestic, commercial and industrial applications. As such, the design of a novel building integrated photovoltaic/thermal (BIPVT) solar collector is theoretically analysed through the use of a modified Hottel-Whillier model. The thermal and electrical efficiency under a range of conditions are subsequently determined and results showing how key design parameters influence the performance of the BIPVT system are presented.

Lie symmetries of partial differential equations using symbolic computing

This study presents a theoretical basis for and outlines the method of finding the Lie point symmetries of systems of partial differential equations. It seeks to determine which of five computer algebra packages is best at finding these symmetries. The chosen packages are LIEPDE and DIMSYM for REDUCE, LIE and BIGLIE for MUMATH, DESOLV for MAPLE, and MATHLIE for MATHEMATICA. This work concludes that while all of the computer packages are useful, DESOLV appears to be the most successful system at determining the complete set of Lie symmetries. Also, the study describes REDUCEVAR, a new package for MAPLE, that reduces the number of independent variables in systems of partial differential equations, using particular Lie point symmetries. It outlines the results of some testing carried out on this package. It concludes that REDUCEVAR is a very useful tool in performing the reduction of independent variables according to Lie's theory and is highly accurate in identifying cases where the symmetries are not suitable for finding S/G equations.

What can student-generated diagrams tell us about their understanding of chemical equations?

Chemical equations are representations that use symbols to summarise the net changes occurring in a reaction whereas depictions such as drawings of the submicroscopic level provide representations of the chemical transformations. While the ability to balance and interpret chemical equations is key to understanding many concepts in chemistry, many undergraduate chemistry students struggle to master these skills. The equations contain a great deal of implicit information and novices may not be able to make the connection between the equation and the actual chemical transformations that are occurring. This paper reports on a study which used submicroscopic diagrams to probe students' understanding of chemical equations. Assessment tasks required students to interpret diagrams, construct diagrams and to relate diagrams to symbolic representations. The analysis showed that some students have misconceptions about the molecular nature and chemical formulae and could not distinguish between coefficients and subscripts when representing chemical formulae. While students were generally able to balance a chemical equation presented as a set of diagrams, a significant number could not generate the balanced equation based on a diagram of the progress of a reaction, The study has demonstrated the use of student-generated diagrams to provide insight into students' understandings of chemical equations.

Syzygies of the polynomial invariants of the Riemann tensor

This thesis introduces a novel way of writing polynomial invariants as network graphs, and applies this diagrammatic notation scheme, in conjunction with graph theory, to derive algorithms for constructing relationships (syzygies) between different invariants. These algorithms give rise to a constructive solution of a longstanding classical problem in invariant theory.