Related papers: Multi-wise and constrained fully weighted Davenpor…

Let $p$ be a prime number, $q=p^s$ for a positive integer $s$. For any positive divisor $e$ of $q-1$, we construct an infinite family codes of size $q^{2m}$ with few Lee-weight. These codes are defined as trace codes over the ring…

We study the singular series associated to a cubic form with integer coefficients. If the number of variables is at least $10$, we prove the absolute convergence (and hence positivity) under the assumption of Davenport's Geometric…

We consider the fundamental algorithmic problem of finding a cycle of minimum weight in a weighted graph. In particular, we show that the minimum weight cycle problem in an undirected n-node graph with edge weights in {1,...,M} or in a…

Let $G$ be an additive finite abelian group with exponent $\exp(G)$. For $L\subseteq \mathbb N$, let $\mathsf{s}_{L}(G)$ be the smallest integer $\ell$ such that every sequence $S$ over $G$ of length $\ell$ has a zero-sum subsequence $T$ of…

For two given graphs $G$ and $F$, a graph $ H$ is said to be weakly $ (G, F) $-saturated if $H$ is a spanning subgraph of $ G$ which has no copy of $F$ as a subgraph and one can add all edges in $ E(G)\setminus E(H)$ to $ H$ in some order…

Let m, n be positive integers, v a multilinear commutator word and w = v^m. Denote by v(G) and w(G) the verbal subgroups of a group G corresponding to v and w, respectively. We prove that the class of all groups G in which the w-values are…

The classical Cauchy--Davenport inequality gives a lower bound for the size of the sum of two subsets of ${\mathbb Z}_p$, where $p$ is a prime. Our main aim in this paper is to prove a considerable strengthening of this inequality, where we…

Given a connected graph $G$, a set of vertices $X\subset V(G)$ is a weak $k$-resolving set of $G$ if for each two vertices $y,z\in V(G)$, the sum of the values $|d_G(y,x)-d_G(z,x)|$ over all $x\in X$ is at least $k$, where $d_G(u,v)$ stands…

Given a connected graph $G=(V,E)$ and a length function $\ell:E\to {\mathbb R}$ we let $d_{v,w}$ denote the shortest distance between vertex $v$ and vertex $w$. A $t$-spanner is a subset $E'\subseteq E$ such that if $d'_{v,w}$ denotes…

In this work, we study two types of constraints on two-dimensional binary arrays. In particular, given $p,\epsilon>0$, we study (i) The $p$-bounded constraint: a binary vector of size $m$ is said to be $p$-bounded if its weight is at most…

Permutation codes of length $n$ and distance $d$ is a set of permutations on $n$ symbols, where the distance between any two elements in the set is at least $d$. Subgroup permutation codes are permutation codes with the property that the…

For an abelian group $G$ and an integer $t > 0$, the \emph{modified Erd\"os--Ginzburg--Ziv constant} $s_t'(G)$ is the smallest integer $\ell$ such that any zero-sum sequence of length at least $\ell$ with elements in $G$ contains a zero-sum…

Suppose $G$ is a finite abelian group and $S$ is a sequence of elements in $G$. For any element $g$ of $G$, let $N_g(S)$ denote the number of subsequences of $S$ with sum $g$. The purpose of this paper is to investigate the lower bound for…

Denote by $\mathrm m(S)$ the multiplicity of a numerical semigroup $S$. A covariety is a nonempty family $\mathscr{C}$ of numerical semigroups that fulfills the following conditions: there is the minimum of $\mathscr{C},$ the intersection…

A mixed dominating set of a graph $G = (V, E)$ is a mixed set $D$ of vertices and edges, such that for every edge or vertex, if it is not in $D$, then it is adjacent or incident to at least one vertex or edge in $D$. The mixed domination…

For a finite abelian group $(G,+, 0)$ the Harborth constant $\mathsf{g}(G)$ is the smallest integer $k$ such that each squarefree sequence over $G$ of length $k$, equivalently each subset of $G$ of cardinality at least $k$, has a…

Weighting methods are widely used to adjust for covariates in observational studies, sample surveys, and regression settings. In this paper, we study a class of recently proposed weighting methods which find the weights of minimum…

We study the problem of estimating the sum of $n$ elements, each with weight $w(i)$, in a structured universe. Our goal is to estimate $W = \sum_{i=1}^n w(i)$ within a $(1 \pm \epsilon)$ factor using a sublinear number of samples, assuming…

Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, this work introduces the notion of almost lossless source coding. Analog to the weak variable-length source coding problem studied by Han…

Let $\mathcal{S}$ be a finite commutative semigroup. The Davenport constant of $\mathcal{S}$, denoted $D(\mathcal{S})$, is defined to be the least positive integer $d$ such that every sequence $T$ of elements in $\mathcal{S}$ of length at…