Prerequisite:

## General aspects

One of the still open problems of dashed line theory is, given a linear dashed line T = (p_1, p_2, \ldots p_k) of order k, finding an expression that is able to represent an upper bound for the maximum distance between a space and the one immediately preceding it. That is, given two columns s_1 and s_2 of a dashed line, both spaces, such that s_1 \lt s_2, without other spaces between them, the purpose of this investigation is finding h such that s_2 - s_1 \leq h, for each possible pair of consecutive spaces (s_1, s_2) of the dashed line considered.

Surely h exists, because, for example, one of its possible values is the maximum distance d between spaces, which has been our starting point for this research. To calculate it, it is sufficient to take all possible pairs of neighbouring spaces of a given dashed line, calculate the distance for each of them, and take the maximum one. The Dashed line viewer, among the other information provided, shows also the maximum distance between consecutive spaces, so it can be used as a basis for possible investigation in this sense.

0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|

2 | — | — | — | — | — | — | — | ||||||

3 | — | — | — | — | — |

The pairs of consecutive spaces are the following:

- Columns 1 and 5, the distance of which is 5 – 1 = 4;
- Columns 5 and 7, the distance of which is 7 – 5 = 2;
- Columns 7 and 11, the distance of which is 11 – 7 = 4.

The third pair, actually, is nothing more than the repetition of the first one, but it was important to go beyond the period of the dashed line, because, in correspondence with the column equal to the period (i.e. column 6), there is in turn a pair of spaces.

So, given all possible pairs (s_1, s_2) ,we have s_2 - s_1 \leq 4.

So, it is certainly true that the upper bound can be found through an algorithm (i.e. a procedure made of a series of steps), but the purpose of this investigation is to look for a formula.

## Upper bound for the maximum distance for first order dashed lines

The dashed lines of which it is easier to find a universally valid upper bound are the first order ones, because their structure is extremely regular: a first order dashed line T_1(p_1), in fact, always consists of the repetition of a sequence formed by a dash followed by p_1 - 1 spaces.

For example, this is the dashed line T = (5) up to 25:

0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | 22 | 23 | 24 | 25 | |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|

5 | — | — | — | — | — | — |

So, the possible pairs of consecutive spaces, not only for this example of dashed line but for any first order one, are only two:

- A space immediately followed by another space (such as columns 2 and 3 in the example); the distance between these spaces is 1;
- A space immediately followed by a dash, immediately followed by another space (such as columns from 4 to 6 in the example); the distance between these spaces is 2.

For a first order hatch, then, this Property applies:

Upper bound for the maximum distance between consecutive spaces for first order dashed lines

In a first order dashed line, the maximum distance between consecutive spaces is 2.

## Upper bound for maximum distance for second order dashed lines

The previous reasoning is also applicable to second order dashed lines, but it must be considered that their structure is slightly more complex than the first order ones. The starting point are some properties, which apply precisely to second order dashed lines and are a direct consequence of their own structure:

- Each column of the dashed line may not contain dashes (i.e. be a space), or contain one in both rows, or one in the first row, or one in the second one;
- The minimum distance between two dashes of the first row is 2, equal to the smallest value of the first component;
- The minimum distance between two dashes of the second row is 3, equal to the smallest value of the second component;
- A dash, in the row in which it is located, cannot be immediately preceded or followed by another dash: it is a direct consequence of the two previous properties;
- A column containing a dash in both rows is always immediately preceded and followed by at least one space: it is a direct consequence of the previous property.

To find the upper bound we are looking for, we must determine what is the maximum number of dashes that can be between two consecutive spaces, that is, given a column s that is a space, we must find the maximum value d such as the columns s + 1, s + 2, \ldots, s + d - 1 are dashes, and s + d it is another space. So let’s analyze the various cases that can occur for these intermediate columns:

- The simplest case is that in which s + 1 falls in the first case of property
*A*, i.e. it is a space: in this case we have a space followed immediately by another space, so d = 1. - Or, s + 1 falls in the second case of the property
*A*, i.e. it contains dashes in both lines: in this case, for the property*E*, it is immediataly preceded and followed by a space, so s + 2 is also a space. So we have a space, a column that is not a space, and then another space, so d = 2. - Or, s + 1 falls into the third case of property
*A*, i.e. it contains a dash in the first row. With regard to the next column, i.e. s + 2, the property*D*guarantees that it cannot contain a dash in the first row, so only two subcases can occur:- The column s + 2 does not even contain a dash in the second row, so it is a space: therefore we have a space, followed by two columns that are not spaces, followed by another space, so d = 3.
- The column s + 2 contains a dash in the second row. With regard to the next column, s + 3, the property
*D*guarantees us that it cannot contain a dash in the second row, then only two subcases can occur in turn:- The column s + 3 does not even contain a dash in the first row, so it is a space: therefore we have a space, followed by two columns that are not spaces, followed by a space, so d = 3.
- Or, the column s + 3 contains a dash in the first row. In this case, the column s + 4 is certainly a space: in fact, the property
*D*guarantees that this column cannot contain a dash in the first row; but it cannot contain a dash even in the second, because, if it were so, we would have both s + 2 and s + 4 with a dash in the second row, i.e. two dashes of the second row with distance 2, which would lead to a contradiction with the property*C*. So, we have a space, followed by three columns which are not spaces, followed by another space, so d = 4.

- Or, s + 1 falls under the fourth case of property
*A*, that is, it contains a dash in the second row. The reasoning, in this case, is identical to the previous one, but with the first row instead of the second one and vice versa.

So in total, given any second order space s, we have 1 \leq d \leq 4 . Therefore, with regard to the maximum possible distance, the following Property applies:

Upper bound of the maximum distance between consecutive spaces for second order dashed lines

In a second order dashed line, the maximum distance between consecutive spaces is 4.

## Upper bound for maximum distance for third order dashed lines

The conformation of third order dashed lines is more complex than that of lower orders, which in fact prevents the same reasoning from being applied in order to find an upper bound: in principle it would be possible to do so, but the cases to be verified would be in excessive number. In order to arrive to a valid upper bound, in this case, it is necessary to use more theoretical tools, through which we get the following result:

Upper bound for maximum distance for third order dashed lines

In a third order dashed line T = (n_1, n_2, n_3) with coprime components, the maximum possible distance between consecutive spaces cannot be more than n_1 \cdot (n_3 + 4).

The starting point of the proof is the Characterization C.3 (Spaces of a third order dashed line), which asserts that, given the dashed line T = (n_1, n_2, n_3) with coprime components, all the spaces x preceding a dash of the first row are given by the following relationship:

where

The set P_T(1), which is not present in the original statement but is in its proof, is reintroduced here for clarity.

The quantity n_1 n_2 + n_1 n_3 + n_2 n_3 corresponds with the total number of dashes, so, for clarity, we define a symbol for representing it:

Then, we define a set, which we’ll name X, containing all the values of x which satisfy the previous relationship, which we can simplify by using tot:

The starting bound on the values of x is due to the fact they are dashes, then, if we indicate the first with 0, the last surely is tot - 1.

The sets X and P_T(1) have both cardinality (n_2 - 1) \cdot (n_3 - 1), because:

- P_T(1), by construction, has cardinality equal to the product of those of the sets \{2, \ldots, n_3\} and \{2, \ldots, n_2\}, i.e. (n_3 - 1) \cdot (n_2 - 1);
- The number of remainders allowed for the division on which the definition of X is based, as it is defined, is equal to the cardinality of P_T(1), then, consequently, it is also the number of allowed values of x.

Given each x \in \{0, \ldots, 30\}, all the corresponding 16 x \mathrm{\ mod\ } 31 are the following, in which the ones belonging to P_T(1) are underlined:

Taking only the underlined items, we just obtain P_T(1).

The definition of X allows to simplify the characterization of spaces for the third order. By indicating with S the set of spaces preceding a dash of the first row, the characterization can be rewritten as follows:

Since we are considering only the dashes of the first component, the function \mathrm{t\_value} turns out to be strictly increasing, because, taking only the first row, each dash corresponds to a distinct value of \mathrm{t\_value}, which is a different column. If instead we had considered multiple rows, there could have been the possibility of having more dashes in the same column, and therefore they could have had the same \mathrm{t\_value} in correspondence with two different dashes.

From the definition of P_T(1), we can also observe that it can be seen as the union of multiple sets, given i \in \{2, \ldots n_3\}:

These sets are surely disjointed by construction, and their union is P_T(1), so, by definition, \{A_2, \ldots A_{n_3}\} is a *partition* of it, with cardinality n_3 - 2.

Let’s apply the same principle to X, defining, for i \in \{2, \ldots n_3\}, the sets

Also these sets, the union of which is X by construction, are disjointed, then \{X_2, \ldots X_{n_3}\} is in turn a partition of X, and also it has cardinality n_3 - 2 by construction.

Now that we have obtained a partition of X, we can use it to create one of S: always given i \in \{2, \ldots n_3\}, we define

This way, since also the S_i are disjointed by construction, we have that \{S_2, \ldots S_{n_3} \} is precisely a partition of S, and it also has cardinality n_3 - 2.

Let’s now analyze the sets X_i for i \in \{2, \ldots, n_3\}, defining the following symbols:

The Y_q just defined can be used in turn to divide the X_i: in fact, we observe that

As the values of y_j have been defined, the distance between y_j and y_{j + 1} is always \lfloor tot / n_2 \rfloor or \lceil tot / n_2 \rceil; this equivalence can be proved through the properties of the “integer part” functions \lfloor x \rfloor and \lceil x \rceil.

Let’s apply, to the first addend of (2), the property 2.21 shown in Teoria dei tratteggi, page 66, which states that \lfloor (a + k) / b \rfloor = \lfloor a / b \rfloor + \lfloor (k + a \mathrm{\ mod\ } b) / b\rfloor, setting a := tot \cdot j, b := n_2 and k := tot:

Replacing the first addend of (2) with the one obtained this way, we have:

We apply property 2.21 to the member to the right of (3), setting this time a := tot, b := n_2 and k := (tot \cdot j) \mathrm{\ mod\ } n_2:

This way, (3) becomes

The second addend of (4) is a fraction, the numerator of which is (tot \cdot j) \mathrm{\ mod\ } n_2 + tot \mathrm{\ mod\ } n_2, formed in turn by two addends, (tot \cdot j) \mathrm{\ mod\ } n_2 e tot \mathrm{\ mod\ } n_2. These two addends are both remainders of a division by n_2, so they must necessarily be less than n_2. So, adding them, we have:

If we take up the second addend of (4) at this point, we can then apply this inequality to it:

Since n_2 can be simplified in the fraction, and since \lfloor 2 \rfloor = 2, this inequality becomes

The left member of this inequality is an integer part, so it is definitely an integer, so it is an integer less than 2, i.e. it can only be 0 or 1:

By combining the latter condition with (4), we have:

i.e.

This allows us to complete the proof, taking advantage of the equality \lfloor x \rfloor + 1 = \lceil x \rceil, which applies when x is not an integer. In our case, in fact

and, since n_1, n_2 and n_3 are coprime, being components of the dashed line, n_1 \cdot n_3 / n_2 cannot be an integer (otherwise the numerator would be divisible by the denominator, which would be possible only if the numerator and denominator had common divisors), so tot/n_2 is not, either. So we have:

So (5) can be rewritten like this:

which completes the proof.

We have therefore shown that the set Y is made of elements spaced almost at regular intervals; now let’s try the same reasoning on the sets X_i, in order to check if their elements have similar regularities.

so, the values of y_j are:

- y_0 = \lfloor (59 \cdot 0) / 5 \rfloor = 0;
- y_1 = \lfloor (59 \cdot 1 / 5 \rfloor = 11;
- y_2 = \lfloor (59 \cdot 2 / 5 \rfloor = 23;
- y_3 = \lfloor (59 \cdot 3 / 5 \rfloor = 35;
- y_4 = \lfloor (59 \cdot 4 / 5 \rfloor = 47;

so we have Y = \{0, 11, 23, 35, 47\}. The sets Y_j are:

- Y_0 = Y \setminus \{y_0\} = \{11, 23, 35, 47\};
- Y_1 = Y \setminus \{y_1\} = \{0, 23, 35, 47\};
- Y_2 = Y \setminus \{y_2\} = \{0, 11, 35, 47\};
- Y_3 = Y \setminus \{y_3\} = \{0, 11, 23, 47\};
- Y_4 = Y \setminus \{y_4\} = \{0, 11, 23, 35\};

The sets A_i are:

- A_2 = \{5 \cdot 2 + 7 \cdot b \mid b \in \{2, \ldots, 5\}\} = \{24, 31, 38, 45\};
- A_3 = \{5 \cdot 3 + 7 \cdot b \mid b \in \{2, \ldots, 5\}\} = \{29, 36, 43, 50\};
- A_4 = \{5 \cdot 4 + 7 \cdot b \mid b \in \{2, \ldots, 5\}\} = \{34, 41, 48, 55\};
- A_5 = \{5 \cdot 5 + 7 \cdot b \mid b \in \{2, \ldots, 5\}\} = \{39, 46, 53, 60\};
- A_6 = \{5 \cdot 6 + 7 \cdot b \mid b \in \{2, \ldots, 5\}\} = \{44, 51, 58, 65\};
- A_7 = \{5 \cdot 7 + 7 \cdot b \mid b \in \{2, \ldots, 5\}\} = \{49, 56, 63, 70\};

The X_i are (considering that the remainders of the division between m and 59 can only go from 0 to 58):

- X_2 = \{x \mid (5 + 7) \cdot 2 \cdot x \mathrm{\ mod\ } 59 \in A_2\} = \{1, 24, 36, 48\};
- X_3 = \{x \mid (5 + 7) \cdot 3 \cdot x \mathrm{\ mod\ } 59 \in A_3\} = \{7, 19, 31, 43\};
- X_4 = \{x \mid (5 + 7) \cdot 4 \cdot x \mathrm{\ mod\ } 59 \in A_4\} = \{2, 14, 26, 49\};
- X_5 = \{x \mid (5 + 7) \cdot 5 \cdot x \mathrm{\ mod\ } 59 \in A_5\} = \{9, 32, 44, 56\};
- X_6 = \{x \mid (5 + 7) \cdot 6 \cdot x \mathrm{\ mod\ } 59 \in A_6\} = \{15, 27, 39, 51\};
- X_7 = \{x \mid (5 + 7) \cdot 7 \cdot x \mathrm{\ mod\ } 59 \in A_7\} = \{10, 22, 34, 57\}.

Analyzing the X_i, we notice how they have a structure almost similar to that of the y_j, but with a particularity. In the case of the y_j, the distance between y_ {j + 1} and y_j was always equal to \lfloor tot / n_2 \rfloor = \lfloor 59 / 5 \rfloor = 11 or to \lceil tot / n_2 \rceil = \lceil 59 / 5 \rfloor = 12, while the one between an element of X_i and the next one is almost always equal to one of these values, except in a pair of elements. For example, the distances between the consecutive elements of X_2 are as follows:

- 24 - 1 = 23;
- 36 - 24 = 12 = \lceil tot / n_2 \rceil;
- 48 - 36 = 12 = \lceil tot / n_2 \rceil.

The distance between the second element and the first one does not follow the main rule, since 23 is neither \lfloor tot / n_2 \rfloor nor \lceil tot / n_2 \rceil; however, it can be observed that it is equal to their sum. So if the right element was added to each X_i, the rule would be respected.

To find out what is the missing element in each set, we can take advantage of (1), given that, as it is possible to verify:

- X_2 = \{(1 + y) \mathrm{\ mod\ } 59 \mid y \in Y_1\};
- X_3 = \{(43 + y) \mathrm{\ mod\ } 59 \mid y \in Y_1\};
- X_4 = \{(26 + y) \mathrm{\ mod\ } 59 \mid y \in Y_1\};
- X_5 = \{(9 + y) \mathrm{\ mod\ } 59 \mid y \in Y_1\};
- X_6 = \{(4 + y) \mathrm{\ mod\ } 59 \mid y \in Y_0\};
- X_7 = \{(34 + y) \mathrm{\ mod\ } 59 \mid y \in Y_1\};

If, for each set obtained, we replaced Y_q with \{y_q\}, we would obtain sets containing only one element, which we will call m_i, which are the following:

- \{m_2\} = \{(1 + y) \mathrm{\ mod\ } 59 \mid y \in \{y_1\}\} = \{(1 + y_1) \mathrm{\ mod\ } 59\} = \{(1 + 11) \mathrm{\ mod\ } 59\} = \{12\};
- \{m_3\} = \{(43 + y) \mathrm{\ mod\ } 59 \mid y \in \{y_1\}\} = \{(43 + y_1) \mathrm{\ mod\ } 59\} = \{(43 + 11) \mathrm{\ mod\ } 59\} = \{54\};
- \{m_4\} = \{(26 + y) \mathrm{\ mod\ } 59 \mid y \in \{y_1\}\} = \{(26 + y_1) \mathrm{\ mod\ } 59\} = \{(26 + 11) \mathrm{\ mod\ } 59\} = \{37\};
- \{m_5\} = \{(9 + y) \mathrm{\ mod\ } 59 \mid y \in \{y_1\}\} = \{(9 + y_1) \mathrm{\ mod\ } 59\} = \{(9 + 11) \mathrm{\ mod\ } 59\} = \{20\};
- \{m_6\} = \{(4 + y) \mathrm{\ mod\ } 59 \mid y \in \{y_0\}\} = \{(4 + y_0) \mathrm{\ mod\ } 59\} = \{(4 + 0) \mathrm{\ mod\ } 59\} = \{4\};
- \{m_7\} = \{(34 + y) \mathrm{\ mod\ } 59 \mid y \in \{y_1\}\} = \{(34 + y_1) \mathrm{\ mod\ } 59\} = \{(34 + 11) \mathrm{\ mod\ } 59\} = \{45\}.

As can be easily verified, the sets X_i \cup \{m_i\} are such that the distance between one element and the next one is always 11 or 12, therefore the m_i are just the missing elements we were looking for.

To continue, let’s define a new set, which we will indicate with M (“Missing”), which contains all the m_i found in the example. This set, which in the case of the example is M = \{4, 12, 20, 37, 45, 54\}, in turn has a regularity similar to that one seen in the X_i: if in fact we calculate the distance between one of its elements and the next, we’ll obtain

- 12 - 4 = 8;
- 20 - 12 = 8;
- 37 - 20 = 17;
- 45 - 37 = 8;
- 54 - 45 = 9.

In this case, we see that the distance between one element and the next one is 8 or 9, except in one case (between 20 and 37), in which it is equal to their sum. The main rule, in this case, turns out to be that the distance is almost always equal to 8 = \lfloor 59 / 7 \rfloor = \lfloor tot / n_3 \rfloor or to 8 = \lceil 59 / 7 \rceil = \lceil tot / n_3 \rceil; in particular, we can observe that this distance is never less than \lfloor tot / n_3 \rfloor, which is an important aspect for the remaining part of the proof.

need formal demonstrations, but they are verifiable for any dashed line, following the same steps seen in the example.

Thanks to these intermediate considerations, we can take the main problem, i.e. find an upper bound for the distance between the elements of S (the spaces), and review it using the sets we have defined: the calculation of the maximum distance between the consecutive elements of S in fact can be traced, like S and X, to the calculation of the maximum distance between consecutive elements of X, which in turn has been partitioned as \{X_2, \ldots, X_{n_3}\}.

Let’s start again from (1), which allows us, given two appropriate k and q, to rewrite X_i as

Let’s also define a new set, which we will call X'_i, formed starting from X_i by adding the element m_i:

By (7), we can therefore say that the distance between its elements is equal to \lfloor tot / n_3 \rfloor or to \lceil tot / n_3 \rceil, so the maximum possible one is \lceil tot / n_3 \rceil.

By how X'_i is defined, it is also true that

At this point, let’s analyze the distance between the consecutive elements of X, considering the fact that the starting hatch has period tot, so also the elements of X have the same period: for this, given two elements x_p and x_q = x_p + tot that belong to it, we have x_p \mathrm{\ mod\ } tot = x_q \mathrm{\ mod\ } tot. For this reason, the analysis can be carried out even only between the elements of X up to tot, and we will speak, rather than consecutive elements, about elements “cyclically consecutive”, given that they follow one another in a cycle, period after period.

Let’s ask ourselves, taken x \in X_2, how much the maximum distance between two cyclically consecutive elements can be worth. The fact of referring to X_2 instead of X is a sufficient simplification, since the reasoning would be identical if we took for example X_3 or any other X_i.

To continue, let’s define a new set I, which contains all the cyclically consecutive integers with respect to a generic x \in X_2:

The cardinality of the set, which can be obtained from the definition of X_2, is certainly \lfloor tot / n_2 \rfloor, so we can rewrite the expression like this:

This set is related to our X, in fact the cyclically consecutive elements of the other sets X'_3, \ldots, X'_{n_3}, for (7), have a distance equal to \lfloor tot / n_3 \rfloor or \lceil tot / n_3 \rceil, and these sets, as they are defined, are certainly disjointed. So, I definitely contains an element of each of them, and this element is unique, because:

- If I did not contain an element of X'_3, then, as this set is defined, there would be an element less than x and another one greater than x + \lfloor tot/n_2\rfloor, and these two elements would be at least distant from each other x + \lfloor tot/n_2 \rfloor + 1 - (x-1) = \lfloor tot/n_2 \rfloor + 2 = \lceil tot/n_2 \rceil + 1 \gt \lceil tot/n_2 \rceil, and this is not possible, because it would be greater than the allowed distance;
- If I contained more than one element of X'_3, these elements would be distant from each other at most x + \lfloor tot/n_2 \rfloor - (x + 1) = \lfloor tot/n_2 \rfloor - 1 \lt \lfloor tot/n_2 \rfloor, and this is not possible, because it would be less than the allowed distance;
- The same reasoning is applicable to the other X'_i, varying the index.

So, I contains one element for each of the X'_3, \ldots, X'_{n_3}, so it contains at least as many elements as the number of these sets, i.e. n_3 - 2:

For (9), since surely X'_3 \cup \ldots \cup X'_{n_3} \subset X \cup M, these n_3 - 2 elements of I also belong to X \cup M, so we have

Then, let’s look for a criterion to exclude from I the elements of M : as they are defined, we know that they have a minimum distance of \lfloor tot / n_3 \rfloor, so I, which is formed by \lfloor tot / n_2 \rfloor consecutive integers, can contain at most \lceil \lfloor tot / n_3 \rfloor / \lfloor tot / n_2 \rfloor \rceil elements, since, in general, a set of n consecutive integers can contain at most \lceil n / m \rceil multiples of another integer m.

Through this relationshipship, we can find an upper bound for for the cardinality of the set that contains the elements of I which are also in X:

*distributive property*between union and intersection:

Let’s pass to the cardinality, keeping in mind that |A \cup B| = |A| + |B| - |A \cap B|:

Since X and M are disjointed, their intersection is empty, so the cardinality of the set on the right (which therefore is empty) is zero:

Let’s swap the terms of equality and leave |I \cap X| alone to the left:

Let’s combine this relationship with (11):

We’ve said that I \cap M cannot contain more than \lceil \lfloor tot/n_3 \rfloor / \lfloor tot/n_2 \rfloor \rceil consecutive integers, i.e. that

Let’s combine this inequality obtained with a particular property of the components of third order dashed lines, which is the following:

then:

then:

then, reversing the sign of inequality and replacing in the previous relationship related to |I \cap X|:

Then, the elements of I which are also in X are at least n_3 - 2 - \lceil n_3 / n_2 \rceil.

Now we can calculate the maximum distance between an element of X and the cyclically consecutive one, which is the last step necessary to be able to pass to the calculation of the maximum distance between consecutive spaces. To do this, we have to start from the last element of I, which is x + \lfloor tot + n_2 \rfloor, and proceed backwards until we get to the first element and overtake it: we will have, in an orderly fashion, x + \lfloor tot + n_2 \rfloor - 1, x + \lfloor tot + n_2 \rfloor - 2, until reaching the cyclically consecutive one, which is

Therefore, the maximum distance between any element x of X and the cyclically consecutive one is the difference between their two values:

Since n_2 and n_3 are coprime, n_3 /n_2 is not an integer number, so the relationship \lfloor n_3 /n_2 \rfloor + 1 = \lceil n_3 /n_2 \rceil is true, then:

Now that we have calculated the maximum possible distance between any two cyclically consecutive elements of X, we can complete the proof, moving on to calculate that between consecutive spaces. Let’s go back to the initial definition of the set S of the spaces preceding a dash of the first row of a dashed line:

We take any space s \in S, and its consecutive s' \gt s. Then, by how S is defined, there will be x and y belonging to X such that s = \mathrm{t\_value}(x) − 1, and s' = \mathrm{t\_value}(y) − 1. Since, in our case, the function \mathrm{t\_value} is strictly increasing (because we are considering only the dashes of the first row), the distance between s' and s is maximum when the one between y and x is maximum.

But the maximum distance between x and y is equal to D, so we have y \leq x + D, therefore we have:

Since y \leq x + D, and since \mathrm{t\_value} is strictly increasing in our case, we also have \mathrm{t\_value}(y) \leq \mathrm{t\_value}(x + D), so the previous relationship becomes:

Applying the Hypothesis T.1 (Range of possible values for a downcast function of linear *t* from the third to the first order), replacing j = 2, k = 3, and n_i n_j + n_i n_k + n_j n_k = tot, we can determine the extreme values of \mathrm{t\_value}(x) for the first row:

Let’s do the same for \mathrm{t\_value}(x + D); the related formulas are identical to the previous ones, but with x + Dinstead of x. Considering all possible combinations, the distance obtained in (13) is maximum when the value of \mathrm{t\_value}(x + D) is the highest possible, and when that of \mathrm{t\_value}(x) is as low as possible, i.e. we have to take

Now, in order to finish the proof, it’s enough to start from the distance \mathrm{t\_value}(x + D) - \mathrm{t\_value}(x), replacing the two terms like above in order to maximize the distance, and perform the intermediate calculations.

The left fraction cannot be an integer, since n_2, n_3 and tot are coprime, so we can replace \lceil \ldots \rceil with \lfloor \ldots \rfloor + 1, so the previous relationship becomes

The expression in brackets, which is the difference between two integer parts, can be given an upper bound by applying some properties of the integer part. Let’s start from the first term of the difference:

Let’s apply property 2.21 shown in Teoria dei tratteggi, page 66, which states that \lfloor (a + k) / b \rfloor = \lfloor a / b \rfloor + \lfloor (k + a \mathrm{\ mod\ } b) / b\rfloor, setting a := n_2 \cdot n_3 \cdot D, k := n_2 \cdot n_3 \cdot x + n_2 + n_3 and b := tot:

Surely \forall q : q \mathrm{\ mod\ } tot \leq tot, then:

If k is a relative number, we have \lfloor a + k \rfloor = \lfloor a \rfloor + k, then:

In total, the following relationship is obtained from this sequence of calculations, which takes up the first term of the subtraction present in (15):

then

Using this inequality, we can have an upper bound for (15) like this:

Ler’s use (12) in order to replace D with its value:

Since \lfloor q \rfloor \leq q, this expression can be given an upper bound like this:

Let’s analyze the term -n_2 (n_3)^2 + 4 n_2 n_3 + (n_3)^2: we have

(since n_2 \geq 3 by hypothesis, then -(n_2 - 1) \leq 2)

(since n_2 \geq 3 by hypothesis)

(since surely p + q \gt p if q \gt 0)

(by definition of tot)

In total:

Let’s use this relation to give an upper bound, in turn, to (16):

Combining it with (14) from which we started, we have:

Then, the final result is the following:

That is, the maximum distance between any space s and the consecutive s' is n_1 \cdot (n_3 + 4), which was the initial thesis to be proved.

## Upper bound for maximum distance for dashed lines of any order

The final purpose of this study is to find an upper bound that applies to any dashed line, so the next step is to analyze dashed lines from the fourth order upwards, in order to cover the missing part of the analysis. One possible investigation is the fact that the upper bound found for the third order, i.e. n_1 \cdot (n_3 + 4), can be seen as n_1 \cdot (n_k + 4) with k = 3. Seen this way, taking k \in \{1, 2\}, the formula is also valid for first and second order, considering that:

- In a first order dashed line we have n_k = n_1, so the upper bound would be n_1 \cdot (n_1 + 4). Since n_1 \geq 2, it means that the minimum value of the upper bound is 2 \cdot (2 + 4) = 12. We know that the maximum possible distance for the first order dashed line is 2, and certainly 2 \leq 12, therefore the upper bound given by the formula is acceptable.
- In a second order dashed line we have n_k = n_2, so the upper bound would be n_1 \cdot (n_2 + 4). Since n_1 \geq 2 and n_2 \geq 3, it means that the minimum value of the upper bound is 2 \cdot (3 + 4) = 14. We know that the maximum possible distance for the dashed lines of the second order is 4, and certainly 4 \leq 12, so the upper bound given by the formula is acceptable also in this case.