Generator-offset property: Difference between revisions
→Case analysis: if it were 0 then the word would be a multimos |
|||
| Line 207: | Line 207: | ||
(The lower bound is reached if Λ<sub>3</sub> has chunks of sizes floor(''n''/μ) − 1 and floor(''n''/μ), and the upper bound is reached if Λ<sub>3</sub> has chunks of sizes floor(''n''/μ) and ceil(''n''/μ).) | (The lower bound is reached if Λ<sub>3</sub> has chunks of sizes floor(''n''/μ) − 1 and floor(''n''/μ), and the upper bound is reached if Λ<sub>3</sub> has chunks of sizes floor(''n''/μ) and ceil(''n''/μ).) | ||
The difference between the chunk sizes of Λ<sub>3</sub> is ''y'' − ''x'', which must be | The difference between the chunk sizes of Λ<sub>3</sub> is ''y'' − ''x'', which must be 1 since Λ<sub>3</sub> is pairwise well-formes. We thus have the following subcases: (In the following, chunk of Λ<sub>2</sub> means chunk of β, and chunk of Λ<sub>3</sub> means chunk of γ.) | ||
'''Case 3.1:''' (''x'', ''y'') = (floor(''n''/μ), 2*floor(''n''/μ) − 1). | '''Case 3.1:''' (''x'', ''y'') = (floor(''n''/μ), 2*floor(''n''/μ) − 1). | ||