Generalized arithmetic progression

In mathematics, a generalized arithmetic progression (or multiple arithmetic progression) is a generalization of an arithmetic progression equipped with multiple common differences – whereas an arithmetic progression is generated by a single common difference, a generalized arithmetic progression can be generated by multiple common differences. For example, the sequence $17,20,22,23,25,26,27,28,29,\dots$ is not an arithmetic progression, but is instead generated by starting with 17 and adding either 3 or 5, thus allowing multiple common differences to generate it. A semilinear set generalizes this idea to multiple dimensions – it is a set of vectors of integers, rather than a set of integers.

Finite generalized arithmetic progression

A finite generalized arithmetic progression, or sometimes just generalized arithmetic progression (GAP), of dimension d is defined to be a set of the form $$\{x_0+{\ell }_1{x}_1+\cdots +{\ell }_d{x}_d:0\le {\ell }_1<L_1,\dots ,0\le {\ell }_d<L_d\}$$ where $x_0,x_1,\dots ,x_d,L_1,\dots ,L_d\in \mathbb{Z}$. The product $L_1{L}_2\cdots L_d$ is called the size of the generalized arithmetic progression; the cardinality of the set can differ from the size if some elements of the set have multiple representations. If the cardinality equals the size, the progression is called proper. Generalized arithmetic progressions can be thought of as a projection of a higher dimensional grid into $\mathbb{Z}$. This projection is injective if and only if the generalized arithmetic progression is proper.

Semilinear sets

Formally, an arithmetic progression of ${\mathbb{N}}^d$ is an infinite sequence of the form $𝐯,𝐯+{𝐯}^{\prime },𝐯+2{𝐯}^{\prime },𝐯+3{𝐯}^{\prime },\dots$, where $𝐯$ and ${𝐯}^{\prime }$ are fixed vectors in ${\mathbb{N}}^d$, called the initial vector and common difference respectively. A subset of ${\mathbb{N}}^d$ is said to be linear if it is of the form $$\{𝐯+\sum _{i=1}^m{k}_i{𝐯}_i:k_1,\dots ,k_m\in \mathbb{N}\},$$ where $m$ is some integer and $𝐯,{𝐯}_1,\dots ,{𝐯}_m$ are fixed vectors in ${\mathbb{N}}^d$. A subset of ${\mathbb{N}}^d$ is said to be semilinear if it is a finite union of linear sets.

The semilinear sets are exactly the sets definable in Presburger arithmetic.

See also

• Freiman's theorem

Bibliography

• Ginsburg, Seymour; Spanier, Edwin Henry (1966). "Semigroups, Presburger Formulas, and Languages". Pacific Journal of Mathematics. 16 (2): 285–296. doi:10.2140/pjm.1966.16.285.

• Haase, Christoph (2018). "A Survival Guide to Presburger Arithmetic" (PDF). ACM SIGLOG News. 5 (3): 67–82. doi:10.1145/3242953.3242964. S2CID 51847374.

• Nathanson, Melvyn B. (1996). Additive Number Theory: Inverse Problems and Geometry of Sumsets. Graduate Texts in Mathematics. Vol. 165. Springer. ISBN 0-387-94655-1. Zbl 0859.11003.

• Tao, Terence; Vu, Van H. (2006). "Additive geometry". Additive Combinatorics. Cambridge University Press. ISBN 9780521853866.

External link

• Thomas Kern — Regular Languages and Model Theory 23: Semilinear Sets on YouTube