相关论文: On weak $\epsilon$-nets and the Radon number
$\newcommand{\eps}{\varepsilon}\newcommand{\tldO}{\widetilde{O}}$Consider the problem of constructing weak $\eps$-nets where the stabbing elements are lines or $k$-flats instead of points. We study this problem in the simplest setting where…
A weak odd dominated (WOD) set in a graph is a subset B of vertices for which there exists a distinct set of vertices C such that every vertex in B has an odd number of neighbors in C. We point out the connections of weak odd domination…
In this paper, we prove that the distance function of an open connected set in $\mathbb R^{n+1}$ with a $C^{2}$ boundary is superharmonic in the distribution sense if and only if the boundary is {\em weakly mean convex}. We then prove that…
VC-dimension and $\varepsilon$-nets are key concepts in Statistical Learning Theory. Intuitively, VC-dimension is a measure of the size of a class of sets. The famous $\varepsilon$-net theorem, a fundamental result in Discrete Geometry,…
Triggered by experimentally driven renewed interest in hyperon properties we address the subject of weak radiative hyperon decays (WRHD). We start with the issue of Hara's theorem and briefly discuss the question of its possible evasion.…
The erosion of a set in Euclidean space by a radius r>0 is the subset of X consisting of points at distance >/-r from the complement of X. A set is resilient to erosion if it is similar to its erosion by some positive radius. We give a…
We give a necessary and sufficient condition for gluings of hyperconvex metric spaces along weakly externally hyperconvex subsets in order that the resulting space be hyperconvex. This leads to a full characterization of gluings of two…
The present work considers the properties of generally convex sets in the $n$-dimensional real Euclidean space $\mathbb{R}^n$, $n>1$, known as weakly $m$-convex, $m=1,2,\ldots,n-1$. An open set of $\mathbb{R}^n$ is called weakly $m$-convex…
It has been proved that the sup-norm of the Radon transform of an arbitrary probability density on an origin-symmetric convex body of volume 1 is bounded from below by a positive constant depending only on the dimension. In this note we…
We characterize the virtual link invariants that can be described as partition function of a real-valued R-matrix, by being weakly reflection positive. Weak reflection positivity is defined in terms of joining virtual link diagrams, which…
A lower bound on the chromatic number of a graph is derived by majorization of spectra of weighted adjacency matrices. These matrices are given by Hadamard products of the adjacency matrix and arbitrary Hermitian matrices.
The problem of continuum percolation in dispersions of rods is reformulated in terms of weighted random geometric graphs. Nodes (or sites or vertices) in the graph represent spatial locations occupied by the centers of the rods. The…
In the study of reaction networks and the polynomial dynamical systems that they generate, special classes of networks with important properties have been identified. These include reversible, weakly reversible}, and, more recently,…
A majority of real life networks are weighted and sparse. The present article aims at characterization of weighted networks based on sparsity, as a measure of inherent diversity, of different network parameters. It utilizes sparsity index…
We show that the order dimension of the weak order on a Coxeter group of type A, B or D is equal to the rank of the Coxeter group, and give bounds on the order dimensions for the other finite types. This result arises from a unified…
Using the theory of negative association for measures and the notion of random weak limits of sparse graphs, we establish the validity of the cavity method for counting spanning subgraphs subject to local constraints in asymptotically…
Weakly chaotic or weakly interacting systems have a wide regime where the common random matrix theory modeling does not apply. As an example we consider cold atoms in a nearly integrable optical billiard with displaceable wall ("piston").…
The theory of graphons comes with the so-called cut norm and the derived cut distance. The cut norm is finer than the weak* topology (when considering the predual of $L^{1}$-functions). Dole\v{z}al and Hladk\'y [J. Combin. Theory Ser. B 137…
Critical nets in $\mathbb{R}^k$ (sometimes called geodesic nets) are embedded graph with the property that their embedding is a critical point of the total (edge) length functional and under the constraint that certain 1-valent vertices…
We consider Sobolev mappings $f\in W^{1,q}(\Omega,\IC)$, $1<q<\infty$, between planar domains $\Omega\subset \IC$. We analyse the Radon-Riesz property for convex functionals of the form \[f\mapsto \int_\Omega \Phi(|Df(z)|,J(z,f)) \; dz \]…