English
Related papers

Related papers: Roth-type theorems in $K_{s,t}$-free sets

200 papers

Erd\H{o}s showed that every set of $n$ positive integers contains a subset of size at least $n/(k+1)$ containing no solutions to $x_1 + \cdots + x_k = y$. We prove that the constant $1/(k+1)$ here is best possible by showing that if $(F_m)$…

Combinatorics · Mathematics 2014-12-17 Sean Eberhard

We consider the nonlinear system $c_1p_1^d +c_2p_2^d + \dots + c_s p_s^d = 0$ with $c_1, c_2,\dots, c_s\in\mathbb Z$ being nonzero and satisfying $c_1 +c_2 + \dots + c_s = 0$. We show that for $s\ge 2\lfloor \frac{d^2}2\rfloor+1$ and…

Number Theory · Mathematics 2024-01-05 Xiumin Ren , Yu-chen Sun , Qingqing Zhang , Rui Zhang

Given an integer $d \geq 2$, $s \in (0,1]$, and $t \in [0,2(d-1)]$, suppose a set $X$ in $\mathbb{R}^d$ has the following property: there is a collection of lines of packing dimension $t$ such that every line from the collection intersects…

Classical Analysis and ODEs · Mathematics 2024-09-23 Jonathan M. Fraser

Let $E\subset \mathbb{R}$ be a closed set of Hausdorff dimension $\alpha\in (0, 1)$. Let $P: \mathbb{R}\to \mathbb{R}$ be a polynomial without a constant term whose degree is bigger than one. We prove that if $E$ supports a probability…

Classical Analysis and ODEs · Mathematics 2019-04-26 Robert Fraser , Shaoming Guo , Malabika Pramanik

Let K be a number field, and let lambda(x,t)\in K[x, t] be irreducible over K(t). Using algebraic geometry and group theory, we study the set of alpha\in K for which the specialized polynomial lambda(x,alpha) is K-reducible. We apply this…

Number Theory · Mathematics 2007-05-23 Farshid Hajir , Siman Wong

We establish asymptotic formulae for the number of $k$-free values of polynmilas $F(x_1,\cdots,x_n)\in\mathbb{Z}[x_1,\cdots,x_n]$ of degree $d\geq 2$ for any $n\geq 1$, including when the variables are prime, as long as $k\geq (3d+1)/4$.…

Number Theory · Mathematics 2019-08-15 Kostadinka Lapkova , Stanley Yao Xiao

The breakthrough paper of Croot, Lev, Pach \cite{CLP} on progression-free sets in $\Z_4^n$ introduced a polynomial method that has generated a wealth of applications, such as Ellenberg and Gijswijt's solutions to the cap set problem…

Combinatorics · Mathematics 2017-01-26 Pierre-Yves Bienvenu

Given positive integers m,n,s,t, let z(m,n,s,t) be the maximum number of ones in a (0,1) matrix of size m-by-n that does not contain an all ones submatrix of size s-by-t. We find a flexible upper bound on z(m,n,s,t) that implies the known…

Combinatorics · Mathematics 2009-04-01 Vladimir Nikiforov

Let $f\in \mathbb{R}[x_1,\ldots, x_k]$, for $k\ge 2$. For any finite sets $A_1,\ldots, A_k\subset \mathbb{R}$, consider the set $$ f(A_1,\ldots, A_k):=\{f(a_1,\ldots, a_k)\mid (a_1,\cdots,a_k)\in A_1\times\cdots \times A_k\}, $$ that is,…

Combinatorics · Mathematics 2025-11-07 Yaara Jahn , Orit E. Raz

We generalize the Sarkozy-Furstenberg theorem on squares in difference sets of integers, and show that, given any positive definite function f:Z_N->C with density at least r(N), where r(N)=O((\log N)^{-c}), there is a perfect square s<=N/2…

Number Theory · Mathematics 2011-07-19 Sinisa Slijepcevic

Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…

Number Theory · Mathematics 2019-07-30 Peter Müller

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…

Number Theory · Mathematics 2026-01-21 Biao Wang , Shaoyun Yi

Alon, Shpilka and Umans considered the following version of usual sunflower-free subset: a subset $\mbox{$\cal F$}\subseteq \{1,\ldots ,D\}^n$ for $D>2$ is sunflower-free if for every distinct triple $x,y,z\in \mbox{$\cal F$}$ there exists…

Combinatorics · Mathematics 2018-05-14 Gábor Hegedűs

We present a proof of the following claim. Suppose that $n$ is an integer such that $n>1$ and that $k$ is any field. Suppose that $g$ is an element of $\mathrm{SL}(n,k)$ of infinite order. Then the set $\{h\in\mathrm{SL}(n,k)\mid <g,h>$ is…

Group Theory · Mathematics 2014-11-06 Rupert McCallum

This paper is mainly concerned with sets which do not contain four-term arithmetic progressions, but are still very rich in three term arithmetic progressions, in the sense that all sufficiently large subsets contain at least one such…

Combinatorics · Mathematics 2020-09-17 Cosmin Pohoata , Oliver Roche-Newton

In analogy with epsilon-biased sets over Z_2^n, we construct explicit epsilon-biased sets over nonabelian finite groups G. That is, we find sets S subset G such that | Exp_{x in S} rho(x)| <= epsilon for any nontrivial irreducible…

Computational Complexity · Computer Science 2013-05-01 Sixia Chen , Cristopher Moore , Alexander Russell

Let $K$ be a field and let $\sigma$ be an automorphism and let $\delta$ be a $\sigma$-derivation of $K$. Then we show that the multiplicative group of nonzero elements of the division ring $D=K(x;\sigma,\delta)$ contains a free non-cyclic…

Rings and Algebras · Mathematics 2018-12-06 Jason P. Bell , Jairo Goncalves

Let M in k[x,y] be a monomial ideal M=(m_1,m_2,...,m_r), where the m_i are a minimal generating set of M. We construct an explicit free resolution of k over S=k[x,y]/M for all monomial ideals M, and provide recursive formulas for the Betti…

Commutative Algebra · Mathematics 2013-08-13 Gwyneth R. Whieldon

Consider a translation-invariant system of linear equations $V x = 0$ of complexity one, where $V$ is an integer $r \times t$ matrix. We show that if $A$ is a subset of the primes up to $N$ of density at least $C(\log\log N)^{-1/25t}$,…

Number Theory · Mathematics 2014-05-19 Kevin Henriot

We give two Roth theorems, related to the nonlinear configuration $x$, $x+P_1(t)$, $x+P_2(t)$ involving two polynomials, for sets in $\mathbb{R}$ of positive density and of fractional dimensions. The proof uses Fourier analysis.

Classical Analysis and ODEs · Mathematics 2020-09-01 Xuezhi Chen , Jingwei Guo , Xiaochun Li