English
Related papers

Related papers: The adjacent Hindman's theorem for uncountable gro…

200 papers

In a paper from 1997, Shelah asked whether $Pr_1(\lambda^+,\lambda^+,\lambda^+,\lambda)$ holds for every inaccessible cardinal $\lambda$. Here, we prove that an affirmative answer follows from $\square(\lambda^+)$. Furthermore, we establish…

Logic · Mathematics 2022-02-22 Assaf Rinot , Jing Zhang

Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman's Theorem. It is an open…

Logic · Mathematics 2016-08-04 Wen Chean Teh

Hindman proved in 1979 that no matter how natural numbers are colored in r colors, for a fixed positive integer r, there is an infinite subset X of numbers and a color t such that for any finite non-empty subset X' of X, the color of the…

Combinatorics · Mathematics 2021-09-22 Maria Axenovich , David S. Gunderson , Hanno Lefmann

Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…

General Topology · Mathematics 2017-11-09 Boaz Tsaban

We consider the strength and effective content of restricted versions of Hindman's Theorem in which the number of colors is specified and the length of the sums has a specified finite bound. Let $\mathsf{HT}^{\leq n}_k$ denote the assertion…

We discuss the rainbow Ramsey theorems at limit cardinals and successors of singular cardinals, addressing some questions in \cite{MR2354904} and \cite{MR2902230}. In particular, we show for inaccessible $\kappa$,…

Logic · Mathematics 2019-12-03 Jing Zhang

Hindman proved that, whenever the set $\mathbb{N}$ of naturals is finitely colored, there must exist non-constant monochromatic solution of the equation $a+b=cd$. In this paper we extend this result for dense subsemigroups of $((0, \infty),…

Combinatorics · Mathematics 2020-11-17 Sourav Kanti Patra , Md Moid Shaikh

Assume G.C.H. and kappa is the first uncountable cardinal such that there is a kappa-free abelian group which is not a Whitehead (abelian) group. We prove that kappa is necessarily an inaccessible cardinal

Logic · Mathematics 2011-06-13 Saharon Shelah

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem: Suppose $\kappa$ is a singular strong limit cardinal and…

Logic · Mathematics 2016-09-06 Moti Gitik , William Mitchell

Hindman's finite sums theorem states that in any finite coloring of the naturals, there is an infinite sequence all of whose finite subset sums are the same color. In 1979, Hindman showed that there is a finite coloring of the naturals so…

Combinatorics · Mathematics 2023-11-20 Ryan Alweiss

Given an uncountable cardinal $\kappa$, we consider the question of whether subsets of the power set of $\kappa$ that are usually constructed with the help of the Axiom of Choice are definable by $\Sigma_1$-formulas that only use the…

Logic · Mathematics 2023-09-20 Philipp Lücke , Sandra Müller

We prove that if there are $\mathfrak c$ incomparable selective ultrafilters then, for every infinite cardinal $\kappa$ such that $\kappa^\omega=\kappa$, there exists a group topology on the free Abelian group of cardinality $\kappa$…

Logic · Mathematics 2021-03-25 M. K. Bellini , K. P. Hart , V. O. Rodrigues , A. H. Tomita

We prove upper and lower bounds on the effective content and logical strength for a variety of natural restrictions of Hindman's Finite Sums Theorem. For example, we show that Hindman's Theorem for sums of length at most 2 and 4 colors…

We show that the existence of a universal countably chromatic graph of size $\aleph_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works…

Logic · Mathematics 2025-11-12 Siiri Kivimäki

For an infinite cardinal $\kappa$, let $ded\kappa$ denote the supremum of the number of Dedekind cuts in linear orders of size $\kappa$. It is known that $\kappa<ded\kappa\leq 2^{\kappa}$ for all $\kappa$ and that $ded\kappa<2^{\kappa}$ is…

Logic · Mathematics 2019-02-20 Artem Chernikov , Saharon Shelah

We prove two $\mathrm{ZFC}$ inequalities between cardinal invariants. The first inequality involves cardinal invariants associated with an analytic P-ideal, in particular the ideal of subsets of $\omega$ of asymptotic density $0$. We obtain…

Logic · Mathematics 2015-05-26 Dilip Raghavan , Saharon Shelah

We continue our study of Sierpinski-type colourings. In contrast to the prequel paper, we focus here on colourings for ideals stratified by their completeness degree. In particular, improving upon Ulam's theorem and its extension by Hajnal,…

Logic · Mathematics 2023-12-19 Tanmay Inamdar , Assaf Rinot

It is well-known that every non-isolated point in a compact Hausdorff space is the accumulation point of a discrete subset. Answering a question raised by Z. Szentmiklossy and the first author, we show that this statement fails for…

General Topology · Mathematics 2013-07-09 Istvan Juhasz , Saharon Shelah

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

Logic · Mathematics 2013-06-25 Saharon Shelah

Hoffman proved that a graph $G$ with adjacency eigenvalues $\lambda_1\geq \cdots \geq \lambda_n$ and chromatic number $\chi(G)$ satisfies $\chi(G)\geq 1+\kappa,$ where $\kappa$ is the smallest integer such that…

Combinatorics · Mathematics 2025-12-16 Aida Abiad , Jan Meeus