中文
相关论文

相关论文: Some explicit constructions of sets with more sums…

200 篇论文

We provide upper bounds on the largest subsets of $\{1,2,\dots,N\}$ with no differences of the form $h_1(n_1)+\cdots+h_{\ell}(n_{\ell})$ with $n_i\in \mathbb{N}$ or $h_1(p_1)+\cdots+h_{\ell}(p_{\ell})$ with $p_i$ prime, where $h_i\in…

数论 · 数学 2016-12-08 Neil Lyall , Alex Rice

A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…

组合数学 · 数学 2024-06-07 Norbert Hegyvári , Máté Pálfy , Erfei Yue

Ruzsa's inequality states that $|A+A+A| \leq |A+A|^{3/2}$ for any finite set $A$ in a commutative group. Ruzsa has constructed examples showing that this inequality is sharp asymptotically, up to a constant factor. We prove an inverse…

组合数学 · 数学 2025-10-28 Swaroop Hegde

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

组合数学 · 数学 2022-04-22 Bela Bollobas , Imre Leader , Marius Tiba

In this paper, six constructions of difference families are presented. These constructions make use of difference sets, almost difference sets and disjoint difference families, and give new point of views of relationships among these…

信息论 · 计算机科学 2014-11-14 Cunsheng Ding , Chik How Tan , Yin Tan

A set of $b$ mutually unbiased bases (MUBs) in $\mathbb{C}^d$ (for $d > 1$) comprises $bd$ vectors in $\mathbb{C}^d$, partitioned into $b$ orthogonal bases for $\mathbb{C}^d$ such that the pairwise angle between all vectors from distinct…

组合数学 · 数学 2016-04-19 Jonathan Jedwab , Lily Yen

We estimate the sizes of the sumset A + A and the productset A $\cdot$ A in the special case that A = S (x, y), the set of positive integers n less than or equal to x, free of prime factors exceeding y.

数论 · 数学 2010-10-19 William D. Banks , David Covert

Let $A$ be a subset of primes up to $x$. If we assume $A$ is well-distributed (in the Siegel-Walfisz sense) in any arithmetic progressions to moduli $q\leqslant(\log x)^c$ for any $c>0$, then the sumset $A+A$ has density 1/2 in the natural…

数论 · 数学 2012-07-31 Ping Xi

First we give an overview of the known supplementary difference sets (SDS) (A_i), i=1..4, with parameters (n;k_i;d), where k_i=|A_i| and each A_i is either symmetric or skew and k_1 + ... + k_4 = n + d. Five new Williamson matrices over the…

组合数学 · 数学 2010-02-14 Dragomir Z. Djokovic

We construct finite sets of real numbers that have a small difference set and strong local properties. In particular, we construct a set $A$ of $n$ real numbers such that $|A-A|=n^{\log_2 3}$ and that every subset $A'\subseteq A$ of size…

组合数学 · 数学 2018-12-27 Sara Fish , Ben Lund , Adam Sheffer

We give conditions under which certain digit-restricted integer sets avoid $k$-term arithmetic progressions. These sets and their harmonic sums can be computed efficiently. Through large-scale search, we identify integer sets avoiding…

数论 · 数学 2025-09-05 Alexander Walker

We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|A|$ in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are…

组合数学 · 数学 2017-12-04 Brendan Murphy , Misha Rudnev , Ilya D. Shkredov , Yurii N. Shteinikov

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…

数论 · 数学 2023-05-22 Xin-Qi Luo , Zhi-Wei Sun

We prove a structural result for sets of integers with doubling at most $4 + \delta$, with $\delta>0$ sufficiently small. This generalises earlier work of Eberhard--Green--Manners which dealt with sets of integers with doubling strictly…

数论 · 数学 2026-04-29 Yifan Jing , Akshat Mudgal

Let s,t,m,n be positive integers such that sm=tn. Let M(m,s;n,t) be the number of m x n matrices over {0,1,2,...} with each row summing to s and each column summing to t. Equivalently, M(m,s;n,t) counts 2-way contingency tables of order m x…

组合数学 · 数学 2009-06-12 E. Rodney Canfield , Brendan D. McKay

In the paper we are studying some properties of subsets Q of sums of dissociated sets. The exact upper bound for the number of solutions of the following equation (1) q_1 + ... + q_p = q_{p+1} + ... + q_{2p}, q_i \in Q in groups F_2^n is…

数论 · 数学 2007-12-10 I. D. Shkredov

We define two families of expansions of $(\mathbb{Z},+,0)$ by unary predicates, and prove that their theories are superstable of $U$-rank $\omega$. The first family consists of expansions $(\mathbb{Z},+,0,A)$, where $A$ is an infinite…

逻辑 · 数学 2020-05-22 Gabriel Conant

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…

组合数学 · 数学 2019-03-13 Ilkyoo Choi , Ringi Kim , Boram Park

Fix $A$, a family of subsets of natural numbers, and let $G_A(n)$ be the maximum cardinality of a subset of $\{1,2,..., n\}$ that does not have any subset in $A$. We consider the general problem of giving upper bounds on $G_A(n)$ and give…

数论 · 数学 2015-06-16 Kevin O'Bryant

Let $d \geq 3$ be a natural number. We show that for all finite, non-empty sets $A \subseteq \mathbb{R}^d$ that are not contained in a translate of a hyperplane, we have \[ |A-A| \geq (2d-2)|A| - O_d(|A|^{1- \delta}),\] where $\delta >0$ is…

组合数学 · 数学 2023-06-22 Akshat Mudgal