arXiv math/04074982004-07math.LO

The combinatorics of reasonable ultrafilters

Saharon Shelah

发表信息：: Fund. Math. 192 No. 1 (2006) 1--23

英文摘要：

We are interested in generalizing part of the theory of ultrafilters on omega to larger cardinals. Here we set the scene for further investigations introducing properties of ultrafilters in strong sense dual to being normal.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Ultrafilters: Where topological dynamics = algebra = combinatorics

We survey some connections between topological dynamics, semigroups of ultrafilters, and combinatorics. As an application, we give a proof, based on ideas of Bergelson and Hindman, of the Hales-Jewett partition theorem.

1993-09-08math.LO

Combinatorics of ultrafilters on Cohen and random algebras

We investigate the structure of ultrafilters on Boolean algebras in the framework of Tukey reducibility. In particular, this paper provides several techniques to construct ultrafilters which are not Tukey maximal. Furthermore, we connect this analysis with a cardinal invariant of Boolean algebras, the ultrafilter number, and prove consistency results concerning its possible values on Cohen and random algebras.

2021-02-16math.LO

Reasonable ultrafilters, again

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of reasonably bounding forcing notions. We use this to show that consistently there are reasonable ultrafilters on an inaccessible cardinal lambda with generating system of size less than 2^lambda . We also show how reasonable ultrafilters can be killed by forcing notions which have enough reasonable completeness to be iterated with lambda-supports (and we show th…

2010-09-20math.LO

Hypernatural Numbers as Ultrafilters

In this paper we present a use of nonstandard methods in the theory of ultrafilters and in related applications to combinatorics of numbers.

2015-01-23math.LO

Generating ultrafilters in a reasonable way

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in Shelah math.LO/0407498 and studied also in math.LO/0605067. We introduce a general scheme of generating a filter on lambda from filters on smaller sets and we investigate the combinatorics of objects obtained this way.

2007-09-16math.LO

Schur ultrafilters的组合学

Combinatorics of Schur ultrafilters

University of Vienna（维也纳大学）

本文研究了可数交换群上Schur ultrafilters的元素的组合特征，构造了一个自由Schur ultrafilter，它不是无限Schur的，并在连续假设下证明了存在一个自由Schur P-point。

2026-09-25math.COmath.LO

更多相关论文收起更多论文

Using ultrafilters to prove Ramsey-type theorems

Ultrafilters are a tool, originating in mathematical logic and general topology, that has steadily found more and more uses in multiple areas of mathematics, such as combinatorics, dynamics, and algebra, among others. The purpose of this article is to introduce ultrafilters in a friendly manner and present some applications to the branch of combinatorics known as Ramsey theory, culminating with a new ultrafilter-based proof of van der Waerden's theorem.

2022-01-04math.COmath.GNmath.LO

Combinatorics on Ideals and Axiom A

Throughout this abstract let U be a fixed p-point ultrafilter and let I be the dual ideal. Grigorieff forcing is P(U)={p:omega to 2|dom(p) is an element of I} ordered by reverse inclusion. It is well known that Grigorieff forcing is proper. The main result of this paper is the following: THEOREM: Gregorieff forcing does not satisfy Axiom A. To prove this we use the following game, denoted G(U), for two players playing alternatively: Player I plays a partition of omega, {J_n| n<omega}, such that for all n<omega, J_n is an element of I; At the nth turn Player II plays a finite subset F_n of J_n.…

1993-02-26math.LO

整数集上的有限可加测度与加性组合学

Finitely additive measures on $\mathbb Z$ and additive combinatorics

Escuela Superior de Física y Matemáticas Instituto Politécnico Nacional（墨西哥国立理工学院高等物理与数学学院）

该研究以$\text{ba}(\boldsymbol{\text{Z}})$为工具，将超滤子理论方法拓展至测度论场景，证明满足测度阈值的整数子集为$\text{IP}_n$集，还给出示例并讨论开放问题。

2026-07-30math.COmath.FAmath.LO

The combinatorics of splittability

Marion Scheepers, in his studies of the combinatorics of open covers, introduced the property Split(U,V) asserting that a cover of type U can be split into two covers of type V. In the first part of this paper we give an almost complete classification of all properties of this form where U and V are significant families of covers which appear in the literature (namely, large covers, omega-covers, tau-covers, and gamma-covers), using combinatorial characterizations of these properties in terms related to ultrafilters on N. In the second part of the paper we consider the questions whether, given…

2010-10-31math.CAmath.COmath.GN