English
Related papers

Related papers: Partition regularity of polynomial systems near ze…

200 papers

We consider systems of $n$ diagonal equations in $k$th powers. Our main result shows that if the coefficient matrix of such a system is sufficiently non-singular, then the system is partition regular if and only if it satisfies Rado's…

Number Theory · Mathematics 2020-03-25 Jonathan Chapman

The polynomial partitioning method of Guth and Katz [arXiv:1011.4105] has numerous applications in discrete and computational geometry. It partitions a given $n$-point set $P\subset\mathbb{R}^d$ using the zero set $Z(f)$ of a suitable…

Data Structures and Algorithms · Computer Science 2015-07-20 Jiri Matousek , Zuzana Patakova

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…

Combinatorics · Mathematics 2026-01-21 Zhengxing Lian , Rongzhong Xiao

Given a central integral arrangement, the reduction of the arrangement modulo positive integers $q$ gives rise to a subgroup arrangement in $(\mathbb{Z}/q\mathbb{Z})^\ell$. Kamiya-Takemura-Terao (2008) introduced the notion of…

Combinatorics · Mathematics 2020-06-03 Tan Nhat Tran

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

Combinatorics · Mathematics 2026-01-01 Norbert Hegyvari , Janos Pach , Thang Pham

A system of linear equations with integer coefficients is partition regular over a subset S of the reals if, whenever S\{0} is finitely coloured, there is a solution to the system contained in one colour class. It has been known for some…

Combinatorics · Mathematics 2018-09-05 Ben Barber , Neil Hindman , Imre Leader , Dona Strauss

I show that there exist universal constants $C(r) < \infty$ such that, for all loopless graphs $G$ of maximum degree $\le r$, the zeros (real or complex) of the chromatic polynomial $P_G(q)$ lie in the disc $|q| < C(r)$. Furthermore, $C(r)…

Statistical Mechanics · Physics 2021-01-01 Alan D. Sokal

Stationary 1D Schr\"odinger equations with polynomial potentials are reduced to explicit countable closed systems of exact quantization conditions, which are selfconsistent constraints upon the zeros of zeta-regularized spectral…

Mathematical Physics · Physics 2009-10-31 A. Voros

Some of the classical results of Ramsey Theory can be naturally stated in terms of image partition regularity of matrices. There have been many significant results of image partition regular matrices as well as image partition regular…

Combinatorics · Mathematics 2014-09-23 Tanushree Biswas

In this article, we investigate homogeneous versions of certain nonlinear Ramsey-theoretic results, with three significant applications. As the first application, we prove that for every finite coloring of $\mathbb{Z}^+$, there exist an…

Combinatorics · Mathematics 2025-04-16 Sukumar Das Adhikari , Sayan Goswami

We consider a refinement of the partition function of graph homomorphisms and present a quasi-polynomial algorithm to compute it in a certain domain. As a corollary, we obtain quasi-polynomial algorithms for computing partition functions…

Combinatorics · Mathematics 2015-08-04 Alexander Barvinok , Pablo Soberón

We address a core partition regularity problem in Ramsey theory by proving that every finite coloring of the positive integers contains monochromatic Pythagorean pairs, i.e., $x,y\in \mathbb{N}$ such that $x^2\pm y^2=z^2$ for some $z\in…

Combinatorics · Mathematics 2025-02-19 Nikos Frantzikinakis , Oleksiy Klurman , Joel Moreira

In a celebrated article, Moreira proved for every finite coloring of the set of naturals, there exists a monochromatic copy of the form $\{x,x+y,xy\},$ which gives a partial answer to one of the central open problems of Ramsey theory asking…

Combinatorics · Mathematics 2025-01-29 Sayan Goswami

We consider sparse polynomials in $N$ variables over a finite field, and ask whether they vanish on a set $S^N$, where $S$ is a set of nonzero elements of the field. We see that if for a polynomial $f$, there is $\mathbf{c}\in S^N$ with $f…

Rings and Algebras · Mathematics 2024-06-12 Erhard Aichinger , Simon Grünbacher , Paul Hametner

A famous result in arithmetic Ramsey theory says that for many linear homogeneous equations $E$ there is a threshold value $R_k(E)$ (the Rado number of $E$) such that for any $k$-coloring of the integers in the interval $[1,n]$, with $n \ge…

Combinatorics · Mathematics 2024-10-30 Jesús A. De Loera , Denae Ventura , Liuyue Wang , William J. Wesley

We give a new proof of persistence of quasi-periodic, low dimensional elliptic tori in infinite dimensional systems. The proof is based on a renormalization group iteration that was developed recently in [BGK] to address the standard KAM…

Mathematical Physics · Physics 2009-11-07 Jean Bricmont , Antti Kupiainen , Alain Schenkel

We present exact calculations of the partition function of the zero-temperature Potts antiferromagnet (equivalently, the chromatic polynomial) for graphs of arbitrarily great length composed of repeated complete subgraphs $K_b$ with $b=5,6$…

Mathematical Physics · Physics 2009-11-07 Shu-Chiuan Chang

We address partition regularity problems for homogeneous quadratic equations. A consequence of our main results is that, under natural conditions on the coefficients $a,b,c$, for any finite coloring of the positive integers, there exists a…

Combinatorics · Mathematics 2024-08-08 Nikos Frantzikinakis , Oleksiy Klurman , Joel Moreira

In this paper we consider monic polynomials such that their coefficients coincide with their zeros. These polynomials were first introduced by S. Ulam. We combine methods of algebraic geometry and dynamical systems to prove several results.…

Classical Analysis and ODEs · Mathematics 2018-06-19 Oksana Bihun , Damiano Fulghesu

Image partition regular matrices near zero generalizes many classical results of Ram- sey Theory. There are several characterizations of finite image partition regular matrices near zero. Contrast to the finite cases there are only few…

Combinatorics · Mathematics 2018-08-27 Ram Chandra Manna , Sourav Kanti Patra , Rajib Sarkar