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

Let X be a separable Banach space and Y a space which has the Radon-Nikodym property. In this work, we show that L(X, Y) has the Radon-Nikodym property, if L(X, Y) is weakly locally uniformly convex or if L(X, Y) is a weakly compactly gen-…

A compact space is said to be weakly Radon-Nikod\'{y}m (WRN) if it can be weak*-embedded into the dual of a Banach space not containing $\ell_1$. We investigate WRN Boolean algebras, i.e. algebras whose Stone space is WRN compact. We show…

Let R be an associative ring with possible extra structure. R is said to be weakly small if there are countably many 1-types over any finite subset of R. It is locally P if the algebraic closure of any finite subset of R has property P. It…

Many interesting problems are obtained by attempting to generalize classical results on convexity in Euclidean spaces to other convexity spaces, in particular to convexity spaces on graphs. In this paper we consider $P_3$-convexity on…

There were obtained some properties of weakly m-convex sets. Various kinds of the problem of shadow were investigated. There was obtained the lower estimation for the number of balls that are necessary to create a shadow at the point of the…

Geometry can be used to explain many properties commonly observed in real networks. It is therefore often assumed that real networks, especially those with high average local clustering, live in an underlying hidden geometric space.…

Sidorenko's conjecture states that the number of copies of a bipartite graph $H$ in a graph $G$ is asymptotically minimised when $G$ is a quasirandom graph. A notorious example where this conjecture remains open is when $H=K_{5,5}\setminus…

This paper presents a new general formulation of the Radon-Nikodym theorem in the setting of abstract measure theory. We introduce the notion of weak localizability for a measure and show that this property is both necessary and sufficient…

We study the weak $K_s$-saturation number of the Erd\H{o}s--R\'{e}nyi random graph $\mathbbmsl{G}(n, p)$, denoted by $\mathrm{wsat}(\mathbbmsl{G}(n, p), K_s)$, where $K_s$ is the complete graph on $s$ vertices. Kor\'{a}ndi and Sudakov in…

Several years ago the authors started looking at some problems of convex geometry from a more general point of view, replacing volume by an arbitrary measure. This approach led to new general properties of the Radon transform on convex…

We prove that there exist no weak $\varepsilon$-nets of constant size for lines and convex sets in $\mathbb{R}^d$.

Given a graph $G$ and a collection $\mathcal C$ of subsets of $\mathbb{R}^d$ indexed by the subsets of vertices of $G$, a constrained drawing of $G$ is a drawing, where each edge is drawn inside some set from $\mathcal C$, in such a way…

This work considers the robustness of uncertain consensus networks. The first set of results studies the stability properties of consensus networks with negative edge weights. We show that if either the negative weight edges form a cut in…

Singular or weak solutions of the incompressible Euler equations have been hypothesized to account for anomalous dissipation at very high Reynolds numbers and, in particular, to explain the d'Alembert paradox of non-vanishing drag. A…

Let $E$ be a Banach space such that $E'$ has the Radon-Nikod\'ym property. The aim of this work is to connect relative weak compactness in the $E$-valued martingale Hardy space $H^{1}(\mu,E)$ to a convex compactness criterion in a weaker…

We study a natural generalization of the classical $\epsilon$-net problem (Haussler--Welzl 1987), which we call the "$\epsilon$-$t$-net problem": Given a hypergraph on $n$ vertices and parameters $t$ and $\epsilon\geq \frac t n$, find a…

For a fixed graph $H$, we say that an edge-colored graph $G$ is \emph{weakly $H$-rainbow saturated} if there exists an ordering $e_1, e_2, \ldots, e_m$ of $E\left(\overline{G}\right)$ such that, for any list $c_1, c_2, \ldots, c_m$ of…

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 dynamical system with polynomial right-hand side, can it be generated by a reaction network that possesses certain properties? This question is important because some network properties may guarantee specific dynamical properties,…

We prove that if a given reaction network $\mathcal{N}$ has a weakly reversible deficiency zero realization for all choice of rate constants, then there exists a $\textit{unique}$ weakly reversible deficiency zero network $\mathcal{N}'$…