English
Related papers

Related papers: Infinite polynomial patterns in large subsets of t…

200 papers

We give a short proof of a sumset conjecture of Erd\"os, recently proved by Moreira, Richter and Robertson: every subset of the integers of positive density contains the sum of two infinite sets. The proof is written in the framework of…

Dynamical Systems · Mathematics 2019-12-03 Bernard Host

Let $p$ be a prime number and let $S=\{x^p+c_1,\dots,x^p+c_r\}$ be a finite set of unicritical polynomials for some $c_1,\dots,c_r\in\mathbb{Z}$. Moreover, assume that $S$ contains at least one irreducible polynomial over $\mathbb{Q}$. Then…

Number Theory · Mathematics 2023-08-29 Wade Hindes , Reiyah Jacobs , Benjamin Keller , Albert Kim , Peter Ye , Aaron Zhou

We prove a general large sieve statement in the context of random walks on subgraphs of a given graph. This can be seen as a generalization of previously known results where one performs a random walk on a group enjoying a strong spectral…

Group Theory · Mathematics 2017-01-09 Florent Jouve , Jean-Sébastien Sereni

Let $\gamma(t)=(P_1(t),\ldots,P_n(t))$ where $P_i$ is a real polynomial with zero constant term for each $1\leq i\leq n$. We will show the existence of the configuration $\{x,x+\gamma(t)\}$ in sets of positive density $\epsilon$ in…

Classical Analysis and ODEs · Mathematics 2024-10-14 Xuezhi Chen , Changxing Miao

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

The set of sums of two squares plays a significant role in elementary number theory. In this article, we establish the existence of several rich monochromatic configurations in the natural numbers by exploiting algebraic structures induced…

Combinatorics · Mathematics 2026-05-12 Arpita Ghosh , Surojit Ghosh

For $B \subseteq \mathbb F_q^m$, the $n$-th affine extremal number of $B$ is the maximum cardinality of a set $A \subseteq \mathbb F_q^n$ with no subset which is affinely isomorphic to $B$. Furstenberg and Katznelson proved that for any $B…

Combinatorics · Mathematics 2023-08-28 Bryce Frederickson , Liana Yepremyan

We introduce the notion of intersective polynomials having coefficients in the ring of integers $\mathscr{O}_K$ of a number field $K$, and define a notion of upper density of subsets of $\mathscr{O}_K$. We prove that given any intersective…

Number Theory · Mathematics 2025-10-09 Dev Ranjan Pandey , Jyoti Prakash Saha

We study a conjecture linking ultimate periodicity of infnite words to the existence of colorings on finite words avoiding monochromatic factorisation of suffixes, with the extra condition that the ordered concatenation of elements of this…

Combinatorics · Mathematics 2018-02-26 Caius Wojcik

We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…

Number Theory · Mathematics 2012-10-03 Ayah Almousa , Melanie Matchett Wood

This is a treatise on finite point configurations spanning a fixed volume to be found in a single color-class of an arbitrary finite (measurable) coloring of the Euclidean space $\mathbb{R}^n$, or in a single large measurable subset…

Combinatorics · Mathematics 2026-01-15 Vjekoslav Kovač

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

Number Theory · Mathematics 2023-01-31 Mohamed O Darwish , Mohammad Sadek

Liu, Pach and S\'andor recently characterized all polynomials $p(z)$ such that the equation $x+y=p(z)$ is $2$-Ramsey, that is, any $2$-coloring of $\mathbb{N}$ contains infinitely many monochromatic solutions for $x+y=p(z)$. In this paper,…

Combinatorics · Mathematics 2024-04-02 Jaehoon Kim , Hong Liu , Péter Pál Pach

Given a natural number $n \geq 4$ we show that there exists infinitely many polynomials $f_{n}(x):= \prod_{i=1}^{n} (x^{2} - a_{i})$ such that (i) $f_{n}(x)$ has a root modulo every positive integer, (ii) $f_{n}(x)$ has no rational roots,…

Number Theory · Mathematics 2022-07-19 Bhawesh Mishra

We give a short, explicit proof of Hindman's Theorem that in every finite coloring of the integers, there is an infinite set all of whose finite sums have the same color. We give several exampls of colorings of the integers which do not…

Combinatorics · Mathematics 2011-07-05 Henry Towsner

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

Combinatorics · Mathematics 2010-09-06 Jan Hubicka

Motivated by the observation that the counting function of a certain base-3 colored partition contains the even perfect numbers as a subsequence, we begin by defining a sequence of polynomials in four variables and discuss their properties…

Combinatorics · Mathematics 2025-09-04 Karl Dilcher , Larry Ericksen

We study the bifurcation values of real polynomial maps $f: \bR^{2n} \to \bR^2$ which reflect the lack of asymptotic regularity at infinity. We formulate real counterparts of some structure results which have been previously proved in case…

Complex Variables · Mathematics 2019-01-04 Ying Chen , Mihai Tibar

Szemer\'edi's Theorem states that a set of integers with positive upper density contains arbitrarily long arithmetic progressions. Bergelson and Leibman generalized this, showing that sets of integers with positive upper density contain…

Dynamical Systems · Mathematics 2007-05-23 Nikos Frantzikinakis , Bryna Kra

Given an edge colouring of a graph with a set of $m$ colours, we say that the graph is (exactly) $m$-coloured if each of the colours is used. We consider edge colourings of the complete graph on $\mathbb{N}$ with infinitely many colours and…

Combinatorics · Mathematics 2016-09-07 Teeradej Kittipassorn , Bhargav Narayanan
‹ Prev 1 4 5 6 7 8 10 Next ›