Big Ramsey Degrees in Ultraproducts of Finite Structures
University of East Anglia(东英吉利大学)
Dana Bartošová, Mirna Džamonja, Rehana Patel, Lynn Scow
备注:
This is the final authors' version. The first 37 pages correspond to the the journal version, the last 5 pages are an additional argument added 02/12/2025, in which we give the proof of the first sentence of Section 6 (not given in the original paper) and acknowledge the contribution of Jouko Väänänen
We develop a transfer principle of structural Ramsey theory from finite structures to ultraproducts. We show that under certain mild conditions, when a class of finite structures has finite small Ramsey degrees, under the (Generalized) Continuum Hypothesis the ultraproduct has finite big Ramsey degrees for internal colorings. The necessity of restricting to internal colorings is demonstrated by the example of the ultraproduct of finite linear orders. Under CH, this ultraproduct $\fLL^*$ has, as a spine, $η_1$, an uncountable analogue of the order type of rationals $η$. Finite big Ramsey degrees for $η$ were exactly calculated by Devlin in \cite{Devlin}. It is immediate from \cite{Tod87} that $η_1$ fails to have finite big Ramsey degrees. Moreover, we extend Devlin's coloring to $η_1$ to show that it witnesses big Ramsey degrees of finite tuples in $η$ on every copy of $η$ in $η_1,$ and consequently in $\fLL^*$. This work gives additional confirmation that ultraproducts are a suitable environment for studying Ramsey properties of finite and infinite structures.
Big Ramsey degrees and the two-branching pseudotree
Institute of Mathematics of the Czech Academy of Sciences(捷克科学院数学研究所);Charles University(查理大学);University of Notre Dame(圣母大学);University of Vienna(维也纳大学)
Oscillating subalgebras of the atomless countable Boolean algebra
University of Florida(佛罗里达大学);Charles University(查理大学);Institute of Mathematics of the Czech Academy of Sciences(捷克科学院数学研究所);University of Waterloo(滑铁卢大学);TU Dresden(德累斯顿工业大学);University of Toronto(多伦多大学);Institut de Mathématiques de Jussieu, CNRS(巴黎第七大学/法国国家科学研究中心儒勒·让塞数学研究所);Matematički Institut, SANU(塞尔维亚科学与艺术学院数学研究所)
The Complexity of Network Satisfaction Problems for Symmetric Relation Algebras with a Flexible Atom
Robin Hirsch在1996年提出了“真正的大复杂性问题”:对所有有限关系代数A的网络满意度问题的计算复杂性进行分类。我们提供了一个完整的分类的情况下,A是对称的,并有一个灵活的原子;在这种情况下,问题是NP完全或在P的分类任务可以减少到的情况下,A是整数。如果一个有限积分关系代数有一个柔性原子,则它有一个正规表示B。然后,我们可以研究的计算复杂性的网络满意度问题的A使用泛代数方法,通过分析的多态性B。我们还使用了一个拉姆齐型的结果Nešetziil和Rödl和复杂性二分的结果Bulatov保守的有限域约束满足问题。