Related papers: Constructions of Generalized MSTD Sets in Higher D…

The modular subset sum problem consists of deciding, given a modulus $m$, a multiset $S$ of $n$ integers in $0..m-1$, and a target integer $t$, whether there exists a subset of $S$ with elements summing to $t \mod m $, and to report such a…

A partial group with $n+1$ elements is, when regarded as a symmetric simplicial set, of dimension at most $n$. This dimension is $n$ if and only if the partial group is a group. As a consequence of the first statement, finite partial groups…

A set $S\subset\{1,2,...,n\}$ is called a Sidon set if all the sums $a+b~~(a,b\in S)$ are different. Let $S_n$ be the largest cardinality of the Sidon sets in $\{1,2,...,n\}$. In a former article, the author proved the following asymptotic…

{The first version of this text was written and submitted to a journal on April, 12, 2018. This second version was submitted on April, 9, 2019.} We investigate the existence of subsets $A$ and $B$ of $\mathbb{N}:=\{0,1,2,\dots\}$ such that…

Let $G$ be an additive abelian group. A sequence $S = g_1 \cdot \ldots \cdot g_{\ell}$ of terms from $G$ is a plus-minus weighted zero-sum sequence if there are $\varepsilon_1, \ldots, \varepsilon_{\ell} \in \{-1, 1\}$ such that…

We prove that if $A \subset {\Bbb F}_q$ is such that $$|A|>q^{{1/2}+\frac{1}{2d}},$$ then $${\Bbb F}_q^{*} \subset dA^2=A^2+...+A^2 d \text{times},$$ where $$A^2=\{a \cdot a': a,a' \in A\},$$ and where ${\Bbb F}_q^{*}$ denotes the…

In repeated Measure Designs with multiple groups, the primary purpose is to compare different groups in various aspects. For several reasons, the number of measurements and therefore the dimension of the observation vectors can depend on…

In this paper we study geometric aspects of codes in the sum-rank metric. We establish the geometric description of generalised weights, and analyse the Delsarte and geometric dual operations. We establish a correspondence between maximum…

We show that for any set $A \subset \mathbb{N}$ with positive upper density and any $\ell,m \in \mathbb{N}$, there exist an infinite set $B\subset \mathbb{N}$ and some $t\in \mathbb{N}$ so that $\{mb_1 + \ell b_2 \colon b_1,b_2\in B\…

For a set $A$ of integers, the sumset $lA =A+...+A$ consists of those numbers which can be represented as a sum of $l$ elements of $A$ $$lA =\{a_1+... a_l| a_i \in A_i \}. $$ A closely related and equally interesting notion is that of…

Let R be a commutative ring with unity, M a module over R and let S be a G-set for a finite group G. We define a set MS to be the set of elements expressed as the formal finite sum of the form similar to the elements of group ring RG. The…

We describe the structure of a set of integers $A$ of positive density $\delta$, such that $A+A$ contains no squarefree integer. It turns out that the behaviour changes abruptly at the values $\delta_0=1/4-\frac{2}{\pi^2}=0.0473...$ and…

The counting and (upper) mass dimensions are notions of dimension for subsets of $\mathbb{Z}^d$. We develop their basic properties and give a characterization of the counting dimension via coverings. In addition, we prove Marstrand-type…

Let $k \ge 2$ be an integer. We say a set $A$ of positive integers is an asymptotic basis of order $k$ if every large enough positive integer can be represented as the sum of $k$ terms from $A$. A set of positive integers $A$ is called…

For high-rate maximum distance separable (MDS) codes, most of them are designed to optimally repair a single failed node by connecting all the surviving nodes. However, in practical systems, sometimes not all the surviving nodes are…

In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…

The development of machine-learning models for atomic-scale simulations has benefited tremendously from the large databases of materials and molecular properties computed in the past two decades using electronic-structure calculations. More…

Asymptotic methods for hypothesis testing in high-dimensional data usually require the dimension of the observations to increase to infinity, often with an additional condition on its rate of increase compared to the sample size. On the…

A sum-rank-metric code attaining the Singleton bound is called maximum sum-rank distance (MSRD). MSRD codes have been constructed for some parameter cases. In this paper we construct a linear MSRD code over an arbitrary field ${\bf F}_q$…

A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MDS (NMDS) if both it and its dual are AMDS. NMDS codes…