Aurifeuillian factorization

The Cunningham project seeks to factor numbers of the form bn±1 with b = 2, 3, . . . small. One of the most useful techniques is Aurifeuillian Factorization whereby such a number is partially factored by replacing bn by a polynomial in such a way that polynomial factorization is possible. For example, by substituting y = 2k into the polynomial factorization (2y2)2+1 = (2y2−2y+1)(2y2+2y+1) we can partially factor 24k+2+1. In 1962 Schinzel gave a list of such identities that have proved useful in the Cunningham project; we believe that Schinzel identified all numbers that can be factored by such identities and we prove this if one accepts our definition of what “such an identity” is. We then develop our theme to similarly factor f(bn) for any given polynomial f, using deep results of Faltings from algebraic geometry and Fried from the classification of finite simple groups.

Young children's understanding of oddity: reducing complexity by simple oddity and "most different" strategies

Children aged between 3 and 7 years were taught simple and dimension-abstracted oddity discrimination using learning-set training techniques, in which isomorphic problems with varying content were presented with verbal explanation and feedback. Following the training phase, simple oddity (SO), dimension-abstracted oddity with one or two irrelevant dimensions, and non-oddity (NO) tasks were presented (without feedback) to determine the basis of solution. Although dimension-abstracted oddity requires discrimination based on a stimulus that is different from the others, which are all the same as each other on the relevant dimension, this was not the major strategy. The data were more consistent with use of a simple oddity strategy by 3- to 4-year-olds, and a most different strategy by 6- to 7-year-olds. These strategies are interpreted as reducing task complexity. (C) 2002 Elsevier Science Inc. All rights reserved.

More maximal arcs in Desarguesian projective planes and their geometric structure

In a previous paper R. Mathon gave a new construction method for maximal arcs in finite Desarguesian projective planes via closed sets of conics, as well as giving many new examples of maximal arcs. In the current paper, new classes of maximal arcs are constructed, and it is shown that every maximal arc so constructed gives rise to an infinite class of maximal arcs. Apart from when they are of Denniston type or dual hyperovals, closed sets of conics are shown to give maximal arcs that are not isomorphic to the known constructions. An easy characterisation of when a closed set of conics is of Denniston type is given. Results on the geometric structure of the maximal arcs and their duals are proved, as well as on elements of their collineation stabilisers.

Cube factorizations of complete graphs

A cube factorization of the complete graph on n vertices, K-n, is a 3-factorization of & in which the components of each factor are cubes. We show that there exists a cube factorization of & if and only if n equivalent to 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. (C) 2004 Wiley Periodicals, Inc.

Existence and embeddings of partial Steiner triple systems of order ten with cubic leaves

Denote the set of 21 non-isomorphic cubic graphs of order 10 by L. We first determine precisely which L is an element of L occur as the leave of a partial Steiner triple system, thus settling the existence problem for partial Steiner triple systems of order 10 with cubic leaves. Then we settle the embedding problem for partial Steiner triple systems with leaves L is an element of L. This second result is obtained as a corollary of a more general result which gives, for each integer v greater than or equal to 10 and each L is an element of L, necessary and sufficient conditions for the existence of a partial Steiner triple system of order v with leave consisting of the complement of L and v - 10 isolated vertices. (C) 2004 Elsevier B.V. All rights reserved.

On a generalization of the Oberwolfach problem

Let e(1),e(2),... e(n) be a sequence of nonnegative integers Such that the first non-zero term is not one. Let Sigma(i=1)(n) e(i) = (q - 1)/2, where q = p(n) and p is an odd prime. We prove that the complete graph on q vertices can be decomposed into e(1) C-pn-factors, e(2) C-pn (1)-factors,..., and e(n) C-p-factors. (C) 2004 Elsevier Inc. All rights reserved.

The extended metamorphosis of a complete bipartite design into a cycle system

A K-t,K-t-design of order n is an edge-disjoint decomposition of K-n into copies of K-t,K-t. When t is odd, an extended metamorphosis of a K-t,K-t-design of order n into a 2t-cycle system of order n is obtained by taking (t - 1)/2 edge-disjoint cycles of length 2t from each K-t,K-t block, and rearranging all the remaining 1-factors in each K-t,K-t block into further 2t-cycles. The 'extended' refers to the fact that as many subgraphs isomorphic to a 2t-cycle as possible are removed from each K-t,K-t block, rather than merely one subgraph. In this paper an extended metamorphosis of a K-t,K-t-design of order congruent to 1 (mod 4t(2)) into a 2t-cycle system of the same order is given for all odd t > 3. A metamorphosis of a 2-fold K-t,K-t-design of any order congruent to 1 (mod 4t(2)) into a 2t-cycle system of the same order is also given, for all odd t > 3. (The case t = 3 appeared in Ars Combin. 64 (2002) 65-80.) When t is even, the graph K-t,K-t is easily seen to contain t/2 edge-disjoint cycles of length 2t, and so the metamorphosis in that case is straightforward. (C) 2004 Elsevier B.V. All rights reserved.

The philosophical significance of Cox's theorem

Cox's theorem states that, under certain assumptions, any measure of belief is isomorphic to a probability measure. This theorem, although intended as a justification of the subjectivist interpretation of probability theory, is sometimes presented as an argument for more controversial theses. Of particular interest is the thesis that the only coherent means of representing uncertainty is via the probability calculus. In this paper I examine the logical assumptions of Cox's theorem and I show how these impinge on the philosophical conclusions thought to be supported by the theorem. I show that the more controversial thesis is not supported by Cox's theorem. (C) 2003 Elsevier Inc. All rights reserved.

Existence of complementary pairs of proportionally balanced designs

Proportionally balanced designs (pi BDs) 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. Subsequent papers extended the theoretical results relating to such designs and provided further instances and general constructions. This work focused on designs comprising blocks of precisely two sizes, and when each variety occurs with one of precisely two possible frequencies. Two designs based on the set V of varieties are complementary if, whenever B is a block of one, then its complement with regard to the set V is a block of the other. Here we present necessary conditions for the existence of complementary pairs of such pi BDs and provide lists of some restricted parameter sets satisfying these necessary conditions. The lists are arranged according to the number of blocks. We demonstrate that not all of these parameter sets give rise to designs. However we establish by construction of the sets of blocks that, for every feasible number of blocks less than or equal to 100, with the possible exception of 63, there exists at least one pair of complementary pi BDs. We also investigate the conditions under which the complementary design can be isomorphic to the original design, and again provide a list of feasible parameters for pairs of such designs with at most 400 blocks.

Certain Roman and flock generalized quadrangles have nonisomorphic elation groups

We prove that the elation groups of a certain infinite family of Roman generalized quadrangles are not isomorphic to those of associated flock generalized quadrangles.

Alpha-selenoconotoxins, a new class of potent alpha(7) neuronal nicotinic receptor antagonists

Disulfide bonds are important structural motifs that play an essential role in maintaining the conformational stability of many bioactive peptides. Of particular importance are the conotoxins, which selectively target a wide range of ion channels that are implicated in numerous disease states. Despite the enormous potential of conotoxins as therapeutics, their multiple disulfide bond frameworks are inherently unstable under reducing conditions. Reduction or scrambling by thiol-containing molecules such as glutathione or serum albumin in intracellular or extracellular environments such as blood plasma can decrease their effectiveness as drugs. To address this issue, we describe a new class of selenoconotoxins where cysteine residues are replaced by selenocysteine to form isosteric and non-reducible diselenide bonds. Three isoforms of alpha-conotoxin ImI were synthesized by t-butoxycarbonyl chemistry with systematic replacement of one([ Sec(2,8)] ImI or [Sec(3,12)] ImI), or both([Sec(2,3,8,12)] ImI) disulfide bonds with a diselenide bond. Each analogue demonstrated remarkable stability to reduction or scrambling under a range of chemical and biological reducing conditions. Three-dimensional structural characterization by NMR and CD spectroscopy indicates conformational preferences that are very similar to those of native ImI, suggesting fully isomorphic structures. Additionally, full bioactivity was retained at the alpha(7) nicotinic acetylcholine receptor, with each seleno-analogue exhibiting a dose-response curve that overlaps with wild-type ImI, thus further supporting an isomorphic structure. These results demonstrate that selenoconotoxins can be used as highly stable scaffolds for the design of new drugs.

Computing with elation groups

We have proved that elation groups of a certain infinite family of Roman generalized quadrangles are not isomorphic to those of associated flock generalized quadrangles. The proof is theoretical, but is based upon detailed computations. Here we elaborate on the explicit computer calculations which inspired the proof.