The theory of integer λ-labellings of a graph, introduced by Griggs and Yeh, seeks to model efficient channel assignments for a network of transmitters. To prevent interference, labels for nearby vertices must be separated by specified amounts ki depending on the distance i, 1 ≤ i ≤ p. Here we expand the model to allow real number labels and separations. The main finding (“D-set Theorem”) is th...

Acknowledgements I am undoubtedly indebted to my two supervisors, Alf van der Poorten and Hugh Williams. Most students would feel lucky to have one good supervisor whereas I had the privilege of having two excellent mathematicians to guide me. Their help, wisdom and infinite patience has been invaluable, and I am very grateful for it. The Mathematics Department at Macquarie University has provi...

We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance between transmitters, are avoided by sufficiently separating the channels. The goal is to find assignments that minimize the span of the labels used. A previous paper of the authors introduced a model for this problem using...

A rational positive-definite quadratic form is perfect if it can be reconstructed from the knowledge of its minimal nonzero value m and the finite set of integral vectors v such that f(v) = m. This concept was introduced by Voronöı and later generalized by Koecher to arbitrary number fields. One knows that up to a natural “change of variables” equivalence, there are only finitely many perfect f...

We present the different constructive definitions of real number that can be found in the literature. Using domain theory we analyse the notion of computability that is substantiated by these definitions and we give a definition of computability for real numbers and for functions acting on them. This definition of computability turns out to be equivalent to other definitions given in the litera...

Wouldn’t it be nice to be able to conveniently use ordinary real number expressions within proof assistants? In this paper we outline how this can be done within a theorem proving framework. First, we formally establish upper and lower bounds for trigonometric and transcendental functions. Then, based on these bounds, we develop a rational interval arithmetic where real number calculations can ...

Game-playing programs usually evaluate moves by searching the game tree using the minimax principle. Practice shows that deeper searches produce better results. However, theoretical analyses indicate that under apparently reasonable conditions, the behavior of minimax is pathological, i.e. deeper searches produce worse results. In this paper, a minimax model that – unlike most work in this area...

In this paper, as one approach for mathematical analysis of evolutionary algorithms with real number chromosomes, we focus our attention on crossovers, give a general framework of the description for the change of the distribution of the population through them, and verify the properties of crossovers based on the framework. This framework includes various crossover which have been proposed and...