The metamorphosis of lambda-fold 4-wheel systems into lambda-fold 4-cycle systems

A 4-wheel is a simple graph on 5 vertices with 8 edges, formed by taking a 4-cycle and joining a fifth vertex (the centre of the 4-wheel) to each of the other four vertices. A lambda -fold 4-wheel system of order n is an edge-disjoint decomposition of the complete multigraph lambdaK(n) into 4-wheels. Here, with five isolated possible exceptions when lambda = 2, we give necessary and sufficient conditions for a lambda -fold 4-wheel system of order n to be transformed into a lambda -fold Ccyde system of order n by removing the centre vertex from each 4-wheel, and its four adjacent edges (retaining the 4-cycle wheel rim), and reassembling these edges adjacent to wheel centres into 4-cycles.

Star decompositions of cubes

Let Sk denote the complete bipartite graph K-1k and let e,, denote the ii-cube. We prove that the obvious necessary conditions for the existence of an S-k-decomposition of Q(n) are sufficient.

A new integrable model of strongly correlated electrons with Hubbard-like interaction

A new completely integrable model of strongly correlated electrons is proposed which describes two competitive interactions: one is the correlated one-particle hopping, the other is the Hubbard-like interaction. The integrability follows from the fact that the Hamiltonian is derivable from a one-parameter family of commuting transfer matrices. The Bethe ansatz equations are derived by algebraic Bethe ansatz method.

On single laws for varieties of quasigroups associated with extended cycle systems

It has been previously shown by Lindner and Rodger that quasigroups associated with 2-perfect extended m-cycle systems can be equationally defined if and only if m is an element of {3, 5, 7}. In this paper we present a single identity for each such m which is equivalent to the identities given for these varieties.

Proportionally balanced designs: Some further results and general constructions

Proportionally balanced designs were introduced by Gray and Matters in response to a need for the allocation of markers of the Queensland Core Skills Test to have a certain property. Put simply, markers were allocated to pairs of units in proportions that reflected the relative numbers of markers allocated in total to each unit. In this paper, the first author extends the theoretical results relating to such designs and provides further instances, and two general constructions, in the case that the design comprises blocks of precisely two sizes.

Should optional properties be used in conceptual modelling? A theory and three empirical tests

An important feature of some conceptual modelling grammars is the features they provide to allow database designers to show real-world things may or may not possess a particular attribute or relationship. In the entity-relationship model, for example, the fact that a thing may not possess an attribute can be represented by using a special symbol to indicate that the attribute is optional. Similarly, the fact that a thing may or may not be involved in a relationship can be represented by showing the minimum cardinality of the relationship as zero. Whether these practices should be followed, however, is a contentious issue. An alternative approach is to eliminate optional attributes and relationships from conceptual schema diagrams by using subtypes that have only mandatory attributes and relationships. In this paper, we first present a theory that led us to predict that optional attributes and relationships should be used in conceptual schema diagrams only when users of the diagrams require a surface-level understanding of the domain being represented by the diagrams. When users require a deep-level understanding, however, optional attributes and relationships should not be used because they undermine users' abilities to grasp important domain semantics. We describe three experiments which we then undertook to test our predictions. The results of the experiments support our predictions.

Changes in conceptions of learning for indigenous Australian university students

Background. Conceptions of learning have been investigated for students in higher. education in different countries. Some studies found that students' conceptions change and develop over time while others have found no changes. Investigating conceptions of learning for Australian Aboriginal and Torres Strait Islander university students is a relatively new area of research. Aims. This study set out to investigate conceptions of learning for Aboriginal and Torres Strait Islander university students during the first two years of their undergraduate degree courses in three Australian universities. Conceptions for each year were compared. Knowing, more about learning as conceived by this cultural group may facilitate more productive higher educational experiences. Sample. The sample comprised 17 students studying various degrees; Il were male and 6 were female. Ages ranged from 18 to 48 years; mean age was 26 years. Method. This was a phenomenographic, longitudinal study. Individual semistructured interviews were conducted each year to ascertain students' conceptions of learning. Conceptions for second year were derived independently of those From first year. A comparative analysis then took place to determine ally changes. Results. These students held conceptions of learning that were similar to those of other university students; however there were some intrinsic differences. On a group level, conceptions changed somewhat over the two years as did core conceptions reported by some individual students. Some students also exhibited a greater awareness of learning during their second year that resulted in three dimensions of changed awareness. Conclusions. We believe the changed conceptions and awareness resulted from learning at university where there is some need to understand and explain phenomena in relation to theory. This brought about new understandings which allowed students to see their own learning in a relational sense.

Stability of linear difference and differential inclusions

Any given n X n matrix A is shown to be a restriction, to the A-invariant subspace, of a nonnegative N x N matrix B of spectral radius p(B) arbitrarily close to p(A). A difference inclusion x(k+1) is an element of Ax(k), where A is a compact set of matrices, is asymptotically stable if and only if A can be extended to a set B of nonnegative matrices B with \ \B \ \ (1) < 1 or \ \B \ \ (infinity) < 1. Similar results are derived for differential inclusions.

Patch dynamics and metapopulation theory: the case of successional species

We present a mathematical framework that combines extinction-colonization dynamics with the dynamics of patch succession. We draw an analogy between the epidemiological categorization of individuals (infected, susceptible, latent and resistant) and the patch structure of a spatially heterogeneous landscape (occupied-suitable, empty-suitable, occupied-unsuitable and empty-unsuitable). This approach allows one to consider life-history attributes that influence persistence in patchy environments (e.g., longevity, colonization ability) in concert with extrinsic processes (e.g., disturbances, succession) that lead to spatial heterogeneity in patch suitability. It also allows the incorporation of seed banks and other dormant life forms, thus broadening patch occupancy dynamics to include sink habitats. We use the model to investigate how equilibrium patch occupancy is influenced by four critical parameters: colonization rate? extinction rate, disturbance frequency and the rate of habitat succession. This analysis leads to general predictions about how the temporal scaling of patch succession and extinction-colonization dynamics influences long-term persistence. We apply the model to herbaceous, early-successional species that inhabit open patches created by periodic disturbances. We predict the minimum disturbance frequency required far viable management of such species in the Florida scrub ecosystem. (C) 2001 Academic Press.

Smallest weak and smallest totally weak critical sets in the latin squares of order at most seven

A critical set in a latin square of order n is a set of entries in a latin square which can be embedded in precisely one latin square of order n. Also, if any element of the critical set is deleted, the remaining set can be embedded in more than one latin square of order n. In this paper we find smallest weak and smallest totally weak critical sets for all the latin squares of orders six and seven. Moreover, we computationally prove that there is no (totally) weak critical set in the back circulant latin square of order five and we find a totally weak critical set of size seven in the other main class of latin squares of order five.

On the direct product of two weak uniquely completable partial latin squares

In this note we show by counter-example that the direct product of two weak uniquely completable partial latin squares is not necessarily a uniquely completable partial latin square. This counter-example rejects a conjecture by Gower (see [3]) on the direct product of two uniquely completable partial latin squares.