Related papers: On weak $\epsilon$-nets and the Radon number

We show that groups with a mild form of non-positive curvature (a navigable path system) satisfy the weak rank rigidity conjecture: they either have linear divergence or a Morse element. This class includes discrete groups of projective…

One of the most important and well-studied settings for network design is edge-connectivity requirements. This encompasses uniform demands such as the Minimum $k$-Edge-Connected Spanning Subgraph problem ($k$-ECSS), as well as nonuniform…

An approach to find a weak form of shadowing is developed. We consider homeomorphisms of a compact metric space. It is proved that every pseudotrajectory with sufficiently small errors contains at least one subsequence that can be shadowed…

We define a weakly threshold sequence to be a degree sequence $d=(d_1,\dots,d_n)$ of a graph having the property that $\sum_{i \leq k} d_i \geq k(k-1)+\sum_{i > k} \min\{k,d_i\} - 1$ for all positive $k \leq \max\{i:d_i \geq i-1\}$. The…

An $r$-identifying code on a graph $G$ is a set $C\subset V(G)$ such that for every vertex in $V(G)$, the intersection of the radius-$r$ closed neighborhood with $C$ is nonempty and unique. On a finite graph, the density of a code is…

We study versions of Helly's theorem that guarantee that the intersection of a family of convex sets in $R^d$ has a large diameter. This includes colourful, fractional and $(p,q)$ versions of Helly's theorem. In particular, the fractional…

The weak-binding relation is a useful tool to study the internal structure of hadrons from the observable quantities. We introduce the range correction in the weak-binding relation for the system having a sizable magnitude of the effective…

One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…

We investigate the properties of certain elliptic systems leading, a~priori, to solutions that belong to the space of Radon measures. We show that if the problem is equipped with a so-called asymptotic Uhlenbeck structure, then the solution…

Let $\Omega\subset\mathbb{R}^3$ be a domain and let $f\in BV_{\operatorname{loc}}(\Omega,\mathbb{R}^3)$ be a homeomorphism such that its distributional adjugate is a finite Radon measure. We show that its inverse has bounded variation…

A set $W$ of vertices of $G$ is said to be a weak total resolving set for $G$ if $W$ is a resolving set for $G$ as well as for each $w\in W$, there is at least one element in $W-\{w\}$ that resolves $w$ and $v$ for every $v\in V(G)- W$.…

We prove a weak version of the $\varepsilon$-Dvoretzky conjecture for normed spaces, showing the existence of a subspace of $\mathbb{R}^n$ of dimension at least $c \log n / |\log \varepsilon|$ in which the given norm is $\varepsilon$-close…

Coded recurrent neural networks with three levels of sparsity are introduced. The first level is related to the size of messages, much smaller than the number of available neurons. The second one is provided by a particular coding rule,…

Recently, the first author proposed a measure to calculate Pearson correlations for node values expressed in a network, by taking into account distances or metrics defined on the network. In this technical note, we show that using an…

In \cite{Elek} we proved that the limit of a weakly convergent sequence of finite graphs can be viewed as a graphing or a continuous field of infinite graphs. Thus one can associate a type $II_1$-von Neumann algebra to such graph sequences.…

We study an analogue of the Ramsey multiplicity problem for additive structures, in particular establishing the minimum number of monochromatic 3-APs in 3-colorings of $\mathbb{F}_3^n$ as well as obtaining the first non-trivial lower bound…

Random geometric networks consist of 1) a set of nodes embedded randomly in a bounded domain $\mathcal{V} \subseteq \mathbb{R}^d$ and 2) links formed probabilistically according to a function of mutual Euclidean separation. We quantify how…

Let $G=(V(G),E(G))$ be a simple graph. A non-empty set $S\subseteq V (G)$ is a weakly connected dominating set in $G$, if the subgraph obtained from $G$ by removing all edges each joining any two vertices in $V (G)\setminus S$ is connected.…

A weak metric on a set is a function that satisfies the axioms of a metric except the symmetry and the separation axioms. In the present paper we introduced a weak metric, called the Apollonian weak metric, on any subset of a Euclidean…

In this paper we consider two natural notions of connectivity for hypergraphs: weak and strong. We prove that the strong vertex connectivity of a connected hypergraph is bounded by its weak edge connectivity, thereby extending a theorem of…