English
Related papers

Related papers: Beyond sum-free sets in the natural numbers

200 papers

A set of positive integers $A \subset \mathbb{Z}_{> 0}$ is \emph{log-sparse} if there is an absolute constant $C$ so that for any positive integer $x$ the sequence contains at most $C$ elements in the interval $[x,2x)$. In this note we…

Combinatorics · Mathematics 2021-04-20 Noga Alon , Ryan Alweiss , Yang P. Liu , Anders Martinsson , Shyam Narayanan

Let $A,B\subseteq\mathbb Z_n$ be given and $S=(x_1,\ldots, x_k)$ be a sequence in $\mathbb Z_n$. We say that $S$ is an $(A,B)$-weighted zero-sum sequence if there exist $a_1,\ldots,a_k\in A$ and $b_1,\ldots,b_k\in B$ such that…

Number Theory · Mathematics 2026-01-07 Krishnendu Paul , Shameek Paul

Given integers s and t, define a function phi_{s,t} on the space of all formal complex series expansions by phi_{s,t} (sum a_n x^n) = sum a_{sn+t} x^n. We define an integer r to be distinguished with respect to (s,t) if r and s are…

Number Theory · Mathematics 2007-05-23 Curtis D. Bennett , Edward Mosteig

The sum theorem and its corollaries are proved for a countable family of zero-dimensional (in the sense of small and large inductive bidimensions) p-closed sets, using a new notion of relative normality whose topological correspondent is…

General Topology · Mathematics 2007-06-29 B. P. Dvalishvili

We introduce a family of atomic measures on free groups generated by no-return random walks. These measures are shown to be very convenient for comparing "relative sizes" of subgroups, context-free and regular subsets (that, subsets…

Group Theory · Mathematics 2007-05-23 Alexandre V. Borovik , Alexei G. Myasnikov , Vladimir N. Remeslennikov

Given a symmetric variety Y defined over the rationals and a non-zero polynomial with integer coefficients, we use techniques from homogeneous dynamics to establish conditions under which the polynomial can be made r-free for a Zariski…

Number Theory · Mathematics 2017-06-14 T. D. Browning , A. Gorodnik

For a positive integer $n$, let $[n]$ denote $\{1, \ldots, n\}$. For a 2-dimensional integer lattice point $\mathbf{b}$ and positive integers $k\geq 2$ and $n$, a \textit{$k$-sum $\mathbf{b}$-free set} of $[n]\times [n]$ is a subset $S$ of…

Combinatorics · Mathematics 2019-03-13 Ilkyoo Choi , Ringi Kim , Boram Park

We study theories of 4D, N=1 supersymmetric massless, arbitrary integer superspins. A new state-of-the art is being established by the discovery of a new series of such theories for arbitrary superspin Y (Y=s for any integer s) The lowest…

High Energy Physics - Theory · Physics 2012-08-27 S. James Gates, , Konstantinos Koutrolikos

Let G be a finite abelian group. For g in G and i an integer we define N(i,g) to be the number of subsets of G of size i which sum up to g. We will give a short proof, using character theory, of a formula for these N(i,g) due to Li and Wan.…

Combinatorics · Mathematics 2015-09-08 Michiel Kosters

For subsets of $\mathbb R^+ = [0,\infty)$ we introduce a notion of coherently porous sets as the sets for which the upper limit in the definition of porosity at a point is attained along the same sequence. We prove that the union of two…

Classical Analysis and ODEs · Mathematics 2017-03-27 Maya Altinok , Oleksiy Dovgoshey , Mehmet Küçükaslan

Let $f(n,r)$ denote the maximum number of colourings of $A \subseteq \lbrace 1,\ldots,n\rbrace$ with $r$ colours such that each colour class is sum-free. Here, a sum is a subset $\lbrace x,y,z\rbrace$ such that $x+y=z$. We show that $f(n,2)…

Combinatorics · Mathematics 2017-10-17 Hong Liu , Maryam Sharifzadeh , Katherine Staden

A subset $S \subseteq V$ in a graph $G = (V,E)$ is called a $[1, k]$-set, if for every vertex $v \in V \setminus S$, $1 \leq | N_G(v) \cap S | \leq k$. The $[1,k]$-domination number of $G$, denoted by $\gamma_{[1, k]}(G)$ is the size of the…

Discrete Mathematics · Computer Science 2017-08-02 P. Sharifani , M. R. Hooshmandasl

Let ${\bf x}_0,{\bf x}_1,...$ be a sequence of points in $[0,1)^s$. A subset $S$ of $[0,1)^s$ is called a bounded remainder set if there exist two real numbers $a$ and $C$ such that, for every integer $N$, $$ | {\rm card}\{n <N \; | \; {\bf…

Number Theory · Mathematics 2019-01-03 Mordechay B. Levin

Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. In this paper we shall characterise the largest possible sum-free subsets of G…

Number Theory · Mathematics 2007-05-23 R. Balasubramanian , Gyan Prakash

For x,y in R (where R denotes the real numbers) and f in L^2(R), define (x,y)f(t) = e^{2 pi i yt}f(t+x) and if L is a subset of R^2, define S(f,L) = {(x,y)f | (x,y) in L}. It has been conjectured that if f is not 0, then S(f,L) is linearly…

Representation Theory · Mathematics 2007-05-23 Peter A. Linnell

Let $M(x)$ be the length of the largest subinterval of $[1,x]$ which does not contain any sums of two squareful numbers. We prove a lower bound \[ M(x)\gg \frac{\ln x}{(\ln\ln x)^2} \] for all $x\geq 3$. The proof relies on properties of…

Number Theory · Mathematics 2023-12-05 Alexander Kalmynin , Sergei Konyagin

Answering a question of P. Erdos from 1965, we show that for every eps>0 there is a set A of n integers with the following property: every subset A' of A with at least (1/3 + eps)n elements contains three distinct elements x,y,z with x + y…

Combinatorics · Mathematics 2014-11-10 Sean Eberhard , Ben Green , Freddie Manners

The Minkowski sum of two subsets $A$ and $B$ of a finite abelian group $G$ is defined as all pairwise sums of elements of $A$ and $B$: $A + B = \{ a + b : a \in A, b \in B \}$. The largest size of a $(k, \ell)$-sum-free set in $G$ has been…

Combinatorics · Mathematics 2020-09-15 Rachel Zhang

Given a positive, non-increasing sequence $a$ with finite sum equal to $1$, we consider the family of all closed subsets of $[0,1]$ whose complementary open intervals have lengths given by a rearrangement of the sequence $a$. We study the…

Classical Analysis and ODEs · Mathematics 2025-11-18 Nicolas Angelini , Ursula Molter

In this paper we study sum-free sets of order $m$ in finite Abelian groups. We prove a general theorem on 3-uniform hypergraphs, which allows us to deduce structural results in the sparse setting from stability results in the dense setting.…

Combinatorics · Mathematics 2012-02-01 Noga Alon , József Balogh , Robert Morris , Wojciech Samotij