Related papers: On the structures of subset sums in higher dimensi…

The class of problems complete for NP via first-order reductions is known to be characterized by existential second-order sentences of a fixed form. All such sentences are built around the so-called generalized IS-form of the sentence that…

Fix a positive real number $\theta$. The natural numbers $m$ with largest square-free divisor not exceeding $m^\theta$ form a set $\mathscr{A}$, say. It is shown that whenever $\theta>1/2$ then all large natural numbers $n$ are the sum of…

Let $\mathbb{F}_q$ be the finite field of $q$ elements, for a given subset $D\subset \mathbb{F}_q$, $m\in \mathbb{N}$, an integer $k\leq |D|$ and $\boldsymbol{b}\in \mathbb{F}_q^m$ we are interested in determining the existence of a subset…

Nested counter systems (NCS) are a generalization of counter systems to higher-order counters. Here, a higher-order counter is allowed to have other (lower-order) counters as elements, instead of just a number. Such systems can be viewed as…

Hyperspaces form a powerful tool in some branches of mathematics: lots of fractal and other geometric objects can be viewed as fixed points of some functions in suitable hyperspaces - as well as interesting classes of formal languages in…

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…

Given positive integers $n,k$ with $k\leq n$, we consider the number of ways of choosing $k$ subsets of $\{1,\ldots,n\}$ in such a way that the union of these subsets gives $\{1,\ldots,n\}$ and they are not subsets of each other. We refer…

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…

We discuss a structural approach to subset-sum problems in additive combinatorics. The core of this approach are Freiman-type structural theorems, many of which will be presented through the paper. These results have applications in various…

This report presents an expression for the number of a multiset's sub-multisets of a given cardinality as a function of the multiplicity of its elements. This is also the number of distinct samples of a given size that may be produced by…

A set of sets is called a family. Two families $\mathcal{A}$ and $\mathcal{B}$ of sets are said to be cross-intersecting if each member of $\mathcal{A}$ intersects each member of $\mathcal{B}$. For any two integers $n$ and $k$ with $1 \leq…

The A-hierarchy is a parametric analogue of the polynomial hierarchy in the context of paramterised complexity theory. We give a new characterisation of the A-hierarchy in terms of a generalisation of the SUBSET-SUM problem.

Using well-known mathematical problems for encryption is a widely used technique because they are computationally hard and provide security against potential attacks on the encryption method. The subset sum problem (SSP) can be defined as…

A set $A\subset \mathbb{F}_p^n$ is sum-free if $A+A$ does not intersect $A$. If $p\equiv 2 \mod 3$, the maximal size of a sum-free in $\mathbb{F}_p^n$ is known to be $(p^n+p^{n-1})/3$. We show that if a sum-free set $A\subset…

The purpose of this paper is to study the fractal phenomena in large data sets and the associated questions of dimension reduction. We examine situations where the classical Principal Component Analysis is not effective in identifying the…

Let $(P_1,...,P_n)$ be an $n$--tuple of projections in a unital $C^*$--algebra $\aa$. We say $\pn$ is complete in $\aa$ if $\aa$ is the linear direct sum of the closed subspaces $P_1\aa,...,P_n\aa$. In this paper, we give some necessary and…

In this article, we show that the completion problem, i.e. the decision problem whether a partial structure can be completed to a full structure, is NP-complete for many combinatorial structures. While the gadgets for most reductions in…

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.

This paper covers some recent progress in the study of sg-open sets, sg-compact spaces, N-scattered spaces and some related concepts. A subset $A$ of a topological space $(X,\tau)$ is called sg-closed if the semi-closure of $A$ is included…

This chapter explores the notion of "dimension" of a set. Various power laws by which an Euclidean space can be characterized are used to define dimensions, which then explore different aspects of the set. Also discussed are the…