Parameter word

Formally, a ${\displaystyle k}$ -parameter word of length ${\displaystyle n}$ , over a given alphabet ${\displaystyle A}$ , is a sequence of ${\displaystyle n}$  characters, some of which may be drawn from ${\displaystyle A}$  and the others of which are ${\displaystyle k}$  distinct wildcard characters ${\displaystyle *_{1},*_{2},\ldots ,*_{k}}$ . Each wildcard character is required to appear at least once, but may appear multiple times, and the wildcard characters must appear in the order given by their indexes: the first wildcard character in the word must be ${\displaystyle *_{1}}$ , the next one that is different from ${\displaystyle *_{1}}$  must be ${\displaystyle *_{2}}$ , etc. As a special case, a word over the given alphabet, without any wildcard characters, is said to be a 0-parameter word. For 1-parameter words, the subscripts may be omitted, as there is no ambiguity between different wildcard characters. The set of all ${\displaystyle k}$ -parameter words over ${\displaystyle A}$ , of length ${\displaystyle n}$ , is denoted ${\displaystyle A{\tbinom {n}{k}}}$ .^[1]

A ${\displaystyle k}$ -parameter word represents a set of ${\displaystyle |A|^{k}}$  strings (0-parameter words), obtained by substituting a symbol of ${\displaystyle A}$  for each wildcard character. This set of strings is called a parameter set of combinatorial cube, and ${\displaystyle k}$  is called its dimension. A one-dimensional combinatorial cube may be called a combinatorial line.^[1]

In a combinatorial cube, each copy of a particular wildcard character must have the same replacement. A generalization of parameter words allows different copies of the same wildcard character to be replaced by different characters from the alphabet, in a controlled way. If ${\displaystyle A}$  is an alphabet and ${\displaystyle G}$  is a group with an action on ${\displaystyle A}$ , then a ${\displaystyle G}$ -labeled parameter word is a ${\displaystyle k}$ -parameter word together with an assignment of a group element to each wildcard character in the word. The first occurrence of each wildcard character must be assigned the identity element of the group. Then, the strings represented by a labeled parameter word are obtained by choosing a character of ${\displaystyle A}$  for each wildcard character, and substituting the result of combining that character with the group element labeling each copy of that character. The set of all ${\displaystyle G}$ -labeled ${\displaystyle k}$ -parameter words over ${\displaystyle A}$ , of length ${\displaystyle n}$ , is denoted ${\displaystyle [A,G]{\tbinom {n}{k}}}$ .^[1]

In the game of tic-tac-toe, the cells of the game board can be given two integer coordinates ${\displaystyle (x,y)}$  from the alphabet ${\displaystyle \{1,2,3\}}$ . Concatenating these two coordinates produces a string representing each cell, one of the nine strings ${\displaystyle 11,12,13,21,22,23,31,32,}$  or ${\displaystyle 33}$ . There are seven one-parameter words of length two over this alphabet, the words ${\displaystyle 1*,2*,3*,*1,*2,*3,}$  and ${\displaystyle **}$ . The corresponding combinatorial lines form seven of the eight lines of three cells in a row of the tic-tac-toe board; for instance, the one-parameter word ${\displaystyle 2*}$  corresponds to the combinatorial line ${\displaystyle \{21,22,23\}}$ , and the one-parameter word ${\displaystyle **}$  corresponds to the combinatorial line ${\displaystyle \{11,22,33\}}$ .^[2]

However, one of the eight winning lines of the tic-tac-toe game is missing from this set of combinatorial lines: the antidiagonal line ${\displaystyle \{13,22,31\}}$ . It is possible to obtain this line as a combinatorial line (without including any other combinations of cells that would be invalid for tic-tac-toe) by using a group with two elements, and an action in which the non-identity element swaps the alphabet letters ${\displaystyle 1}$  and ${\displaystyle 3}$  while leaving the element ${\displaystyle 2}$  in place. There are eight labeled one-parameter words of length two for this action, seven of which are obtained from the unlabeled one-parameter words by using the identity label for all wildcards. These seven have the same combinatorial lines as before. The eighth labeled word consists of the word ${\displaystyle **}$  labeled by the identity element for its first ${\displaystyle *}$  and the reversing non-identity element for the second ${\displaystyle *}$ ; its combinatorial line is the final winning line of the tic-tac-toe board, ${\displaystyle \{13,22,31\}}$ .^[2]

For three given integer parameters ${\displaystyle n\geq m\geq k}$ , it is possible to combine two parameter words, ${\displaystyle f\in A{\tbinom {n}{m}}}$  and ${\displaystyle g\in A{\tbinom {m}{k}}}$ , to produce another parameter word ${\displaystyle f\circ g\in A{\tbinom {n}{k}}}$ . To do so, simply replace each copy of the ${\displaystyle i}$ th wildcard symbol in ${\displaystyle f}$  by the ${\displaystyle i}$ th character in ${\displaystyle g}$ . This will necessarily produce a word of length ${\displaystyle n}$  that uses each of the wildcard symbols in ${\displaystyle g}$  at least once, in ascending order, so it produces a valid ${\displaystyle k}$ -parameter word of length ${\displaystyle n}$ . This notion of composition can also be extended to composition of labeled parameter words (both using the same alphabet and group action), by applying the group action to the non-wildcard substituted characters and composing the group labels for the wildcard substituted characters. A subset of a combinatorial cube is a smaller combinatorial cube if it can be obtained by a composition in this way.^[1]

The number of parameter words in ${\displaystyle A{\tbinom {n}{k}}}$  for an alphabet of size ${\displaystyle r}$  is an ${\displaystyle r}$ -Stirling number of the second kind ${\displaystyle \textstyle \left\{{r+n \atop r+k}\right\}_{r}}$ . These numbers count the number of partitions of the integers in the range ${\displaystyle [1,r+n]}$  into ${\displaystyle r+k}$  non-empty subsets such that the first ${\displaystyle r}$  integers belong to distinct subsets. Partitions of this type can be placed into a bijective equivalence with the parameter words, by creating a word with a character for each of the ${\displaystyle n}$  integers in the range ${\displaystyle [r+1,n+r]}$ , setting this character value to be either an integer in ${\displaystyle [1,r]}$  belonging to the same subset of the partition, or a wildcard character for each subset of the partition that does not contain an integer in ${\displaystyle [1,r]}$ . The ${\displaystyle r}$ -Stirling numbers obey a simple recurrence relation by which they may easily be calculated.^[3][4]

In Ramsey theory, parameter words and combinatorial cubes may be used to formulate the Graham–Rothschild theorem, according to which, for every finite alphabet and group action, and every combination of integer values ${\displaystyle m}$ , ${\displaystyle k}$ , and ${\displaystyle r}$ , there exists a sufficiently large number ${\displaystyle n}$  such that if each ${\displaystyle k}$ -dimensional combinatorial cube over strings of length ${\displaystyle n}$  is assigned one of ${\displaystyle r}$  colors, then there exists a ${\displaystyle m}$ -dimensional combinatorial cube all of whose ${\displaystyle k}$ -dimensional subcubes have the same color. This result is a key foundation for structural Ramsey theory, and is used to define Graham's number, an enormous number used to estimate the value of ${\displaystyle n}$  for a certain combination of values.^[1]

In computer science, in the problem of searching for duplicate code, the source code for a given routine or module may be transformed into a parameter word by converting it into a sequence of tokens, and for each variable or subroutine name, replacing each copy of the same name with the same wildcard character. If code is duplicated, the resulting parameter words will remain equal even if some of the variables or subroutines have been renamed. More sophisticated searching algorithms can find long duplicate code sections that form substrings of larger source code repositories, by allowing the wildcard characters to be substituted for each other.^[5]

An important special case of parameter words, well-studied in the combinatorics of words, is given by the partial words. These are strings with wildcard characters that may be substituted independently of each other, without requiring that some of the substituted characters be equal or controlled by a group action. In the language of parameter words, a partial word may be described as a parameter word in which each wildcard symbol appears exactly once. However, because there is no repetition of wildcard symbols, partial words may be written more simply by omitting the subscripts on the wildcard symbols.^[6]

• Regular expression