Related papers: VC-Density in Pairs of Ordered Vector Space
We prove that the highest density of non-overlapping translates of a given centrally symmetric convex domain relative to its outer parallel domain of given outer radius is attained by a lattice packing in the Euclidean plane. This…
Let $S$ be a set of $n$ points in $\mathbb{R}^d$, where $d \geq 2$ is a constant, and let $H_1,H_2,\ldots,H_{m+1}$ be a sequence of vertical hyperplanes that are sorted by their first coordinates, such that exactly $n/m$ points of $S$ are…
The set of primes where a hypergeomeric series with rational parameters is $p$-adically bounded is known by [10] to have a Dirichlet density. We establish a formula for this Dirichlet density and conjecture that it is rare for the density…
A family S of convex sets in the plane defines a hypergraph H = (S, E) as follows. Every subfamily S' of S defines a hyperedge of H if and only if there exists a halfspace h that fully contains S' , and no other set of S is fully contained…
A theorem by Ding, Oporowski, Oxley, and Vertigan states that every sufficiently large bipartite graph without twins contains a matching, co-matching, or half-graph of any given size as an induced subgraph. We prove that this Ramsey…
We investigate the minimum distance of structured binary Low-Density Parity-Check (LDPC) codes whose parity-check matrices are of the form $[\mathbf{C} \vert \mathbf{M}]$ where $\mathbf{C}$ is circulant and of column weight $2$, and…
We prove vector-valued boundedness of (suitable) Calderon-Zygmund operators and of the (truncated) Hardy-Littlewood maximal function on a connected locally doubling metric measure space.
Low-density parity-check (LDPC) convolutional codes have been shown to exhibit excellent performance under low-complexity belief-propagation decoding [1], [2]. This phenomenon is now termed threshold saturation via spatial coupling. The…
The dimension of a linear space is the maximum positive integer $d$ such that any $d$ of its points generate a proper subspace. For a set $K$ of integers at least two, recall that a pairwise balanced design PBD$(v,K)$ is a linear space on…
The Vapnik-Chervonenkis (VC) dimension of a collection of subsets of a set is an important combinatorial concept in settings such as discrete geometry and machine learning. In this paper we prove that the VC dimension of the family of…
This paper provides two characterizations of regularity for near-vector spaces: first, by expressing them as a direct sum of vector spaces over division rings formed by distributive elements; second, by expressing their dimension in term of…
The VC dimension of the Ising perceptron with binary patterns is calculated by numerical enumerations for system sizes N <= 31. It is significantly larger than N/2. The data suggest that there is probably no well defined asymptotic…
We consider the problem of preprocessing an $n\times n$ matrix $\mathbf{M}$, and supporting queries that, for any vector $v$, returns the matrix-vector product $\mathbf{M} v$. This problem has been extensively studied in both theory and…
We establish a density variant of the Frankl-R\"{o}dl theorem on the sphere $\mathbb{S}^{n-1}$, which concerns avoiding pairs of vectors with a specific distance, or equivalently, a prescribed inner product. In particular, we establish…
In this work we study the quantitative relation between VC-dimension and two other basic parameters related to learning and teaching. Namely, the quality of sample compression schemes and of teaching sets for classes of low VC-dimension.…
We study the combination of orbital-optimized density cumulant theory and a new parameterization of the reduced density matrices in which the variables are the particle-hole cumulant elements. We call this combination O$\lambda$DCT. We find…
Given a bipartite quantum system represented by a tensor product of two Hilbert spaces, we give an elementary argument showing that if either component space is infinite-dimensional, then the set of nonseparable density operators is…
The widely applied density peak clustering (DPC) algorithm makes an intuitive cluster formation assumption that cluster centers are often surrounded by data points with lower local density and far away from other data points with higher…
The paper introduces new bounds on the asymptotic density of parity-check matrices and the achievable rates under ML decoding of binary linear block codes transmitted over memoryless binary-input output-symmetric channels. The lower bounds…
We study the sets of planes in an even dimensional real vector space $V$ which are simultaneously stabilised by a pair of complex structures on $V$. We completely describe these sets of planes for pairs of orthogonal complex structures.…