English
Related papers

Related papers: Additive Ramsey theory over Piatetski-Shapiro numb…

200 papers

Partitions, the partition function $p(n)$, and the hook lengths of their Ferrers-Young diagrams are important objects in combinatorics, number theory and representation theory. For positive integers $n$ and $t$, we study $p_t^e(n)$ (resp.…

Number Theory · Mathematics 2022-04-19 William Craig , Anna Pun

Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f, there is an infinite set that is "packed together" which…

Logic · Mathematics 2013-02-12 Stephen Flood

We derive exact and asymptotic results for random partitions from general results in the semi-classical analysis of coherent states applied to the classical periodic Benjamin-Ono equation at critical regularity $s= -1/2$. We find classical…

Mathematical Physics · Physics 2017-08-16 Alexander Moll

For a partially ordered set $(A, \le)$, let $G_A$ be the simple, undirected graph with vertex set $A$ such that two vertices $a \neq b\in A$ are adjacent if either $a \le b$ or $b \le a$. We call $G_A$ the \emph{partial order graph} or…

Combinatorics · Mathematics 2020-10-22 Ayman Badawi , Roswitha Rissner

We show that, for $n$ large, there must exist at least \[\frac{n^t}{C^{(1+o(1))t^2}}\] monochromatic $K_t$s in any two-colouring of the edges of $K_n$, where $C \approx 2.18$ is an explicitly defined constant. The old lower bound, due to…

Combinatorics · Mathematics 2007-12-03 David Conlon

Quaternion extensions are often the smallest extensions to exhibit special properties. In the setting of the Hasse-Arf Theorem, for instance, quaternion extensions are used to illustrate the fact that upper ramification numbers need not be…

Number Theory · Mathematics 2007-05-23 G. Griffith Elder , Jeffrey J. Hooper

Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…

Computational Complexity · Computer Science 2015-05-19 Manuel Bodirsky , Michael Pinsker

We consider the nonlinear Schrodinger equation with a modified spatial dispersion, given either by an homogeneous Fourier multiplier, or by a bounded Fourier multiplier. Arguments based on ordinary differential equations yield ill-posedness…

Analysis of PDEs · Mathematics 2011-10-11 Rémi Carles

Existence, uniqueness, and regularity of a strong solution are obtained for stochastic PDEs with a colored noise $F$ and its super-linear diffusion coefficient: $$ du=(a^{ij}u_{x^ix^j}+b^iu_{x^i}+cu)dt+\xi|u|^{1+\lambda}dF, \quad…

Probability · Mathematics 2021-01-06 Jae-Hwan Choi , Beom-Seok Han

Let $q$ be an odd prime power. Combining the discussion of Varnavides and a recent theorem of Ellenberg and Gijswijt, we show that a subset $A\subset{\mathbb F}_q^n$ will contain many non-trivial three-term arithmetic progressions, whenever…

Combinatorics · Mathematics 2016-11-29 Shanshan Du , Hao Pan

We study the distributions of the splitting primes in certain families of number fields. The first and main example is the family Pn,N of integer polynomials monic of degree n with height less or equal then N, and then let N go to infinity.…

Number Theory · Mathematics 2024-09-10 Ilaria Viglino

We prove that double exponentiation is an upper bound to Ramsey theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.

Combinatorics · Mathematics 2016-09-06 Saharon Shelah

Recently, Ma, Shen and Xie broke the Erd\H{o}s barrier for off-diagonal Ramsey numbers $R(\ell,C\ell)$, achieving the first exponential improvement over the classical lower bound for every $C>1$ and sufficiently large $\ell$. Hunter,…

Combinatorics · Mathematics 2026-05-26 Qizhong Lin , Lin Niu

We show that several sets of interest arising from the study of partition regularity and density Ramsey theory of polynomial equations over integral domains are undecidable. In particular, we show that the set of homogeneous polynomials $p…

Logic · Mathematics 2025-05-13 Sohail Farhangi , Steve Jackson , Bill Mance

A real \alpha is called recursively enumerable ("r.e." for short) if there exists a computable, increasing sequence of rationals which converges to \alpha. It is known that the randomness of an r.e. real \alpha can be characterized in…

Computational Complexity · Computer Science 2015-05-13 Kohtaro Tadaki

Suppose that A is a subset of the integers {1,...,N} of density a. We provide a new proof of a result of Green which shows that A+A contains an arithmetic progression of length exp(ca(log N)^{1/2}) for some absolute c>0. Furthermore we…

Number Theory · Mathematics 2010-04-02 Tom Sanders

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

Ramsey theory looks for regularities in large objects. Model theory studies algebraic structures as models of theories. The structural Ramsey theory combines these two fields and is concerned with Ramsey-type questions about certain…

Combinatorics · Mathematics 2018-05-22 Matěj Konečný

In this paper, we extend the celebrated global regularity theory of Naber-Valtorta [Ann. Math. 2017] to 1/2-harmonic mappings into manifolds. Inspired by their work, we first adapt Lin's defect measure theory [Ann. Math. 1999] to such maps…

Analysis of PDEs · Mathematics 2026-03-16 Changyu Guo , Guichun Jiang , Changyou Wang , Changlin Xiang , Gaofeng Zheng

We show how multiplicatively syndetic sets can be used in the study of partition regularity of dilation invariant systems of polynomial equations. In particular, we prove that a dilation invariant system of polynomial equations is partition…

Combinatorics · Mathematics 2020-06-17 Jonathan Chapman