Related papers: Coordinate sum and difference sets of $d$-dimensio…

Chebyshev famously observed empirically that more often than not, there are more primes of the form $3 \bmod 4$ up to $x$ than of the form $1 \bmod 4$. This was confirmed theoretically much later by Rubinstein and Sarnak in a logarithmic…

A More Sums Than Difference (MSTD) set is a finite set of integers $A$ where the cardinality of its sumset, $A+A$, is greater than the cardinality of its difference set, $A-A$. Since addition is commutative while subtraction isn't, it was…

A subset $D$ of vertices of a graph $G$ is a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $D$. The total dominating set $D$ is called a total co-independent dominating set if the subgraph induced by…

Many results in extremal graph theory can be formulated as certain polynomial inequalities in graph homomorphism densities. Answering fundamental questions raised by Lov{\'a}sz, Szegedy and Razborov, Hatami and Norine proved that…

This article investigates the concept of dominant metric dimensions in zero divisor graphs (ZD-graphs) associated with rings. Consider a finite commutative ring with unity, denoted as R, where nonzero elements x and y are identified as zero…

Let $G=(V, E)$ be a simple and undirected graph. For some integer $k\geq 1$, a set $D\subseteq V$ is said to be a k-dominating set in $G$ if every vertex $v$ of $G$ outside $D$ has at least $k$ neighbors in $D$. Furthermore, for some real…

Given $n$ positive integers $a_1,a_2,\dots,a_n$, and a positive integer right hand side $\beta$, we consider the feasibility version of the subset sum problem which is the problem of determining whether a subset of $a_1,a_2,\dots,a_n$ adds…

We briefly review known results on upper bounds for the minimal domination number $\gamma_n$ of a hypercube of dimension $n$, then present a new method for constructing dominating sets. Write $n =2^{\hat{n}}-1 +{\check{n}}$ with $0\leq…

Kwapien and Woyczynski asked in their monograph (1992) whether their notion of superstrong domination is inherited when taking sums of independent symmetric random vectors (one vector dominates another if, essentially, tail probabilities of…

Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is…

Let $\textrm{Mat}_2(\mathbb{R})$ be the set of $2 \times 2$ matrices with real entries. For any $\varepsilon>0$ and any finitely--supported probability measure $\mu$ on $\textrm{Mat}_2(\mathbb{R})$, we prove that either \[ T(\mu) = \sum_{X,…

In this paper we start to investigate a new body of questions in additive combinatorics. The fundamental Cauchy--Davenport theorem gives a lower bound on the size of a sumset A+B for subsets of the cyclic group Zp of order p (p prime), and…

A set of vertices $X\subseteq V(G)$ is a $d$-distance dominating set if for every $u\in V(G)\setminus X$ there exists $x\in X$ such that $d(u,x) \le d$, and $X$ is a $p$-packing if $d(u,v) \ge p+1$ for every different $u,v\in X$. The…

We generalize the notion of Davenport constants to a `higher degree' and obtain various lower and upper bounds, which are sometimes exact as is the case for certain finite commutative rings of prime power cardinality. Two simple examples…

Let $D=(V,A)$ be a digraph. A subset $S$ of $V$ is called a twin dominating set of $D$ if for every vertex $v\in V-S$, there exists vertices $u_1,u_2 \in S$ such that $(v,u_1)$ and $(u_2,v)$ are arcs in $D$. The minimum cardinality of a…

The dominating set problem (DSP) is one of the most famous problems in combinatorial optimization. It is defined as follows. For a given simple graph $G=(V,E)$, a dominating set of $G$ is a subset $S\subseteq V$ such that every vertex in $…

For any finite set of integers X, define its sumset X+X to be {x+y: x, y in X}. In a recent paper, Martin and O'Bryant investigated the distribution of |A+A| given the uniform distribution on subsets A of {0, 1, ..., n-1}. They also…

A dominating set $S$ of graph $G$ is called an $r$-grouped dominating set if $S$ can be partitioned into $S_1,S_2,\ldots,S_k$ such that the size of each unit $S_i$ is $r$ and the subgraph of $G$ induced by $S_i$ is connected. The concept of…

A set $D$ of vertices in a graph $G$ is called dominating if every vertex of $G$ is either in $D$ or adjacent to a vertex of $D$. The paired domination number $\gamma_{\mathrm{pr}}(G)$ of $G$ is the minimum size of a dominating set whose…

A dominating set $D$ in a digraph is a set of vertices such that every vertex is either in $D$ or has an in-neighbour in $D$. A dominating set $D$ of a digraph is locating-dominating if every vertex not in $D$ has a unique set of…