English
Related papers

Related papers: An upper bound for weak $B_k$-sets

200 papers

We improve upon a result of Steinerberger (2024) by demonstrating that for any fixed $k \in \mathbb{N}$ and sufficiently large $n$, there exist integers $1 \leq a_1, \dots, a_k \leq n$ satisfying: \begin{align*} 0 < \left\| \sum_{j=1}^{k}…

Number Theory · Mathematics 2024-04-02 Siddharth Iyer

It is conjectured that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive integers $x,y$ and $z$, except for specific cases. We develop…

Number Theory · Mathematics 2025-04-15 Takafumi Miyazaki , István Pink

We prove that there exists a weak solution of the Stokes system with a non-zero external force and no-slip boundary conditions in a half space of dimensions three and higher so that its normal derivatives are unbounded near boundary. A…

Analysis of PDEs · Mathematics 2023-03-13 Tongkeun Chang , Kyungkeun Kang

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

Number Theory · Mathematics 2021-01-06 Sarah Peluse

We consider a variant of the ABC Conjecture, attempting to count the number of solutions to $A+B+C=0$, in relatively prime integers $A,B,C$ each of absolute value less than $N$ with $r(A)<|A|^a, r(B)<|B|^b, r(C)<|C|^c.$ The ABC Conjecture…

Number Theory · Mathematics 2014-09-17 Daniel M. Kane

A subset $S$ of a group $(G,+)$ is $t$-weakly sequenceable if there is an ordering $(y_1, \ldots, y_k)$ of its elements such that the partial sums~$s_0, s_1, \ldots, s_k$, given by $s_0 = 0$ and $s_i = \sum_{j=1}^i y_j$ for $1 \leq i \leq…

Combinatorics · Mathematics 2024-03-12 Simone Costa

We show that for any finite set $A$ and an arbitrary $\varepsilon>0$ there is $k=k(\varepsilon)$ such that the higher energy ${\mathsf{E}}_k(A)$ is at most $|A|^{k+\varepsilon}$ unless $A$ has a very specific structure. As an application we…

Number Theory · Mathematics 2021-03-30 Ilya D. Shkredov

Let $G$ be a finite, non-trivial abelian group of exponent $m$, and suppose that $B_1, ..., B_k$ are generating subsets of $G$. We prove that if $k>2m \ln \log_2 |G|$, then the multiset union $B_1\cup...\cup B_k$ forms an additive basis of…

Number Theory · Mathematics 2008-12-16 Vsevolod F. Lev , Mikhail E. Muzychuk , Rom Pinchasi

For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…

In this paper we consider the problem of bounding the Betti numbers, $b_i(S)$, of a semi-algebraic set $S \subset \R^k$ defined by polynomial inequalities $P_1 \geq 0,...,P_s \geq 0$, where $P_i \in \R[X_1,...,X_k]$ and $\deg(P_i) \leq 2$,…

Algebraic Geometry · Mathematics 2011-02-21 Saugata Basu , Michael Kettner

The $3k-4$ Theorem is a classical result which asserts that if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with \begin{equation}\label{hyp}|A+B|=|A|+|B|+r\leq |A|+|B|+\min\{|A|,\,|B|\}-3-\delta,\end{equation} where $\delta=1$ if…

Number Theory · Mathematics 2019-12-02 David J. Grynkiewicz

A Sidon set is a set of integers containing no nontrivial solutions to the equation $a+b=c+d$. We improve on the lower bound on the diameter of a Sidon set with $k$ elements: if $k$ is sufficiently large and ${\cal A}$ is a Sidon set with…

Number Theory · Mathematics 2024-11-12 Kevin O'Bryant

In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…

Classical Analysis and ODEs · Mathematics 2012-05-07 Pedro J. Freitas , Shmuel Friedland , Gaspar Porta

Consider the differential equation $y'=F(x,y)$. We determine the weakest possible upper bound on $|F(x,y)-F(x,z)|$ which guarantees that this equation has for all initial values a unique solution, which exists globally.

Classical Analysis and ODEs · Mathematics 2021-10-05 Jan-Christoph Schlage-Puchta

We conjecture that if a system S \subseteq {x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in integers x_1,...,x_n, then each such solution (x_1,...,x_n) satisfies |x_1|,...,|x_n| \leq…

Number Theory · Mathematics 2014-10-21 Apoloniusz Tyszka

Let $F_{k,d}(n)$ be the maximal size of a set ${A}\subseteq [n]$ such that the equation \[a_1a_2\dots a_k=x^d, \; a_1<a_2<\ldots<a_k\] has no solution with $a_1,a_2,\ldots,a_k\in {A}$ and integer $x$. Erd\H{o}s, S\'ark\"ozy and T. S\'os…

We address the "sums of dilates problem" by looking for non-trivial lower bounds on sumsets of the form $k \cdot X + l \cdot X$, where $k$ and $l$ are non-zero integers and $X$ is a subset of a possibly non-abelian group $G$ (written…

Combinatorics · Mathematics 2018-05-15 Alain Plagne , Salvatore Tringali

For $g \geq 2$ and $h \geq 3$, we give small improvements on the maximum size of a $B_h[g]$-set contained in the interval $\{1,2, \dots , N \}$. In particular, we show that a $B_3[g]$-set in $\{1,2, \dots , N \}$ has at most $(14.3 g…

Combinatorics · Mathematics 2016-04-05 Craig Timmons

Let $n$ be a positive integer, and let $A$ be a set of $k\ge 2n-1$ integers. For the restricted sumset $$ S_n(A)=\{a_1+\cdots +a_n:\ a_1,\ldots,a_n\in A,\ \text{and}\ a_i^2\neq a_j^2\ \text{for} \ 1\le i<j\le n\}, $$ by a 2002 result of Liu…

Number Theory · Mathematics 2023-05-22 Xin-Qi Luo , Zhi-Wei Sun

We derive lower and upper bounds on possible growth rates of certain sets of positive integers $A_k=\{1= a_1 < a_2 < ... < a_{k}\}$ such that all integers $n\in \{0, 1, 2, ..., ka_{k}\}$ can be represented as a sum of no more than $k$…

Number Theory · Mathematics 2014-01-30 Hugh Thomas , Stephanie van Willigenburg