HOME

TheInfoList



OR:

In mathematics, a thick set is a set of
integer An integer is the number zero (), a positive natural number (, , , etc.) or a negative integer with a minus sign ( −1, −2, −3, etc.). The negative numbers are the additive inverses of the corresponding positive numbers. In the language ...
s that contains arbitrarily long intervals. That is, given a thick set T, for every p \in \mathbb, there is some n \in \mathbb such that \ \subset T.


Examples

Trivially \mathbb is a thick set. Other well-known sets that are thick include non-primes and non-squares. Thick sets can also be sparse, for example: \bigcup_ \.


Generalisations

The notion of a thick set can also be defined more generally for a
semigroup In mathematics, a semigroup is an algebraic structure consisting of a Set (mathematics), set together with an associative internal binary operation on it. The binary operation of a semigroup is most often denoted multiplication, multiplicatively ...
, as follows. Given a semigroup (S, \cdot) and A \subseteq S, A is said to be ''thick'' if for any
finite Finite is the opposite of infinite. It may refer to: * Finite number (disambiguation) * Finite set, a set whose cardinality (number of elements) is some natural number * Finite verb Traditionally, a finite verb (from la, fīnītus, past partici ...
subset F \subseteq S, there exists x \in S such that F \cdot x = \ \subseteq A. It can be verified that when the semigroup under consideration is the natural numbers \mathbb{N} with the addition operation +, this definition is equivalent to the one given above.


See also

*
Cofinal (mathematics) In mathematics, a subset B \subseteq A of a preordered set (A, \leq) is said to be cofinal or frequent in A if for every a \in A, it is possible to find an element b in B that is "larger than a" (explicitly, "larger than a" means a \leq b). Cofin ...
*
Cofiniteness In mathematics, a cofinite subset of a set X is a subset A whose complement in X is a finite set. In other words, A contains all but finitely many elements of X. If the complement is not finite, but it is countable, then one says the set is coco ...
*
Ergodic Ramsey theory Ergodic Ramsey theory is a branch of mathematics where problems motivated by additive combinatorics are proven using ergodic theory. History Ergodic Ramsey theory arose shortly after Endre Szemerédi's proof that a set of positive upper density c ...
* Piecewise syndetic set * Syndetic set


References

* J. McLeod,
Some Notions of Size in Partial Semigroups
, ''Topology Proceedings'', Vol. 25 (Summer 2000), pp. 317-332. *
Vitaly Bergelson Vitaly Bergelson (born 1950 in Kiev) is a mathematical researcher and professor at Ohio State University in Columbus, Ohio. His research focuses on ergodic theory and combinatorics. Bergelson received his Ph.D in 1984 under Hillel Furstenberg a ...
,
Minimal Idempotents and Ergodic Ramsey Theory
, ''Topics in Dynamics and Ergodic Theory 8-39, London Math. Soc. Lecture Note Series 310'', Cambridge Univ. Press, Cambridge, (2003) *
Vitaly Bergelson Vitaly Bergelson (born 1950 in Kiev) is a mathematical researcher and professor at Ohio State University in Columbus, Ohio. His research focuses on ergodic theory and combinatorics. Bergelson received his Ph.D in 1984 under Hillel Furstenberg a ...
, N. Hindman, "Partition regular structures contained in large sets are abundant", ''
Journal of Combinatorial Theory The ''Journal of Combinatorial Theory'', Series A and Series B, are mathematical journals specializing in combinatorics and related areas. They are published by Elsevier. ''Series A'' is concerned primarily with structures, designs, and applicat ...
, Series A'' 93 (2001), pp. 18-36 * N. Hindman, D. Strauss. ''Algebra in the Stone-Čech Compactification''. p104, Def. 4.45. Semigroup theory Ergodic theory