中文
相关论文

相关论文: On various restricted sumsets

200 篇论文

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

数论 · 数学 2026-05-26 Vivekanand Goswami , Raj Kumar Mistri

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…

数据结构与算法 · 计算机科学 2024-02-06 Xi Chen , Shivam Nadimpalli , Tim Randolph , Rocco A. Servedio , Or Zamir

Consider the linear congruence equation $x_1+\ldots+x_k \equiv b\,(\text{mod } n)$ for $b,n\in\mathbb{Z}$. By $(a,b)_s$, we mean the largest $l^s\in\mathbb{N}$ which divides $a$ and $b$ simultaneously. For each $d_j|n$, define…

数论 · 数学 2017-08-16 K Vishnu Namboothiri

Let $\BZ_p$ be the finite field of prime order $p$ and $A$ be a subset of $\BZ_p$. We prove several sharp results about the following two basic questions: (1) When can one represent zero as a sum of distinct elements of $A$ ? (2) When can…

组合数学 · 数学 2007-05-23 H. H. Nguyen , E. Szemeredi , V. H. Vu

In this paper we study sums and products in a field. Let $F$ be a field with ${\rm ch}(F)\not=2$, where ${\rm ch}(F)$ is the characteristic of $F$. For any integer $k\ge4$, we show that each $x\in F$ can be written as $a_1+\ldots+a_k$ with…

数论 · 数学 2018-07-04 Guang-Liang Zhou , Zhi-Wei Sun

We investigate the size of subspaces in sumsets and show two main results. First, if A is a subset of F_2^n with density at least 1/2 - o(n^{-1/2}) then A+A contains a subspace of co-dimension 1. Secondly, if A is a subset of F_2^n with…

数论 · 数学 2010-12-03 Tom Sanders

Many real applications problems can be encoded easily as quantified formulas in SMT. However, this simplicity comes at the cost of difficulty during solving by SMT solvers. Different strategies and quantifier instantiation techniques have…

计算机科学中的逻辑 · 计算机科学 2025-08-13 Mudathir Mohamed , Nick Feng , Andrew Reynolds , Cesare Tinelli , Clark Barrett , Marsha Chechik

In this paper we introduce a technique to determine the sumset $A+A$, where $A$ is the indicator function of the 0's occurring in a fixed point $x$ of a substitution on the alphabet $\{0,1\}$.

组合数学 · 数学 2021-05-12 F. Michel Dekking

It is an open problem in additive number theory to compute and understand the full range of sumset sizes of finite sets of integers, that is, the set $\mathcal{R}_{\mathbf{Z}}(h,k)= \{|hA|:A \subseteq {\mathbf{Z}} \text{ and } |A|=k\}$ for…

数论 · 数学 2026-04-07 Melvyn B. Nathanson

This paper considers various formulations of the sum-product problem. It is shown that, for a finite set $A\subset{\mathbb{R}}$, $$|A(A+A)|\gg{|A|^{\frac{3}{2}+\frac{1}{178}}},$$ giving a partial answer to a conjecture of Balog. In a…

组合数学 · 数学 2014-01-09 Brendan Murphy , Oliver Roche-Newton , Ilya D. Shkredov

For a subset A of a field F, write A(A + 1) for the set {a(b + 1):a,b\in A}. We establish new estimates on the size of A(A+1) in the case where F is either a finite field of prime order, or the real line. In the finite field case we show…

组合数学 · 数学 2012-08-06 Timothy G. F. Jones , Oliver Roche-Newton

We obtain lower bounds for the cardinality of $k$-fold sum-sets of reciprocals of elements of suitable defined short intervals in high degree extensions of finite fields. Combining our results with bounds for multilinear character sums we…

数论 · 数学 2016-11-24 Igor E. Shparlinski , Ana Zumalacárregui

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

组合数学 · 数学 2018-12-27 Ishay Haviv

This paper discusses the question of how many non-empty subsets of the set $[n] = \{ 1, 2, ..., n\}$ we can choose so that no chosen subset is the union of some other chosen subsets. Let $M(n)$ be the maximum number of subsets we can…

组合数学 · 数学 2015-11-03 Andy Loo

Given a set $A \subseteq \mathbb{F}_p^n$, what conditions does one need to guarantee that iterated sumsets of the form $A+\cdots+A$ expand quickly (say, within $O(p)$ terms) to the whole space? When only the size of $A$ is known, such…

组合数学 · 数学 2025-10-13 Manik Dhar , Sammy Luo

Studies on partition of $I_n$ = $\{1, 2, . . . , n\}$ into subsets $S_1, S_2, . . . , S_x$ so far considered with prescribed sum of the elements in each subset. In this paper, we study constant sum partitions $\{S_1,S_2,...,S_x\}$ of $I_n$…

组合数学 · 数学 2023-12-04 V. Vilfred Kamalappan , Sajidha P

For two sets $A$ and $M$ of positive integers and for a positive integer $n$, let $p(n,A,M)$ denote the number of partitions of $n$ with parts in $A$ and multiplicities in $M$, that is, the number of representations of $n$ in the form…

组合数学 · 数学 2012-07-16 Noga Alon

We consider the possible sizes of large sumfree sets contained in the discrete hypercube $\{1,...,n\}^k$, and we determine upper and lower bounds for the maximal size as $n$ becomes large. We also discuss a continuous analogue in which our…

数论 · 数学 2015-05-13 Daniel Katz

We improve a result of Solymosi on sum-products in R, namely, we prove that max{|A+A|,|AA|}\gg |A|^{4/3+c}, where c>0 is an absolute constant. New lower bounds for sums of sets with small product set are found. Previous results are improved…

组合数学 · 数学 2015-03-31 Sergei Konyagin , Ilya D. Shkredov

Let $\mathbf{A} = (A_1,\ldots, A_q)$ be a $q$-tuple of finite sets of integers. Associated to every $q$-tuple of nonnegative integers $\mathbf{h} = (h_1,\ldots, h_q)$ is the linear form $\mathbf{h}\cdot \mathbf{A} = h_1 A_1 + \cdots +…

数论 · 数学 2021-11-05 Melvyn B. Nathanson