Papers
Topics
Authors
Recent
Search
2000 character limit reached

On restricted sumsets over a field

Published 14 Feb 2014 in math.NT and math.CO | (1402.3383v1)

Abstract: We consider restricted sumsets over field $F$. Let\begin{align*}C={a_1+\cdots+a_n:a_1\in A_1,\ldots,a_n\in A_n, a_i-a_j\notin S_{ij}\ \text{if}\ i\not=j},\end{align*} where $S_{ij}(1\leqslant i\not=j\leqslant n)$ are finite subsets of $F$ with cardinality $m$, and $A_1,\ldots, A_n$ are finite nonempty subsets of $F$ with $|A_1|=\cdots=|A_n|=k$. Let $p(F)$ be the additive order of the identity of $F$. It is proved that $|C|\geqslant \min{p(F),\ \ n(k-1)-mn(n-1)+1}$ if $p(F)>mn$. This conclusion refines the result of Hou and Sun.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.