• Corpus ID: 221112296

An adjacent Hindman theorem for uncountable groups

@article{Carlucci2020AnAH,
  title={An adjacent Hindman theorem for uncountable groups},
  author={Lorenzo Carlucci and David J. Fern{\'a}ndez-Bret{\'o}n},
  journal={arXiv: Combinatorics},
  year={2020}
}
Results of Hindman, Leader and Strauss and of the second author and Rinot showed that some natural analogs of Hindman's theorem fail for all uncountable cardinals. Results in the positive direction were obtained by Komjath, the first author, and the second author and Lee, who showed that there are arbitrarily large abelian groups satisfying some Hindman-type property. Inspired by an analog result studied by the first author in the countable setting, in this note we prove a new variant of… 

References

SHOWING 1-10 OF 15 REFERENCES

Strong failures of higher analogs of Hindman's theorem

We show that various analogs of Hindman's Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1: There exists a colouring $c:\mathbb

A Note on Hindman-Type Theorems for Uncountable Cardinals

TLDR
It is shown how a family of natural Hindman-type theorems for uncountable cardinals can be obtained by adapting some recent results of the author from their original countable setting.

A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem

TLDR
The Adjacent Hindman’s Theorem with apartness is introduced and it is proved to be provable from Ramsey's Theorem for pairs and strictly stronger than Hirst's Hilbert’S Theorem.

Note A Ramsey Statement for Infinite Groups

If κ is a cardinal, n < ω, then there exists an Abelian group G such that if F: G→κ, then there exist distinct elements ai,α∈G (1≤i≤n,α<κ), and a color τ<κ such that if 1≤i0<···<ir≤n, αr<κ, then

Finite Sums from Sequences Within Cells of a Partition of N

Partition theorems for the power set

The power set of any set can be colored by countably many colors such that there do not exist infinitely many disjoint subsets with all finite subunions getting the same color. Two colors suffice for

Hindman’s Theorem is only a Countable Phenomenon

TLDR
The outcome of this paper is that the natural generalizations of Hindman’s Theorem tend to fail at all uncountable cardinals.

PROBLEMS AND RESULTS IN FINITE AND INFINITE COMBINATORIAL ANALYSIS

P. ERLGS AND A. HAJNAL Mathematical I n s t i t u t e . Hungsrian Academy of Sciences Budapest, Hungary I n t h i s paper we i n v e s t i g a t e edge decomposition and In a previous paper (1) w e

L O ] 2 5 M ar 2 01 3 Every strongly summable ultrafilter on ⊕ Z 2 is sparse

We investigate the possibility of the existence of nonsparse strongly summable ultrafilters on certain abelian groups. In particular, we show that every strongly summable ultrafilter on the countably

A Ramsey statement for infinite groups

If κ is a cardinal, n < ω, then there exists an Abelian group G such that if F : G → κ, then there exist distinct elements ai,α ∈ G (1 ≤ i ≤ n, α < κ), and a color τ < κ such that if 1 ≤ i0 < · · · <