Strongly productive ultrafilters on semigroups (Q284670): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
The finite products set FP\((\vec x)\) associated with a sequence \(\vec x=(x_n)_{n\in\omega}\) of elements of a multiplicative semigroup \(S\) is the set of elements of \(S\) that are products \(\prod_{i\in a}x_i\) taken in increasing order of indices for finite sets \(a\subseteq\omega\). An ultrafilter \(p\) on \(S\) is strongly productive if it has a basis consisting of finite products sets. In the case of additive notation, strongly summable ultrafilters are considered. The semigroup operation naturally extends to the set of all ultrafilters \(\beta S\) on \(S\). The study of strongly summable ultrafilters was started by Hindman in the case of the semigroup of positive integers and later this study was extended for arbitrary abelian groups. In the paper under review, the authors get generalizations of some of these results. They prove that if \(S\) is a commutative semigroup with well-founded universal semilattice of idempotents or a solvable inverse semigroup with well-founded universal semilattice of idempotents, then every strongly productive ultrafilter on \(S\) is idempotent. They also answer a question of Hindman and Legette Jones by proving that any very strongly productive ultrafilter on the free semigroup with countably many generators is sparse.
Property / review text: The finite products set FP\((\vec x)\) associated with a sequence \(\vec x=(x_n)_{n\in\omega}\) of elements of a multiplicative semigroup \(S\) is the set of elements of \(S\) that are products \(\prod_{i\in a}x_i\) taken in increasing order of indices for finite sets \(a\subseteq\omega\). An ultrafilter \(p\) on \(S\) is strongly productive if it has a basis consisting of finite products sets. In the case of additive notation, strongly summable ultrafilters are considered. The semigroup operation naturally extends to the set of all ultrafilters \(\beta S\) on \(S\). The study of strongly summable ultrafilters was started by Hindman in the case of the semigroup of positive integers and later this study was extended for arbitrary abelian groups. In the paper under review, the authors get generalizations of some of these results. They prove that if \(S\) is a commutative semigroup with well-founded universal semilattice of idempotents or a solvable inverse semigroup with well-founded universal semilattice of idempotents, then every strongly productive ultrafilter on \(S\) is idempotent. They also answer a question of Hindman and Legette Jones by proving that any very strongly productive ultrafilter on the free semigroup with countably many generators is sparse. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Miroslav Repický / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 22A15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 54D35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 54D80 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6581739 / rank
 
Normal rank
Property / zbMATH Keywords
 
ultrafilters
Property / zbMATH Keywords: ultrafilters / rank
 
Normal rank
Property / zbMATH Keywords
 
strongly productive ultrafilters
Property / zbMATH Keywords: strongly productive ultrafilters / rank
 
Normal rank
Property / zbMATH Keywords
 
commutative semigroups
Property / zbMATH Keywords: commutative semigroups / rank
 
Normal rank
Property / zbMATH Keywords
 
solvable groups
Property / zbMATH Keywords: solvable groups / rank
 
Normal rank
Property / zbMATH Keywords
 
solvable inverse semigroups
Property / zbMATH Keywords: solvable inverse semigroups / rank
 
Normal rank
Property / zbMATH Keywords
 
Čech-Stone compactification
Property / zbMATH Keywords: Čech-Stone compactification / rank
 
Normal rank
Property / zbMATH Keywords
 
finite products
Property / zbMATH Keywords: finite products / rank
 
Normal rank

Revision as of 18:21, 27 June 2023

scientific article
Language Label Description Also known as
English
Strongly productive ultrafilters on semigroups
scientific article

    Statements

    Strongly productive ultrafilters on semigroups (English)
    0 references
    18 May 2016
    0 references
    The finite products set FP\((\vec x)\) associated with a sequence \(\vec x=(x_n)_{n\in\omega}\) of elements of a multiplicative semigroup \(S\) is the set of elements of \(S\) that are products \(\prod_{i\in a}x_i\) taken in increasing order of indices for finite sets \(a\subseteq\omega\). An ultrafilter \(p\) on \(S\) is strongly productive if it has a basis consisting of finite products sets. In the case of additive notation, strongly summable ultrafilters are considered. The semigroup operation naturally extends to the set of all ultrafilters \(\beta S\) on \(S\). The study of strongly summable ultrafilters was started by Hindman in the case of the semigroup of positive integers and later this study was extended for arbitrary abelian groups. In the paper under review, the authors get generalizations of some of these results. They prove that if \(S\) is a commutative semigroup with well-founded universal semilattice of idempotents or a solvable inverse semigroup with well-founded universal semilattice of idempotents, then every strongly productive ultrafilter on \(S\) is idempotent. They also answer a question of Hindman and Legette Jones by proving that any very strongly productive ultrafilter on the free semigroup with countably many generators is sparse.
    0 references
    ultrafilters
    0 references
    strongly productive ultrafilters
    0 references
    commutative semigroups
    0 references
    solvable groups
    0 references
    solvable inverse semigroups
    0 references
    Čech-Stone compactification
    0 references
    finite products
    0 references

    Identifiers