Related papers: Multi-wise and constrained fully weighted Davenpor…
Applying the max-product (and belief-propagation) algorithms to loopy graphs is now quite popular for best assignment problems. This is largely due to their low computational complexity and impressive performance in practice. Still, there…
We show that the structure constants of W-algebras can be grouped according to the lowest (bosonic) spin(s) of the algebra. The structure constants in each group are described by a unique formula, depending on a functional parameter h(c)…
Given a subset $W$ of an abelian group $G$, a subset $C$ is called an additive complement for $W$ if $W+C=G$; if, moreover, no proper subset of $C$ has this property, then we say that $C$ is a minimal complement for $W$. It is natural to…
Let $q$ be a prime. Let $G$ be a residually finite group satisfying an identity. Suppose that for every $x \in G$ there exists a $q$-power $m=m(x)$ such that the element $x^m$ is a bounded Engel element. We prove that $G$ is locally…
Let $\mathcal{S}$ be a finite commutative semigroup written additively, and let $\exp(\mathcal{S})$ be its exponent which is defined as the least common multiple of all periods of the elements in $\mathcal{S}$. For every sequence $T$ of…
The maximum size of a binary code is studied as a function of its length N, minimum distance D, and minimum codeword weight W. This function B(N,D,W) is first characterized in terms of its exponential growth rate in the limit as N tends to…
For an abelian group $G$ and an integer $t > 0$, the modified Erd\H{o}s-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…
An $(\alpha,\beta)$-spanner of a weighted graph $G=(V,E)$, is a subgraph $H$ such that for every $u,v\in V$, $d_G(u,v) \le d_H(u,v)\le\alpha\cdot d_G(u,v)+\beta$. The main parameters of interest for spanners are their size (number of edges)…
The topological group version of the celebrated Banach-Mazur problem asks wether every infinite topological group has a non-trivial separable quotient group. It is known that compact groups have infinite separable metrizable quotient…
The directed Cayley diameter of a finite group is investigated in terms of the monoid of product-one sequences over the group, via the new notion of directed geodesic atoms. Two quantities associated to the set of directed geodesic atoms…
We study pairs of subsets $A, B$ of a compact abelian group $G$ where the sumset $A+B:=\{a+b: a\in A, b\in B\}$ is small. Let $m$ and $m_{*}$ be Haar measure and inner Haar measure on $G$, respectively. Given $\varepsilon>0$, we classify…
Perturbations of $WD_n$ and $W_3$ conformal theories which generalize the $(1,2)$ perturbations of conformal minimal models are shown to be integrable by counting argument. $A_{2n-1,q}^{(2)}$ and $D_{4,q}^ {(3)}$ symmetries of corresponding…
In this paper we establish a formal connection between the structure of ideals in integers rings and the theory of additive combinatorics. For integers rings with cyclic class groups, we prove a structural theorem demonstrating that every…
Let $G$ be a graph, and let $w: V(G) \to \mathbb{R}$ be a weight function on the vertices of $G$. For every subset $X$ of $V(G)$, let $w(X)=\sum_{v \in X} w(v).$ A non-empty subset $S \subset V(G)$ is a weighted safe set of $(G,w)$ if, for…
Let $G = C_{n_1} \oplus ... \oplus C_{n_r}$ with $1 < n_1 \t ... \t n_r$ be a finite abelian group, $\mathsf d^* (G) = n_1 + ... + n_r - r$, and let $\mathsf d (G)$ denote the maximal length of a zero-sum free sequence over $G$. Then…
The Cauchy-Davenport theorem states that for any two nonempty subsets A and B of Z/pZ we have |A+B| >= min{p,|A|+|B|-1}, where A+B:={a+b (mod p) | a in A, b in B}. We generalize this result from Z/pZ to arbitrary finite (including…
Let $n,d \in \mathbb N$ and $w \in \mathbb F_n$ be non-trivial. We prove that the relatively free group of rank $d$ in the variety defined by the group law $w$ has a largest anabelian finite quotient and estimate its size. Here, a finite…
We investigate the \emph{minimum weight cycle (MWC)} problem in the $\mathsf{CONGEST}$ model of distributed computing. For undirected weighted graphs, we design a randomized algorithm that achieves a $(k+1)$-approximation, for any…
For a weight-set $A\subseteq \mathbb Z_n$, the $A$-weighted zero-sum constant $C_A(n)$ is defined to be the smallest natural number $k$, such that any sequence of $k$ elements in $\mathbb Z_n$ has an $A$-weighted zero-sum subsequence of…
Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…