Related papers: Compression and complexity for sumset sizes in add…

We consider the geometric problem of determining the maximum number $n_q(r,h,f;s)$ of $(h-1)$-spaces in the projective space $\operatorname{PG}(r-1,q)$ such that each subspace of codimension $f$ does contain at most $s$ elements. In coding…

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…

We study relations between subsets of integers that are large, where large can be interpreted in terms of size (such as a set of positive upper density or a set with bounded gaps) or in terms of additive structure (such as a Bohr set). Bohr…

Set packing is a fundamental problem that generalises some well-known combinatorial optimization problems and knows a lot of applications. It is equivalent to hypergraph matching and it is strongly related to the maximum independent set…

In this paper some links between the density of a set of integers and the density of its sumset, product set and set of subset sums are presented.

We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Fre\u{i}man dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 K))$. This can be thought of…

When defining the amount of additive structure on a set it is often convenient to consider certain sumsets; Calculating the cardinality of these sumsets can elucidate the set's underlying structure. We begin by investigating finite sets of…

The paper addresses aggregation issues for composite (modular) solutions. A systemic view point is suggested for various aggregation problems. Several solution structures are considered: sets, set morphologies, trees, etc. Mainly, the…

This article details the algorithmics in FLSSS, an R package for solving various subset sum problems. The fundamental algorithm engages the problem via combinatorial space compression adaptive to constraints, relaxations and variations that…

In this paper we study some additive properties of subsets of the set $\nats$ of positive integers: A subset $A$ of $\nats$ is called {\it $k$-summable} (where $k\in\ben$) if $A$ contains $\textstyle \big{\sum_{n\in F}x_n | \emp\neq…

We investigate the structure of finite sets $A \subseteq \Z$ where $|A+A|$ is large. We present a combinatorial construction that serves as a counterexample to natural conjectures in the pursuit of an "anti-Freiman" theory in additive…

Nathanson introduced the range of cardinalities of $h$-fold sumsets $R(h,k) := \{|hA|:A \subset \mathbb{Z} \text{ and }|A| = k\}.$ Following a remark of Erd\H{o}s and Szemer\'edi that determined the form of $R(h,k)$ when $h=2$, Nathanson…

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…

In the field of algorithmic analysis, one of the more well-known exercises is the subset sum problem. That is, given a set of integers, determine whether one or more integers in the set can sum to a target value. Aside from the brute-force…

We study the parameterized complexity of algorithmic problems whose input is an integer set $A$ in terms of the doubling constant $C := |A + A|/|A|$, a fundamental measure of additive structure. We present evidence that this new…

Boundary integral equations lead to dense system matrices when discretized, yet they are data-sparse. Using the $\mathcal{H}$-matrix format, this sparsity is exploited to achieve $\mathcal{O}(N\log N)$ complexity for storage and…

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…

Let $A\subseteq \mathbb{Z}_{\geq 0}$ be a finite set with minimum element $0$, maximum element $m$, and $\ell$ elements strictly in between. Write $(hA)^{(t)}$ for the set of integers that can be written in at least $t$ ways as a sum of $h$…

How can we compress language models without sacrificing accuracy? The number of compression algorithms for language models is rapidly growing to benefit from remarkable advances of recent language models without side effects due to the…