中文
相关论文

相关论文: Infinite Sum-Product Configurations in Parallel

200 篇论文

We show that any $2$-coloring of $\mathbb{N}$ contains infinitely many monochromatic sets of the form $\{x,y,xy,x+y\},$ and more generally monochromatic sets of the form $\{x_i,\prod x_i,\sum x_i: i\leq k\}$ for any $k\in\mathbb{N}.$ Along…

组合数学 · 数学 2022-05-26 Matt Bowen

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…

组合数学 · 数学 2023-11-20 Ryan Alweiss

Our aim in this paper is to show that, for any $k$, there is a finite colouring of the set of rationals whose denominators contain only the first $k$ primes such that no infinite set has all of its finite sums and products monochromatic. We…

组合数学 · 数学 2023-03-08 Neil Hindman , Maria-Romina Ivan , Imre Leader

N. Hindman, I. Leader and D. Strauss proved that it is consistent that there is a finite colouring of $\mathbb R$ so that no infinite sumset $X+X=\{x+y:x,y\in X\}$ is monochromatic. Our aim in this paper is to prove a consistency result in…

We show the existence of several infinite monochromatic patterns in the integers obtained as values of suitable symmetric polynomials. The simplest example is the following. For every finite coloring of the natural numbers…

组合数学 · 数学 2022-02-16 Mauro Di Nasso

An old question in Ramsey theory asks whether any finite coloring of the natural numbers admits a monochromatic pair $\{x+y,xy\}$. We answer this question affirmatively in a strong sense by exhibiting a large new class of non-linear…

组合数学 · 数学 2016-05-06 Joel Moreira

We prove partition regularity of the configuration $x,y,x+y,y/x$ in a strong infinitary form that extends Hindman's Theorem. We study the related issue of partition regularity of configurations involving products of a degree one polynomial…

We show that for every coloring of the rationals into finitely many colors, one of the colors contains a set of the form $\{x,y,xy,x+y\}$ for some nonzero $x$ and $y$.

组合数学 · 数学 2024-11-20 Matt Bowen , Marcin Sabok

We use the combinatorial properties of central sets to prove a result about the existence of exponential monochromatic patterns, in the style of Hindman's Finite Sums Theorem. More precisely, we prove that for every finite coloring of the…

组合数学 · 数学 2022-11-30 Mauro Di Nasso , Mariaclara Ragosta

Suppose that we have a finite colouring of the reals. What sumset-type structures can we hope to find in some colour class? One of our aims is to show that there is such a colouring for which no uncountable set has all of its pairwise sums…

组合数学 · 数学 2015-10-21 Neil Hindman , Imre Leader , Dona Strauss

W. T. Gower generalized Hindman's Finite sum theorem over $X_{k}=\left\{ \left(n_{1},n_{2},\ldots,n_{k}\right):n_{1}\neq0\right\} $ by showing that for any finite coloring of $X_{k}$ there exists a sequence such that the Gower subspace…

组合数学 · 数学 2022-10-31 Sayan Goswami

Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of…

组合数学 · 数学 2015-08-11 Aldo de Luca , Luca Q. Zamboni

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),…

组合数学 · 数学 2020-11-17 Sourav Kanti Patra , Md Moid Shaikh

In the paper, we search for monochromatic infinite additive structures involving polynomials over $\mathbb{N}$. It is proved that for any $r\in \mathbb{N}$, any two distinct natural numbers $a,b$, and any $2$-coloring of $\mathbb{N}$, there…

组合数学 · 数学 2026-01-21 Zhengxing Lian , Rongzhong Xiao

We show that a finite coloring of an amenable group contains `many' monochromatic sets of the form $\{x,y,xy,yx\},$ and natural extensions with more variables. This gives the first combinatorial proof and extensions of Bergelson and…

组合数学 · 数学 2024-05-08 Matt Bowen

Suppose that $\mathbb{F}_p$ is coloured with $r$ colours. Then there is some colour class containing at least $c_r p^2$ quadruples of the form $(x, y , x + y, xy)$.

数论 · 数学 2018-11-05 Ben Green , Tom Sanders

A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of…

组合数学 · 数学 2013-12-20 Ben Barber , Neil Hindman , Imre Leader

We show that there is a rational vector space $V$ such that, whenever $V$ is finitely coloured, there is an infinite set $X$ whose sumset $X+X$ is monochromatic. Our example is the rational vector space of dimension…

组合数学 · 数学 2017-07-26 Imre Leader , Paul A. Russell

A particular case of the Hindman--Galvin--Glazer theorem states that, for every partition of an infinite abelian group $G$ into two cells, there will be an infinite $X\subseteq G$ such that the set of its finite sums…

逻辑 · 数学 2020-06-02 David Fernández-Bretón , Sung Hyup Lee

Recently, using machinery's from Ergodic theory, Z. Lian, and R. Xiao proved if $P$ is any polynomial with no constant term, then for every finite coloring of $\mathbb{N}$, there exists two infinite subsets $B,C$ of $\mathbb{N}$ such that…

组合数学 · 数学 2024-04-16 Sayan Goswami
‹ 上一页 1 2 3 10 下一页 ›