Page 1 Next

Displaying 1 – 20 of 251

Showing per page

A canonical Ramsey-type theorem for finite subsets of

Diana Piguetová (2003)

Commentationes Mathematicae Universitatis Carolinae

T. Brown proved that whenever we color 𝒫 f ( ) (the set of finite subsets of natural numbers) with finitely many colors, we find a monochromatic structure, called an arithmetic copy of an ω -forest. In this paper we show a canonical extension of this theorem; i.eẇhenever we color 𝒫 f ( ) with arbitrarily many colors, we find a canonically colored arithmetic copy of an ω -forest. The five types of the canonical coloring are determined. This solves a problem of T. Brown.

A De Bruijn-Erdős theorem for 1 - 2 metric spaces

Václav Chvátal (2014)

Czechoslovak Mathematical Journal

A special case of a combinatorial theorem of De Bruijn and Erdős asserts that every noncollinear set of n points in the plane determines at least n distinct lines. Chen and Chvátal suggested a possible generalization of this assertion in metric spaces with appropriately defined lines. We prove this generalization in all metric spaces where each nonzero distance equals 1 or 2 .

A density version of the Carlson–Simpson theorem

Pandelis Dodos, Vassilis Kanellopoulos, Konstantinos Tyros (2014)

Journal of the European Mathematical Society

We prove a density version of the Carlson–Simpson Theorem. Specifically we show the following. For every integer k 2 and every set A of words over k satisfying lim sup n | A [ k ] n | / k n > 0 there exist a word c over k and a sequence ( w n ) of left variable words over k such that the set c { c w 0 ( a 0 ) . . . w n ( a n ) : n and a 0 , . . . , a n [ k ] } is contained in A . While the result is infinite-dimensional its proof is based on an appropriate finite and quantitative version, also obtained in the paper.

A dichotomy on Schreier sets

Robert Judd (1999)

Studia Mathematica

We show that the Schreier sets S α ( α < ω 1 ) have the following dichotomy property. For every hereditary collection ℱ of finite subsets of ℱ, either there exists infinite M = ( m i ) i = 1 such that S α ( M ) = m i : i E : E S α , or there exist infinite M = ( m i ) i = 1 , N such that [ N ] ( M ) = m i : i F : F a n d F N S α .

A Dichotomy Principle for Universal Series

V. Farmaki, V. Nestoridis (2008)

Bulletin of the Polish Academy of Sciences. Mathematics

Applying results of the infinitary Ramsey theory, namely the dichotomy principle of Galvin-Prikry, we show that for every sequence ( α j ) j = 1 of scalars, there exists a subsequence ( α k j ) j = 1 such that either every subsequence of ( α k j ) j = 1 defines a universal series, or no subsequence of ( α k j ) j = 1 defines a universal series. In particular examples we decide which of the two cases holds.

A Discretized Approach to W. T. Gowers' Game

V. Kanellopoulos, K. Tyros (2010)

Bulletin of the Polish Academy of Sciences. Mathematics

We give an alternative proof of W. T. Gowers' theorem on block bases by reducing it to a discrete analogue on specific countable nets. We also give a Ramsey type result on k-tuples of block sequences in a normed linear space with a Schauder basis.

A general upper bound in extremal theory of sequences

Martin Klazar (1992)

Commentationes Mathematicae Universitatis Carolinae

We investigate the extremal function f ( u , n ) which, for a given finite sequence u over k symbols, is defined as the maximum length m of a sequence v = a 1 a 2 . . . a m of integers such that 1) 1 a i n , 2) a i = a j , i j implies | i - j | k and 3) v contains no subsequence of the type u . We prove that f ( u , n ) is very near to be linear in n for any fixed u of length greater than 4, namely that f ( u , n ) = O ( n 2 O ( α ( n ) | u | - 4 ) ) . Here | u | is the length of u and α ( n ) is the inverse to the Ackermann function and goes to infinity very slowly. This result extends the estimates in [S] and [ASS] which...

A new and stronger central sets theorem

Dibyendu De, Neil Hindman, Dona Strauss (2008)

Fundamenta Mathematicae

Furstenberg's original Central Sets Theorem applied to central subsets of ℕ and finitely many specified sequences in ℤ. In this form it was already strong enough to derive some very strong combinatorial consequences, such as the fact that a central subset of ℕ contains solutions to all partition regular systems of homogeneous equations. Subsequently the Central Sets Theorem was extended to apply to arbitrary semigroups and countably many specified sequences. In this paper we derive a new version...

Currently displaying 1 – 20 of 251

Page 1 Next