English
Related papers

Related papers: Additive and multiplicative Sidon sets

200 papers

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. Erd\H{o}s…

Number Theory · Mathematics 2026-01-14 Bhuwanesh Rao Patil , Mohan

For set $A\subset {\mathbb {F}_p}^*$ define by ${\mathsf{sf}}(A)$ the size of the largest sum--free subset of $A.$ Alon and Kleitman showed that ${\mathsf{sf}} (A) \ge |A|/3+O(|A|/p).$ We prove that if ${\mathsf{sf}} (A)-|A|/3$ is small…

Combinatorics · Mathematics 2020-04-07 Tomasz Schoen , Ilya D. Shkredov

Let $hA$ denote the $h$-fold sumset of a subset $A$ of an abelian group. Resolving a problem of Nathanson, we show that for any prescribed permutations $\sigma_1, \ldots, \sigma_H \in \mathfrak{S}_n$, there exist finite subsets $A_1,…

Combinatorics · Mathematics 2025-01-07 Noah Kravitz

Given a finite set $A\subset \mathbb{R}\backslash \{0\}$, define \begin{align*}&A\cdot A \ =\ \{a_i\cdot a_j\,|\, a_i,a_j\in A\},\\ &A/A \ =\ \{a_i/a_j\,|\,a_i,a_j\in A\},\\ &A + A \ =\ \{a_i + a_j\,|\, a_i,a_j\in A\},\\ &A - A \ =\ \{a_i -…

Number Theory · Mathematics 2020-01-16 Hung Viet Chu

We prove bounds for the number of solutions to $$a_1 + \dots + a_k = a_1' + \dots + a_k'$$ over $N$-element sets of reals, which are sufficiently convex or near-convex. A near-convex set will be the image of a set with small additive…

Number Theory · Mathematics 2021-04-26 Peter J. Bradshaw , Brandon Hanson , Misha Rudnev

We use a recent result of Alin Bostan to prove that the generating functions of two infinite sequences of permutation classes are not algebraic.

Combinatorics · Mathematics 2024-09-04 Miklos Bona

For each natural number $d$, we introduce the concept of a $d$-cap in $\mathbb{F}_3^n$. A subset of $\mathbb{F}_3^n$ is called a $d$-cap if, for each $k = 1, 2, \dots, d$, no $k+2$ of the points lie on a $k$-dimensional flat. This…

Combinatorics · Mathematics 2020-10-14 Yixuan Huang , Michael Tait , Robert Won

We say that $S\subset\mathbb Z$ is a set of $k$-recurrence if for every measure preserving transformation $T$ of a probability measure space $(X,\mu)$ and every $A\subseteq X$ with $\mu(A)>0$, there is an $n\in S$ such that $\mu(A\cap…

Dynamical Systems · Mathematics 2024-05-08 John T. Griesmer

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…

Combinatorics · Mathematics 2019-06-14 Joel Moreira , Florian Karl Richter , Donald Robertson

This work presents theorems which state (i) Z is a proper subset for any bijection f between A and Z, where Z is contained in P(A), A is a non-finite set and |Z|=|A|, and (ii) being Z a proper subset of P(A) nothing affirms or denies that…

General Mathematics · Mathematics 2007-05-23 Jailton C. Ferreira

We prove an elementary additive combinatorics inequality, which says that if $A$ is a subset of an Abelian group, which has, in some strong sense, large doubling, then the difference set A-A has a large subset, which has small doubling.

Combinatorics · Mathematics 2011-07-26 Misha Rudnev

Given a subset $W$ of an abelian group $G$, a subset $C$ is called an additive complement for $W$ if $W+C=G$; if, moreover, no proper subset of $C$ has this property, then we say that $C$ is a minimal complement for $W$. It is natural to…

Combinatorics · Mathematics 2021-01-01 Noga Alon , Noah Kravitz , Matt Larson

We study power-set operations on classes of trees and tree algebras. Our main result consists of a distributive law between the tree monad and the upwards-closed power-set monad, in the case where all trees are assumed to be linear. For…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Achim Blumensath

A set of reals $A=\{a_1,...,a_n\}$ labeled in increasing order is called convex if there exists a continuous strictly convex function $f$ such that $f(i)=a_i$ for every $i$. Given a convex set $A$, we prove…

Combinatorics · Mathematics 2011-08-23 Liangpan Li

Let $A_1,\ldots,A_n$ be finite subsets of an additive abelian group $G$ with $|A_1|=\cdots=|A_n|\ge2$. Concerning the two new kinds of restricted sumsets $$L(A_1,\ldots,A_n)=\{a_1+\cdots+a_n:\ a_1\in A_1,\ldots,a_n\in A_n,\ \text{and}\…

Number Theory · Mathematics 2022-10-24 Han Wang , Zhi-Wei Sun

Let $\varphi (x_{1}, \ldots, x_{h})=c_{1} x_{1}+\cdots+c_{h} x_{h}$ be a linear form with coefficients in a field $\mathbf{F}$, and let $V$ be a vector space over $\mathbf{F}$. A nonempty subset $A$ of $V$ is a $\varphi$-Sidon set if…

Number Theory · Mathematics 2021-12-01 Csaba Sándor , Quan-Hui Yang , Jun-Yu Zhou

We disproving Seifert's conjecture for almost symplectic foliations with co-dimension bigger or equal to 3.

Differential Geometry · Mathematics 2016-10-26 Sauvik Mukherjee

In an abelian group G, a more sums than differences (MSTD) set is a subset A of G such that |A+A|>|A-A|. We provide asymptotics for the number of MSTD sets in finite abelian groups, extending previous results of Nathanson. The proof…

Combinatorics · Mathematics 2015-10-26 Yufei Zhao

The usual dictionary between geometry and commutative algebra is not appropriate for Arithmetic geometry because addition is a singular operation at the "Real prime". We replace Rings, with addition and multiplication, by Props (=strict…

Category Theory · Mathematics 2024-02-12 Shai Haran

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

Combinatorics · Mathematics 2007-05-23 Mei-Chu Chang