Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups

We examine two criteria for balance of a gain graph, one based on binary cycles and one on circles. The graphs for which each criterion is valid depend on the set of allowed gain groups. The binary cycle test is invalid, except for forests, if any possible gain group has an element of odd order. Assuming all groups are allowed, or all abelian groups, or merely the cyclic group of order 3, we characterize, both constructively and by forbidden minors, the graphs for which the circle test is valid. It turns out that these three classes of groups have the same set of forbidden minors. The exact reason for the importance of the ternary cyclic group is not clear. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Some new results on superimposed codes

A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc.     

Multicyclic polyethers derived from 1,1,1‐tris(4‐hydroxyphenyl)ethane and 2,6‐dihalopyridines

Poly(pyridine ether)s were prepared in two ways: the polycondensation of silylated 1,1,1‐tris(4‐hydroxyphenyl)ethane (THPE) with 2,6‐difluoropyridine (method A) and the polycondensation of free THPE with 2,6‐dichloropyridine (method B). With method A, the THPE/difluoropyridine feed ratio was varied from 1.0:1.0 to 1.0:1.6. Cycles, bicycles, and multicycles were the main reaction products, and crosslinking was never observed. When ideal stoichiometry was used exclusively, multicycles free of functional groups were obtained. These multicycles were detectable in matrix‐assisted laser desorption/ionization time‐of‐flight (MALDI‐TOF) mass spectra up to B₃₈C₇₆ with a mass of approximately 32,000 Da. With method B, the reaction conditions were varied at a fixed feed ratio to achieve an optimum for the preparation of multicyclic polyethers, but because of the lower reactivity of 2,6‐dichloropyridine, a quantitative conversion was not achieved. The reaction products were characterized with MALDI‐TOF mass spectrometry, viscosity measurements, and size exclusion chromatography. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 5725–5735, 2004     

Gray code for derangements

We give a Gray code and constant average time generating algorithm for derangements, i.e., permutations with no fixed points. In our Gray code, each derangement is transformed into its successor either via one or two transpositions or a rotation of three elements. We generalize these results to permutations with number of fixed points bounded between two constants.     

The Covering Radius of Ternary Cyclic Codes with Length up to 25

The covering radius of all ternary cyclic codes of length up to 25 is given. Some of the results were obtained by computer and for others mathematical reasonings were applied. The minimal distances of all codes were recalculated.     

How to Build Robust Shared Control Systems

Previous researchers have designed shared control schemes with a view to minimising the likelihood that participants will conspire to perform an unauthorised act. But, human nature being what it is, systems inevitably fail; so shared control schemes should also be designed so that the police can identify conspirators after the fact. This requirement leads us to search for schemes with sparse access structures. We show how this can be done using ideas from coding theory. In particular, secret sharing schemes based on geometric codes whose dual [n,k,d] codes have d and n as their only nonzero weights are suitable. We determine their access structures and analyse their properties. We have found almost all of them, and established some relations among codes, designs and secret-sharing schemes.     

Codes with a Certain Weight-preserving Transitive Group of Automorphisms

We determine all linear codes C containing the constant code E, for which there is a weight-preserving group of semilinear automorphisms which acts transitively on the set of nontrivial cosets of E in C. Michael Giudici - The author holds an Australian Postdoctoral Fellowship.