Generalized Arithmetic Progression
   HOME

TheInfoList



OR:

In
mathematics Mathematics is a field of study that discovers and organizes methods, Mathematical theory, theories and theorems that are developed and Mathematical proof, proved for the needs of empirical sciences and mathematics itself. There are many ar ...
, a generalized arithmetic progression (or multiple arithmetic progression) is a generalization of an
arithmetic progression An arithmetic progression or arithmetic sequence is a sequence of numbers such that the difference from any succeeding term to its preceding term remains constant throughout the sequence. The constant difference is called common difference of that ...
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 In mathematics, a sequence is an enumerated collection of objects in which repetitions are allowed and order matters. Like a set, it contains members (also called ''elements'', or ''terms''). The number of elements (possibly infinite) is cal ...
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 Set, The Set, SET or SETS may refer to: Science, technology, and mathematics Mathematics *Set (mathematics), a collection of elements *Category of sets, the category whose objects and morphisms are sets and total functions, respectively Electro ...
of the form :\ where x_0,x_1,\dots,x_d,L_1,\dots,L_d\in\mathbb. The product L_1L_2\cdots L_d is called the size of the generalized arithmetic progression; the
cardinality The thumb is the first digit of the hand, next to the index finger. When a person is standing in the medical anatomical position (where the palm is facing to the front), the thumb is the outermost digit. The Medical Latin English noun for thum ...
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. This projection is
injective In mathematics, an injective function (also known as injection, or one-to-one function ) is a function that maps distinct elements of its domain to distinct elements of its codomain; that is, implies (equivalently by contraposition, impl ...
if and only if the generalized arithmetic progression is proper.


Semilinear sets

Formally, an arithmetic progression of \mathbb^d is an infinite sequence of the form \mathbf,\mathbf + \mathbf',\mathbf + 2\mathbf',\mathbf + 3\mathbf',\ldots, where \mathbf and \mathbf' are fixed vectors in \mathbb^d, called the initial vector and common difference respectively. A subset of \mathbb^d is said to be linear if it is of the form :\left\, where m is some
integer An integer is the number zero (0), a positive natural number (1, 2, 3, ...), or the negation of a positive natural number (−1, −2, −3, ...). The negations or additive inverses of the positive natural numbers are referred to as negative in ...
and \mathbf,\mathbf_1,\dots,\mathbf_m are fixed vectors in \mathbb^d. A subset of \mathbb^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 Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who introduced it in 1929. The signature of Presburger arithmetic contains only the addition operation and equality, omi ...
.


See also

*
Freiman's theorem In additive combinatorics, a discipline within mathematics, Freiman's theorem is a central result which indicates the approximate structure of sets whose sumset is small. It roughly states that if , A+A, /, A, is small, then A can be contained in ...


References

* {{DEFAULTSORT:Generalized Arithmetic Progression Algebra Combinatorics Arithmetic series