Related papers: VC-Density in Pairs of Ordered Vector Space
We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in the dual linear program. In contrast to the situation in dimensions 8 and 24, where the…
The excellent performance of convolutional low-density parity-check codes is the result of the spatial coupling of individual underlying codes across a window of growing size, but much smaller than the length of the individual codes.…
A geometrical characterization of robustly separable (that is, remaining separable under sufficiently small variiations) mixed states of a bipartite quantum system is given. It is shown that the density matrix of any such state can be…
We study ordinal embedding relaxations in the realm of parameterized complexity. We prove the existence of a quadratic kernel for the {\sc Betweenness} problem parameterized above its tight lower bound, which is stated as follows. For a set…
In Euclidean space, it is well known that any integration by parts formula for a set of finite perimeter $\Omega$ is expressed by the integration with respect to a measure $P(\Omega,\cdot)$ which is equivalent to the one-codimensional…
We introduce a notion of subunit vector field for fully nonlinear degenerate elliptic equations. We prove that an interior maximum of a viscosity subsolution of such an equation propagates along the trajectories of subunit vector fields.…
Octupolar order is described in two space dimensions in terms of the maxima (and conjugated minima) of the probability density associated with a third-rank, fully symmetric and traceless tensor. Such a representation is shown to be…
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 derive a scale-free bound on the density of the maximum of a centered Gaussian vector. The basic bound is non-uniform, depends logarithmically on the dimension, and allows any covariance matrix. When the largest marginal variance is…
We study the fine-grained uniform convergence behavior of halfspaces beyond worst-case VC bounds. For inhomogeneous halfspaces in $\mathbb{R}^d$ with $d\ge 2$, we show that standard first-order VC bounds are essentially tight: even…
The Vapnik-Chervonenkis dimension of a set K in R^n is the maximal dimension of the coordinate cube of a given size, which can be found in coordinate projections of K. We show that the VC dimension of a convex body governs its entropy. This…
For a locally convex vector space (l.c.v.s.) $E$ and an absolutely convex neighborhood $V$ of zero, a bounded subset $A$ of $E$ is said to be $V$-dentable (respectively, $V$-f-dentable) if for any $\epsilon>0$ there exists an $x\in A$ so…
It is an attractive hypothesis that the spatial structure of visual cortical architecture can be explained by the coordinated optimization of multiple visual cortical maps representing orientation preference (OP), ocular dominance (OD),…
The excess volume associated with grain boundaries represents a key structural parameter for the characterization of grain boundaries. It plays a critical role in segregation of impurity and alloy elements to grain boundaries, and…
This paper addresses a large class of vector optimization problems in infinite-dimensional spaces with respect to two important binary relations derived from domination structures. Motivated by theoretical challenges as well as by…
In this paper, we propose criteria for unboundedness of the images of set-valued mappings having closed graphs in Euclidean spaces. We focus on mappings whose domains are non-closed or whose values are connected. These criteria allow us to…
The Vapnik-Chervonenkis dimension (in short, VC-dimension) of a graph is defined as the VC-dimension of the set system induced by the neighborhoods of its vertices. We show that every $n$-vertex graph with bounded VC-dimension contains a…
Over the past years a theory of conjugate duality for set-valued functions that map into the set of upper closed subsets of a preordered topological vector space was developed. For scalar duality theory, continuity of convex functions plays…
Optimal design of distributed decision policies can be a difficult task, illustrated by the famous Witsenhausen counterexample. In this paper we characterize the optimal control designs for the vector-valued setting assuming that it results…
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…