Research Article | Open Access

Konstantinos Drakakis, "On Costas Sets and Costas Clouds", *Abstract and Applied Analysis*, vol. 2009, Article ID 467342, 23 pages, 2009. https://doi.org/10.1155/2009/467342

# On Costas Sets and Costas Clouds

**Academic Editor:**John Rassias

#### Abstract

We abstract the definition of the Costas property in the context of a group and study specifically dense Costas sets (named Costas clouds) in groups with the topological property that they are dense in themselves: as a result, we prove the existence of nowhere continuous dense bijections that satisfy the Costas property on , , and , the latter two being based on nonlinear solutions of Cauchy's functional equation, as well as on , , and , which are, in effect, generalized Golomb rulers. We generalize the Welch and Golomb construction methods for Costas arrays to apply on and , and we prove that group isomorphisms on and tensor products of Costas sets result to new Costas sets with respect to an appropriate set of distance vectors. We also give two constructive examples of a nowhere continuous function that satisfies a constrained form of the Costas property (over rational or algebraic displacements only, i.e.), based on the indicator function of a dense subset of .

#### 1. Introduction

Costas arrays are square arrangements of dots and blanks such that there is exactly one dot per row and column (i.e., permutation arrays), and such that no four dots form a parallelogram and no three dots on the same straight line are equidistant. They arose in the 1960s in connection with the development of SONAR/RADAR frequency-hopped waveforms with ideal autocorrelation properties [1, 2] but have been the subject of increasingly intensive mathematical study ever since Professor S. Golomb published in 1984 [3, 4] some algebraic construction techniques (still the only ones available today) based on finite fields. Mathematicians are mainly concerned with the study of properties of Costas arrays but also with the settlement of the question of their existence for all orders, which, despite all efforts, still remains open.

Golomb rulers are 1D analogs of Costas arrays: they are linear arrangements of dots and blanks such that no distance between pairs of dots is repeated. The term “ruler’’ arises from the equivalent visualization as a ruler with markings at the integers, where the dots correspond to those markings that get selected. Golomb rulers are, in fact, older than Costas arrays themselves, originally described as Sidon sets, namely, sets of integers whose pairwise sums are all distinct (a moment's reflection shows that the two definitions are completely equivalent).

A deeper study of the Costas property, which we attempt in this work, reveals that it requires surprisingly little, namely, only an underlying algebraic group structure. After recognizing that some parts of the definition of a Costas array are actually additional, peripheral requirements, imposed for convenience by the nature of the engineering application, but not essential (even for the application itself), we show that Costas arrays and Golomb rulers are essentially instantiations of the same concept/property over different groups.

Though this approach opens the door for the study of “exotic’’ Costas structures on arbitrary algebraic groups (possibly nonAbelian), we restrict our attention almost immediately on groups with the analytic property of being dense in themselves, and in particular the fields , , and . Indeed, Costas arrays tend to be very irregular: large arrays look like “clouds’’ of dots scattered all over (see Figure 1). Similarly, the density of dots in Golomb rulers appears to be very uneven. Naturally, when one contemplates possible generalizations of Costas arrays to these three fields (namely, subsets of , , and with the Costas property, or generalizations of Golomb rulers on , , and ), one's first instinct would most likely dictate that these sets, if they exist at all, will be very irregular.

In a previous work [5] we considered bijections with the Costas property on and , and we arrived at the (perhaps surprising) result that not only such functions exist that are as regular as possible, namely, (infinitely) smooth but also that irregular (e.g., nowhere continuous) examples are nontrivial to come by; indeed, no such example was given there.

In this work, which can be construed as a continuation of [5], albeit independent and self-contained, we prove the existence of dense (within the appropriate set) countable and uncountable Costas sets, taking advantage of discontinuous solutions of Cauchy's integral equation. We also construct explicitly two examples of nowhere continuous Costas bijections, using nowhere continuous indicator functions of dense subsets of the real line as building blocks.

#### 2. Basics—The Costas Property

##### 2.1. Notation

We denote the set of the first integers by , and more generally the set by ; in particular, . The set of algebraic real numbers, namely, those real numbers that can be solutions of polynomials with rational (or, equivalently, integer) coefficients, is denoted by ; note that this set includes not only but also many irrational numbers. For any subset of a group under operation with identity element we set , while, for any , we also set

##### 2.2. Definition

In this section we provide an overview of the Costas property and, at the same time, an appropriate generalization to an arbitrary group; usually the Costas property is defined on [6].

*Definition 2.1. *Let be a group under operation and let . will be called a *left Costas set* in with respect to the *distance vectors subgroup *, or simply a left Costas set if , if and only if
or, equivalently, if and only if
A right Costas set is defined by substituting by . If is Abelian, the two definitions coincide.

*Remark 2.2. *Let be a Cartesian group; then can be represented by points on the plane whose axes represent the points of and , respectively, and its elements are ordered pairs of the form , , . Assuming that has either of the properties that each appears as the first coordinate of a at most once, or that each appears as the second coordinate of a at most once, represents the graph of a function with the Costas property (a Costas function, for short) from (a subset of) to or from (a subset of) to respectively. If both properties hold, the Costas function is injective, hence bijective by an appropriate redefinition of its domain and range.

*Remark 2.3. *The elements of can be considered as vectors (as opposed to scalars) when is a tensor product of groups. In that case can be interpreted geometrically to lie in a -dimensional space, and , to be a shifted version of by in dimension , . In particular, the Costas property forbids the existence of , , such that, for some , , : no four points in can form a “parallelogram’’ (under ), and no three points in can be both on a straight line and equidistant.

*Remark 2.4. *Let be a function; an equivalent definition of the Costas property with respect to is then that
where .

*Remark 2.5. *The usual definition of a Costas bijection uses , , , and , , with the additional requirement that is the graph of a bijection on [1, 2, 6]. Costas arrays are mapped bijectively to Costas permutations using the convention that the th element of the permutation indicates the position of the dot in the th column of the array. Henceforth the terms “Costas array’’ and “Costas permutation’’ will be used interchangeably. Figure 1 shows a Costas array of order 27.

Similarly, the definition of a Golomb ruler uses , , , and , , so that . The length of this Golomb ruler is defined to be (this agrees with the usual concept of the term of a physical ruler), while, if , the Golomb ruler is said to have markings.

*Remark 2.6. *Historically, the Costas property has been construed to include bijectivity: this is because the original engineering application that introduced Costas arrays does not benefit any further from nonbijective Costas sets, namely, Costas arrays with two or more dots on the same row or column, though such Costas arrays can still be used successfully [1, 2]. In this work, bijectivity/injectivity is no longer considered to be a formally required component of the Costas property; in fact, the Costas set may not even be the graph of a function. Respecting tradition, however, we will endeavor to provide examples of injective Costas functions.

*Remark 2.7. *A direct consequence of the definition is that for all , is also a Costas set with respect to . In particular, Golomb rulers can be shifted over the integers and still retain the Costas property, and so do Costas arrays if shifted in either direction.

We finally specialize the definition of a Costas set on groups that are dense in themselves.

*Definition 2.8 (Costas clouds). *Let in Definition 2.1 be dense in itself, and let . Whenever a Costas set is dense in , it will be called a *Costas cloud*.

In particular, Costas clouds can exist in , , or powers thereof (, etc.).

##### 2.3. Construction of Costas Permutations

Two algebraic construction methods exist for Costas permutations [3, 4, 6]. Let us review them briefly without proof, as they will be needed later.

###### 2.3.1. The Welch Construction

Theorem 2.9 (Welch construction ). *Let be a prime, let be a primitive root of the finite field of elements, and let be a constant; then, the function where is a bijection with the Costas property.*

The reason for the presence of in the exponent is that, when , 1 is a fixed point: . We refer to arrays generated with as circular shifts of the array generated by for the same and .

###### 2.3.2. The Golomb Construction

Theorem 2.10 (Golomb construction ). *Let be a prime, , and let , be primitive roots of the finite field of elements; then, the function where is a bijection with the Costas property.*

##### 2.4. Constructions for Golomb Rulers/Sidon Sets

Golomb rulers, though bearing the name of Professor S. Golomb, were originally described by W. C. Babcock in the context of an application in telecommunications [7]. It later emerged that they had made their appearance even earlier in the context of harmonic analysis, in a completely equivalent formulation, known as Sidon sets [8]. In this work, the two terms will be used interchangeably. A very comprehensive source of information about Golomb rulers is [9].

Definition 2.1, in the context of Remark 2.5, yields the usual definition of Golomb rulers/Sidon sets.

*Definition 2.11. *Let , , so that . is a *Sidon set* or a *Golomb ruler* if and only if

The sum version corresponds to Sidon sets, the difference version to Golomb rulers: they are obviously equivalent. What is the relation between and ? In particular, what is the smallest for a given ? What is the largest for a given ? Golomb rulers that satisfy either of these conditions are dubbed *optimal*. It is conjectured [9] that optimal Golomb rulers asymptotically satisfy the condition

Though they will not be needed further in this work, and for the sake of completeness only, we also present some construction methods for Golomb rulers. Note that, contrary to the case of Costas arrays, where the order specifies the number of dots, the definition of a Golomb ruler does not relate the length to the number of markings in any way. Needless to say, construction methods for Golomb rulers considered to be of interest tend to produce reasonably densely populated Golomb rulers, and, in particular, families that asymptotically satisfy (2.5).

###### 2.4.1. Erdös-Turan Construction [10, 11]

Theorem 2.12. *For every prime , the sequence
**
forms a Golomb ruler.*

The approximate asymptotic length of such a Golomb ruler with markings is ; hence it deviates from optimality by a factor of 2.

###### 2.4.2. Rusza-Lindström Construction [12, 13]

Theorem 2.13. *Let be prime, a primitive root of , and relatively prime to . The following sequence
**
forms a Golomb ruler.*

These rulers are of length (at most) and have markings; hence they are optimal.

###### 2.4.3. Bose-Chowla Construction [14, 15]

Theorem 2.14. *Let be a power of a prime and a primitive root in . Then the integers
**
have distinct pairwise differences modulo .**In addition, the set of pairwise differences in , reduced modulo , equals the set of all nonzero integers less than which are not divisible by .*

These rulers are optimal: they have markings and their length is (at most) .

###### 2.4.4. An Always Applicable Construction [9]

The previous constructions work only when the number of markings is a (power of ) prime. The following construction works always but, unfortunately, is far from optimal.

Theorem 2.15. *For any , and for a fixed , the sequence
**
forms a Golomb ruler.*

This ruler has markings and its length is asymptotically ; hence it is far from optimal.

#### 3. Explicit Constructions of Nowhere Continuous Costas Functions

The following two examples use the indicator function of a dense subset of as a building block, denoted by ; specifically, if and otherwise.

Theorem 3.1. *Let so that
**
Then is a nowhere continuous Costas bijection on with respect to .*

*Proof. *We will denote the set of irrational numbers by . First, we show that is injective; we distinguish two cases for the equation . (i) and are both in or both in : we get . (ii), (the opposite case is obviously similar): we get which is impossible, as this equation implies that as well. Therefore, is injective.

We now show that is surjective; we distinguish two cases for the equation . (i): then . (ii): then . For every , then, each of the 2 cases formally yields a solution, but the injectivity of guarantees that only one will be admissible: specifically, if is the square of a rational, the solution comes from the first case, otherwise from the second. In particular, we find an for every ; therefore is surjective.

Since is dense in , the indicator function is nowhere continuous in , and therefore is nowhere continuous as well.

We finally need to show that has the Costas property. We consider the equation
and observe that is rational if and only if is rational. We only need to consider then two cases: (i) and are both in or both in : we get
(ii), (the opposite case is obviously similar): we get
implying that , a contradiction. Overall then, and the Costas property is confirmed. This completes the proof.

The previous idea can be successfully generalized to yield an expanded family of nowhere continuous functions with the Costas property if is substituted by .

Theorem 3.2. *Let so that
**
Then is a nowhere continuous Costas bijection on with respect to .*

*Proof. *The set is known as the set of transcendental numbers. The proof follows closely the previous proof. Throughout the proof it will be important to keep in mind that is conveniently closed under several operations such as addition, multiplication, inversion, and exponentiation by a rational exponent.

The equation leads to the two possibilities and according to whether both and are of the same type (algebraic or not) or of different types (in which case, without loss of generality, we consider , ): the former leads to (for ) while the latter implies , whereby is algebraic, a contradiction. It follows that is injective.

The equation leads to the two possibilities or , according to whether or not, respectively: the former yields an admissible solution if and only if is algebraic, and the latter if and only if is transcendental. Hence, a valid corresponds to each and is surjective.

Since is dense in , the indicator function is nowhere continuous in , and therefore is nowhere continuous as well.

Finally, we need to show that satisfies the Costas property. To see this, we form the equation
and consider the resulting two cases. (i)If and are both in or both in , (3.6) becomes
According to [5, Theorem 5], since the function is strictly monotonic with a strictly monotonic derivative in , it has the Costas property over this set; hence the only possible solution is . (ii)If and are of different types, let (without loss of generality) and : the equation becomes
For a fixed , , and , this is an algebraic equation in , implying that is algebraic, a contradiction. Overall then, and the Costas property is confirmed. This completes the proof.

*Remark 3.3. * was chosen instead of as the domain of in a preceding theorem because is not defined at 0 when ; could have been used for .

Although both constructions above are nowhere continuous, their behavior is not as “wild’’ as one might have hoped for: their graph is entirely included within two smooth curves, given by the equations and , , the latter containing countably many points. Is there a function satisfying the Costas property whose graph is everywhere dense on a region of the real plane? This leads to the notion of Costas clouds, studied below.

#### 4. Costas Clouds

Our foremost intention here is to prove that bijective Costas clouds exist; to carry out the proof, we will need some background.

##### 4.1. Cauchy's Functional Equation

*Definition 4.1. *Let ; it satisfies *Cauchy's functional equation* if and only if

A detailed study of this equation can be found in [16]. For the sake of completeness, we state and prove below those properties of the solutions we will need.

Theorem 4.2. *The solution of Cauchy's equation (4.1) satisfies the following properties. *(1)*For all , for all ,. *(2)* is continuous if and only if ,. *(3)* is continuous everywhere if and only if it is continuous at a point. *(4)* is discontinuous if and only if its graph is everywhere dense on the real plane. *

*Proof. *(i) Setting we get .

(ii) Setting we get .

(iii) Setting , for we get .

(iv) Setting we get . Setting we get .

Expressing the rational as , all of the above shows that, for any ,

Assume now that is continuous: for every there exists a sequence of rationals such that . It follows that
Conversely, every function of the form satisfies Cauchy's equation (4.1) and is continuous.

Assume that is continuous at some point ; then
hence is continuous at (an arbitrary) .

Assume now that is not continuous: then, by what we just proved, it must be nowhere continuous and it cannot be linear (though it has to be linear over the rationals). This implies
whence it follows that the two vectors , are linearly independent and, consequently, span the entire real plane. The set of vectors, then, of the form are an everywhere dense subset of the real plane, but
which means that the subset of the graph of is everywhere dense on the plane; whence the graph of itself is everywhere dense on the plane. Conversely, if the graph of is everywhere dense on the real plane, cannot possibly be continuous, or else it would be linear and thus would not possess an everywhere dense graph. This completes the proof.

*Remark 4.3. *Cauchy's functional equation, despite its simplicity, has been playing a prominent role in analysis: Hilbert's 5th problem essentially proposes a generalization of this equation, while an important area of study is the Hyers-Rassias-Ulam stability of this equation (or slight variants thereof) [17–19].

##### 4.2. Bijective/Injective Solutions of Cauchy's Functional Equation

Theorem 4.4. *There exist solutions of Cauchy's equation that are nowhere continuous bijections/injections, everywhere dense on the real plane.*

*Proof. *Consider as a vector space over . This vector space must necessarily have an uncountable basis, or else itself would be countable: it follows by the Continuum Hypothesis that this basis can be indexed by the real numbers and, therefore, that we can describe the basis as . By definition, any real number admits a (finite) linear expansion over this basis (where the rational , the indices , , and are obviously functions of ). Furthermore, a solution of Cauchy's equation (4.1) can be considered as a linear map over this vector space, and we can write
which expresses the well-known result that a linear map over a vector space is unambiguously defined by its effect on the vector space basis . Assuming now that , , we get for all , namely, that is linear. By Theorem 4.2, though, this will be the *only* case resulting to a linear : in all other cases will be nowhere continuous and its graph everywhere dense. Choosing a bijection/injection over (other than the identity) such that for all , results to an that is bijective/injective as well. This completes the proof.

*Remark 4.5. *The theorem does not rely on the exact nature of : it only requires a field over which has an uncountable basis. In particular, any countable field extension of would have been equally suitable, such as .

##### 4.3. The Existence of Bijective Costas Clouds on —The Welch and Golomb Methods

Theorem 4.6. *Bijective Costas clouds on exist.*

*Proof. *Consider a nowhere continuous bijection on whose graph is everywhere dense on , and that further satisfies Cauchy's equation (4.1). Construct such that ; inherits the properties has and is then itself a nowhere continuous bijection (as the exponential function is strictly monotonic), whose graph is everywhere dense in . Furthermore, it satisfies the Costas property from to with respect to :
This completes the proof.

Corollary 4.7. *Costas clouds on exist.*

It has been suggested that the success of the Welch method (Theorem 2.9) in the construction of Costas permutations lies in the interplay between an additive and a multiplicative structure [20]: indeed, the exponent is an additive function, while the exponentiation turns this additive structure into a multiplicative one. But, according to the proof of Theorem 4.6, , where satisfies Cauchy's functional equation (4.1) and is additive: this function, therefore, exhibits the same interplay between the additive and the multiplicative structure and can accordingly be considered a generalization of the Welch construction. Theorem 4.6, then, viewed from the point of view of the method it follows instead of the result it achieves, reads as follows.

Theorem 4.8 (Generalized Welch construction in the continuum). *Let be a nowhere continuous injection that satisfies (4.1), and let be such that . Then is a Costas cloud: if has an everywhere dense graph in , so does in ; if is bijective, so is .*

Since the Welch method can be successfully generalized on the real line, can the same be done for the Golomb method (Theorem 2.10)?

Theorem 4.9 (Generalized Golomb construction in the continuum). *Let be a nowhere continuous injection that satisfies (4.1), and let be such that . Then is a Costas cloud: if has an everywhere dense graph in , so does in ; if is bijective, so is .*

*Proof. * is clearly bijective if and only if is, and it inherits the property of the everywhere dense graph as long as has it; we just need to show the Costas property:
Note finally that , which is impossible, so cannot be defined on . This completes the proof.

##### 4.4. The Existence of Bijective Costas Clouds on

Based on Theorem 4.6, we can apply a simple transformation and obtain a Costas cloud on .

Theorem 4.10. *Bijective Costas clouds on exist.*

*Proof. *Consider the function of (the proof of) Theorem 4.6, note that , and consider such that . It clearly follows that is bijective, nowhere continuous, and that it has an everywhere dense graph, as has these properties. We need to verify the Costas property:
where , , , , . But since , whence the function is monotonic, and therefor,
This completes the proof.

Corollary 4.11. *Costas clouds on exist.*

But we can also apply another simple transformation, again based on Theorem 4.6, to obtain this result.

*Alternative proof of Corollary 4.11. *Consider the function of (the proof of) Theorem 4.6, and consider such that . Clearly is injective, nowhere continuous on , and has a graph everywhere dense in , because has all these properties. We only need to make sure it has the Costas property:
The second alternative is impossible as , so we necessarily obtain , and the Costas property is verified. This completes the proof.

##### 4.5. Rational Costas Clouds

An algorithm to construct Costas bijections on the set has already been proposed in [5], but the density of its graph in was not considered or studied at the time. We propose here a different algorithm that produces a rational Costas cloud. Referring to Definition 2.8, note that it is of no interest to consider the density of the graph of a function on whenever : we correct then this part of the definition to read that the graph has to be dense on , where denotes the smallest (closed) interval in containing .

The construction proposed in Theorem 4.6 does not produce a rational Costas cloud, as not only does the function fail to be a bijection on the rationals but also the images of all rationals lie on a curve. We need then a new mechanism, such as the following.

Theorem 4.12. *Enumerate so that , and consider two copies of it, and (it is also allowed to use different enumeration schemes in the two sets). Consider the following inductive construction on . ***Stage 1**:* Draw the horizontal line through and the vertical line through , thus dividing into 4 smaller squares; choose one point with rational coordinates in each so that the Costas property holds, and so that the points and are chosen. Let the points be , , and set , .***Stage**:* Draw the horizontal lines through , and the vertical lines through , , thus dividing into smaller squares. Choose one point in each square , so that, for all points together chosen in stages 1 through inclusive, the Costas property holds, and so that, if and are the smallest natural numbers so that and , respectively, one of the chosen points has as its first coordinate and one as its second. Set , . **The set of points so constructed corresponds to the graph of a bijective rational Costas cloud on .*

*Proof. *The construction is possible because, for every stage and every square, we are called to choose a rational point in this square so that finitely many constraints are satisfied: this is always possible as there are infinitely many rational points in a square. The resulting function clearly satisfies the Costas property, it is injective between its domain and its range, and its graph is everywhere dense in . Further, every rational number in the domain and the range is used exactly once. This completes the proof.

*Remark 4.13. *The construction above can be modified to yield bijective rational Costas clouds on the entire : just apply stage to the square . In other words, as stages progress, the grid not only becomes more and more refined but also expands.

*Remark 4.14. *The square grid described in the theorem has the property that the squares in a given stage are all of the same size, and that any two squares either share a common boundary or else one contains the other. Neither of these properties is necessary, strictly speaking: for example, we could have used a grid of the form , or even .

*Remark 4.15. *The proof does not depend on the exact nature of , except for the facts that it is countably infinite and everywhere dense in : any other set with these properties would have sufficed, such as .

#### 5. Countably and Uncountably Infinite Dense Golomb Rulers

Infinite Golomb rulers have been studied in the past [21]: the main point of interest in these studies has been the behavior of the density , being the number of markings within the set . It should be mentioned here that, even though references to “dense infinite Sidon sequences’’ can be found in literature (e.g., [22]), giving the impression, at first sight, that the results below may not be novel after all, in fact the term “dense’’ is used not in the analytic sense but in conjunction with the behavior of . Such references are, then, totally unrelated to the task we are about to embark on.

##### 5.1. The Existence of Countably Infinite Dense Golomb Rulers

Theorem 5.1. *Let be a subinterval of (possibly infinite, possibly itself): countably infinite Golomb rulers in exist and may be suitably chosen to be dense in .*

*Proof. *The idea of the proof is essentially the same as in Theorem 4.12 and relies upon the enumerability of . Enumerate so that , and then set . Assume now that , containing rationals, has been created, and that is being currently considered: if is a Golomb ruler, set ; proceed to consider . For each we are bound to construct out of , as there are infinitely many rationals to choose from, and only finitely many constraints due to the Golomb ruler property. is a countably infinite Golomb ruler.

To ensure that the ruler is dense in , let be the th subinterval of length (say counting from left to right) of , and then order all consecutively, first by and then by : , thus obtaining a sequence of intervals . Now apply the construction proposed above with the extra requirement that, for every , the element that turns into must belong in : this is always possible, as itself contains infinitely many rationals. This completes the proof.

*Remark 5.2. *Any countably infinite set, such as , could have been used in the proof above, instead of ; the proof clearly does not rely on the exact nature of the set used.

##### 5.2. The Existence of Uncountably Infinite Dense Golomb Rulers

Theorem 5.3. *Let be a subinterval of (possibly infinite, possibly itself): uncountably infinite Golomb rulers in exist and may be suitably chosen to be dense in .*

*Proof. *Consider as a vector space over , and let be an (uncountable) basis of this vector space (see the proof of Theorem 4.4). Consider the family of subspaces , and observe that if and only if . Choose a unique point such that and that , (in other words, choose for some ), and form the set . This is an uncountable subset of , and we show that it is indeed a Golomb ruler. Consider the equation
whence . Since, by assumption, , it follows that . If , we obtain which is impossible; therefore , implying that , and, consequently, that .

Note that, for any , any with can be chosen instead of . This allows us to choose dense in . This completes the proof.

*Remark 5.4. * could have been used instead of (see Remark 4.5).

#### 6. Extensions on the Complex Plane

Having investigated the Costas property on and , we turn our attention to the field of complex numbers . To ensure the success of the extension of the various constructions proposed above, we need to revisit each step and identify the necessary modifications, if any. We find then the following.

(i)Cauchy's functional equation (4.1) needs to be reworked to yield a bijection/injection with the required properties in . (ii)The proofs of the extended Welch (Theorem 4.6) and Golomb (Theorem 4.9) constructions are (formally) still valid, once the right domain and range for the functions is specified and the multivalued nature of the exponential function in is taken into account.##### 6.1. Cauchy's Functional Equation on

We need to study the properties of a function such that

Applying the real argument twice (on the real and the imaginary numbers), we obtain Assuming that lies on a straight line of ; otherwise it is dense in . A verbatim repetition of the proof of the real case shows that is continuous on if and only if it is continuous at a point: in this case, it follows that

We now need to ensure that is an injection/bijection, and that the graph of , namely, , is dense in . The corresponding proof in the real case relied heavily on the linearity of over rational multipliers, namely, on the condition that for all , for all , (see Theorem 4.2), but this time the condition stated in (6.2) is not a linearity condition. We can still restrict our attention to linear solutions of (6.1) by imposing the compatibility condition: this condition is equivalent to because, letting , , we get Applying this condition to (6.2), we obtain while we find directly that In other words, every solution of (4.1) can be extended to a solution of (6.1) that obeys the linearity property (6.8) over the complex rationals ; such functions have the property that , which is equivalent to . As (6.3) and (6.5) are not compatible, is dense in .

Assuming is continuous, (6.4) shows that for all , ; assuming that the function is nowhere continuous, hence nonlinear, there exist such that the vectors and are linearly independent. It follows that the set namely a subset of the graph of , is countably infinite and dense in .

It remains to be seen that such a nonlinear function can be constructed. To achieve this, we proceed as in the proof of Theorem 4.4: we consider as a vector space over the field of complex rationals with an uncountable basis . If is a permutation other than the identity, is a nowhere continuous bijection on whose graph is dense in ; if is injective, is a nowhere continuous injection on whose graph is dense in .

##### 6.2. The Golomb and Welch Constructions on

The extensions of both the Golomb and the Welch construction in , as seen in Section 4.3, involved the exponential function, which is multivalued over . For this reason, any further extension over will necessitate an appropriate restriction of the domain, or, equivalently, the redefinition of Costas property over equivalence classes of points, in order to restore injectivity and surjectivity. Both extensions, as stated below, follow this principle, setting their domain and/or range, as appropriate, to be sets of distinct representatives of such equivalence classes.

Theorem 6.1 (Generalized Welch construction in the complex continuum). *Let be a nowhere continuous injection that satisfies (6.1) and (6.5), and let be such that . Then is surjective but not injective. Considering the unique such that , setting , and letting be the choice set containing a unique element from each set in the collection , it follows that is a Costas cloud: if has an everywhere dense graph in , so does in ; if is bijective, so is . In particular, the choice is possible.*

*Proof. *The proof is a verbatim repetition of the proof of Theorem 4.6, once the new range of the method () is established and injectivity is restored: to this end, we observe that
hence the restriction of the domain to , a set of distinct representatives of the various equivalence classes , , restores injectivity, hence bijectivity.

Theorem 6.2 (Generalized Golomb construction in the complex continuum). *Let be a nowhere continuous injection that satisfies (6.1) and (6.5), and let be such that . Considering the unique such that , setting and , and letting and be the choice sets containing a unique element from each set in the collection and , respectively, it follows that is a Costas cloud: if has an everywhere dense graph in , so does in ; if is bijective, so is . In particular, the choices and are possible.*

*Proof. *The proof is a verbatim repetition of the proof of Theorem 4.9, after establishing bijectivity along the lines of the proof of Theorem 6.2. Note that here the exponential function affects both the domain and the range; so both of these sets need to be restricted to distinct representatives of equivalence classes.

#### 7. General Construction Principles

The Costas property is very “unalgebraic’’, as most of the usual algebraic operations fail to preserve it: for example, the composition of two Costas functions is, in general, not a Costas function, and the same goes for their sum, product, and so forth. We now take a look at two operations that do preserve the Costas property.

##### 7.1. Isomorphisms of Costas Sets

Group isomorphisms can be composed with Costas sets to yield new Costas sets, or to divide Costas sets into equivalence classes. This seemingly simple result has some important consequences; in particular, it can be used to prove the existence of new Costas clouds.

Theorem 7.1. *Let be a left Costas set in with respect to , and let be an isomorphism; then, is a left Costas set in with respect to .*

*Proof. *Let , be the group operations in and , respectively. Let , and let ; since is an isomorphism, there exist unique and such that and , . We need to verify that
But, because is an isomorphism, it follows that
which implies that
and therefore that , as is a Costas set. But then , and this completes the proof.

Theorem 7.2. *Bijective Costas clouds on exist.*

*Proof. *We use Theorem 7.1 with . Letting correspond to the graph of a Costas bijection with respect to , so that is itself a Costas set with respect to , and letting be a nowhere continuous bijection (whose graph is then everywhere dense on ) that further satisfies Cauchy's equation (4.1), we obtain an (additive) isomorphism , where , hence a bijective Costas cloud.

It all then comes down to finding the appropriate function ; according to the results in [5], it is enough to find bijective, differentiable, and strictly monotonic, with a strictly monotonic derivative, as such a function is guaranteed to have the Costas property. We propose
This function is bijective, as , , and is strictly increasing in each of its two branches. It is also continuous everywhere, as it is continuous on each branch and also ; furthermore, it is also continuously differentiable everywhere, as
and also, by taking the limits on each branch, . Finally, the derivative is decreasing on each branch, hence everywhere by its continuity: in particular, , , while , .

It follows that is a bijective Costas cloud. This completes the proof.

##### 7.2. Tensor Products

Theorem 7.3. *Let be a left (right) Costas set in with respect to , ; then is a left (right) Costas set in with respect to .*

*Proof. *The proof is practically obvious: letting , , and be the group operations in , , and , respectively, and letting , , we consider . Should , be in this intersection, there would exist such that
which is equivalent to saying that the following 4 equalities should hold concurrently:
The former two relations, though, because is a Costas set, would imply that , and similarly the latter two that ; thus, , and this completes the proof.

For example, let be the bijective Costas cloud constructed in Theorem 7.2; it follows from Theorem 7.3 that is a Costas set in with respect to . Considering further the set , resulting from a permutation of the coordinates of , we see that coordinates and span , and so do and , in such a way that the mapping between and is bijective and dense in ; it follows that is a bijective Costas set dense in with respect to is or, equivalently, in with respect to , due to the isomorphism between and .

As another example, let now be smooth Costas bijections, for example, such as constructed in the proof of Theorem 7.2, and let , be the graphs of , , respectively. Invoking Theorem 7.3, we see that is a Costas set in with respect to . But, using again the isomorphism between and and the permutation of coordinates mentioned above to construct from , we find that is the graph of such that which is clearly a smooth bijection.

As a final caveat, however, note that Theorem 7.3 can easily be misunderstood to assert more than it actually does: assuming , , the theorem asserts that is a Costas set with respect to , which is quite a different set than . In particular, neither of the Costas sets constructed in the two examples above is a Costas cloud. Finding a tensor construction for Costas clouds remains, then, an open problem.

#### 8. Conclusion

We abstracted the Costas property and stated it in the context of an arbitrary (possibly even nonAbelian) group. As a consequence, Costas arrays and Golomb rulers were both found to be Costas sets, instantiations of the Costas property over different groups. The bijectivity condition in the case of Costas arrays is an additional, peripheral requirement, not directly related to the Costas property. We did not further pursue the direction of the study of Costas sets over nonAbelian groups, which we leave as future work, but turned our attention to groups with the analytic property of being dense in themselves instead (such as , , and ): after a brief overview of the known construction methods for Costas arrays and Golomb rulers, we embarked on the study of Costas sets that are dense in the group they belong to; we named these sets Costas clouds.

We first constructed explicit examples of real, nowhere continuous bijections whose graphs satisfy a constrained form of the Costas property (over rational or algebraic displacements only, i.e.), using the indicator function of the rationals or of the algebraic numbers as a building block. Furthermore, we constructed real Costas clouds, based on Cauchy's functional equation: these are perhaps what first springs into one's mind when considering possible generalizations of Costas arrays in the continuum, due to the very haphazard positioning of their dots. These Costas clouds led to the generalization in the continuum of the two main generation methods for Costas permutations, namely, the Welch and the Golomb construction. These functions are highly nontrivial to construct, and their existence nontrivial to prove. We also considered rational Costas clouds, which were easier to construct thanks to the enumerability of the rationals.

Similarly, we proved the existence of (countably and uncountably) infinite Golomb rulers in a (finite of infinite) interval of the real line, that can optionally be constructed so that they have the extra property of being everywhere dense in this interval. We also noted that, though “infinite dense’’ Golomb rulers have appeared in literature before, the word “dense’’ had an entirely different meaning and was not used in the analytic sense.

Both uncountable constructions (Costas clouds and Golomb rulers) relied on two ideas, namely, the consideration of as vector space over possessing an uncountable basis, and the use of Cauchy's functional equation (in the case of Costas clouds). These ideas not only made the proof of the existence of these objects possible but also revealed how much freedom we have for their construction; without these ideas the tasks seemed hopeless. Regarding the corresponding countably infinite (e.g., rational) objects, enumerability itself is sufficient to both establish existence and allow great freedom of construction.

The extension to complex numbers of the construction methods for Costas clouds we presented was possible and necessitated a slight modification of the Cauchy functions used. The main obstacle, however, was the multivalued nature of the exponential function that is involved in both the Golomb and the Welch method: in order to re-establish bijectivity, the Costas sets produced by these methods needed to be appropriately redefined over equivalence classes of points (or distinct representatives thereof).

Despite all of our efforts, the real Costas clouds we were able to construct through the extensions of the Golomb and the Welch method were limited on genuine subsets of the real plane (the upper half plane, an infinite strip, etc.). A bijective Costas cloud on the entire real plane was finally constructed by a new general construction principle applicable on any group, namely, that the composition of a Costas set with a group isomorphism results in a new Costas set: in this particular instance, the graph of a suitably constructed smooth Costas function on was composed with a Cauchy function. Another general construction principle, namely, the formation of tensor products of Costas sets, allowed the construction of a bijective Costas set on .

The ideas presented here have potentially far reaching consequences, which we intend to investigate as future work: for example, Costas sets over arbitrary (even noncommutative) groups have never been studied (to the best of our knowledge); how would Costas arrays over GL or SL look, or even over more complex groups, such as fields of rational functions over finite fields or -adic fields? Furthermore, Theorem 7.1 implies that Costas sets in a group can be classified into equivalence classes defined by their orbits under the automorphism group of the group in question; we hope that this classification will help us further understand the structure of Costas sets.

#### Acknowledgments

The author is indebted to Professor Nigel Boston (School of Mathematics, University College Dublin) for his helpful suggestions regarding Theorem 4.6 as well as Professor Roderick Gow (Ibid.) and Dr. Scott Rickard (School of Electrical, Electronic & Mechanical Engineering, University College Dublin) for the many useful discussions on the topic.

#### References

- J. P. Costas, “Medium constraints on sonar design and performance,” Technical Report Class 1 Rep R65EMH33, General Electric, 1965. View at: Google Scholar
- J. P. Costas, “A study of detection waveforms having nearly ideal range-doppler ambiguity properties,”
*Proceedings of the IEEE*, vol. 72, no. 8, pp. 996–1009, 1984. View at: Publisher Site | Google Scholar - S. W. Golomb, “Algebraic constructions for Costas arrays,”
*Journal of Combinatorial Theory Series A*, vol. 37, no. 1, pp. 13–21, 1984. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - S. W. Golomb, “Constructions and properties of Costas arrays,”
*Proceedings of the IEEE*, vol. 72, no. 9, pp. 1143–1163, 1984. View at: Publisher Site | Google Scholar - K. Drakakis and S. Rickard, “On the generalization of the Costas property in the continuum,”
*Advances in Mathematics of Communications*, vol. 2, no. 2, pp. 113–130, 2008. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - K. Drakakis, “A review of Costas arrays,”
*Journal of Applied Mathematics*, vol. 2006, Article ID 26385, 32 pages, 2006. View at: Google Scholar | MathSciNet - W. C. Babcock, “Intermodulation interference in radio systems/frequency of occurrence and control by channel selection,”
*Bell System Technical Journal*, vol. 31, pp. 63–73, 1953. View at: Google Scholar - S. Sidon, “Ein Satz über trigonometrische Polynome und seine Anwendung in der Theorie der Fourier-Reihen,”
*Mathematische Annalen*, vol. 106, no. 1, pp. 536–539, 1932. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - A. Dimitromanolakis,
*Analysis of the Golomb Ruler and the Sidon set problems, and determination of large, near-optimal Golomb rulers*, Diploma thesis, Department of Electronic and Computer Engineering, Technical University of Crete, Crete, Greece, 2002, http://www.cs.toronto.edu/~apostol/golomb. - P. Erdös and P. Turán, “On a problem of Sidon in additive number theory, and on some related problems,”
*Journal of the London Mathematical Society*, vol. 16, pp. 212–215, 1941. View at: Google Scholar | Zentralblatt MATH | MathSciNet - P. Erdös, “On a problem of Sidon in additive number theory, and on some related problems. Addendum,”
*Journal of the London Mathematical Society*, vol. 19, p. 208, 1944. View at: Google Scholar | MathSciNet - B. Lindström, “Finding finite ${B}_{2}$-sequences faster,”
*Mathematics of Computation*, vol. 67, no. 223, pp. 1173–1178, 1998. View at: Publisher Site | Google Scholar | MathSciNet - I. Z. Ruzsa, “Solving a linear equation in a set of integers. I,”
*Acta Arithmetica*, vol. 65, no. 3, pp. 259–282, 1993. View at: Google Scholar | Zentralblatt MATH | MathSciNet - R. C. Bose, “An affine analogue of Singer's theorem,”
*Journal of the Indian Mathematical Society*, vol. 6, pp. 1–15, 1942. View at: Google Scholar | Zentralblatt MATH | MathSciNet - R. C. Bose and S. Chowla, “Theorems in the additive theory of numbers,”
*Commentarii Mathematici Helvetici*, vol. 37, pp. 141–147, 1962/1963. View at: Publisher Site | Google Scholar | MathSciNet - J. Aczél and J. Dhombres,
*Functional Equations in Several Variables*, vol. 31 of*Encyclopedia of Mathematics and Its Applications*, Cambridge University Press, Cambridge, UK, 1989. View at: MathSciNet - D. H. Hyers, “On the stability of the linear functional equation,”
*Proceedings of the National Academy of Sciences of the United States of America*, vol. 27, pp. 222–224, 1941. View at: Google Scholar | Zentralblatt MATH | MathSciNet - D. H. Hyers and Th. M. Rassias, “Approximate homomorphisms,”
*Aequationes Mathematicae*, vol. 44, no. 2-3, pp. 125–153, 1992. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - Th. M. Rassias, “On the stability of the linear mapping in Banach spaces,”
*Proceedings of the American Mathematical Society*, vol. 72, no. 2, pp. 297–300, 1978. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - R. Gow, private communication, 2007.
- I. Z. Ruzsa, “An infinite Sidon sequence,”
*Journal of Number Theory*, vol. 68, no. 1, pp. 63–71, 1998. View at: Publisher Site | Google Scholar | Zentralblatt MATH | MathSciNet - M. Ajtai, J. Komlós, and E. Szemerédi, “A dense infinite Sidon sequence,”
*European Journal of Combinatorics*, vol. 2, no. 1, pp. 1–11, 1981. View at: Google Scholar | Zentralblatt MATH | MathSciNet

#### Copyright

Copyright © 2009 Konstantinos Drakakis. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.