English
Related papers

Related papers: VC-Density in Pairs of Ordered Vector Space

200 papers

Let $D$ and $E$ be subspaces of the tensor product of the finite-dimensional Hilbert spaces $\mathbb{C}^m \otimes \mathbb{C}^n$. We show that the number of product vectors in $D$ with their partial conjugates in $E$ is uniformly bounded…

Quantum Physics · Physics 2013-09-25 Joohan Na

A vector space partition of $\mathbb{F}_q^v$ is a collection of subspaces such that every non-zero vector is contained in a unique element. We improve a lower bound of Heden, in a subcase, on the number of elements of the smallest occurring…

Combinatorics · Mathematics 2018-09-27 Sascha Kurz

Previous work of the second author and Wolf showed that given a set $A\subseteq \mathbb{F}_p^n$ of bounded $\textrm{VC}_2$-dimension, there is a high rank quadratic factor $\mathcal{B}$ of bounded complexity such that $A$ is approximately…

Combinatorics · Mathematics 2025-12-02 Hannah Sheats , Caroline Terry

The recent work of \cite{CRT,DonohoPol} rigorously proved (in a large dimensional and statistical context) that if the number of equations (measurements in the compressed sensing terminology) in the system is proportional to the length of…

Information Theory · Computer Science 2013-04-02 Mihailo Stojnic

The VC-dimension of a family of sets is a measure of its combinatorial complexity used in machine learning theory, computational geometry, and even model theory. Computing the VC-dimension of the $k$-fold union of geometric set systems has…

Combinatorics · Mathematics 2025-01-20 Pantelis E. Eleftheriou , Aris Papadopoulos , Francis Westhead

We prove that in a semi-bounded o-minimal expansion of an ordered group every non-empty open definable set is a finite union of open cells.

Logic · Mathematics 2015-07-17 Mário J. Edmundo , Pantelis Eleftheriou , Luca Prelli

We investigate the packing and covering densities of linear and nonlinear binary codes, and establish a number of duality relationships between the packing and covering problems. Specifically, we prove that if almost all codes (in the class…

Information Theory · Computer Science 2009-09-29 Gérard Cohen , Alexander Vardy

In this paper, we present some second-order sufficient conditions in terms of the Demyanov-Pevnyi's second-order directional derivatives for efficiency of $C^1$ vector optimization problems with constraints. Our results improve and…

Optimization and Control · Mathematics 2018-08-08 Nguyen Van Tuyen , Jen-Chih Yao , Ching-Feng Wen , Yi-Bin Xiao

One of the most important optimality conditions to aid to solve a vector optimization problem is the first-order necessary optimality condition that generalizes the Karush-Kuhn-Tucker condition. However, to obtain the sufficient optimality…

We define a capacity C on abstract Wiener spaces and prove that, for any u with bounded variation, the total variation measure |Du| is absolutely continuous with respect to C: this enables us to extend the usual rules of calculus in many…

Probability · Mathematics 2013-01-08 Dario Trevisan

A valued constraint satisfaction problem (VCSP) instance $(V,\Pi,w)$ is a set of variables $V$ with a set of constraints $\Pi$ weighted by $w$. Given a VCSP instance, we are interested in a re-weighted sub-instance $(V,\Pi'\subset \Pi,w')$…

Data Structures and Algorithms · Computer Science 2015-09-08 Arnold Filtser , Robert Krauthgamer

A $(v,k,t)$ packing of size $b$ is a system of $b$ subsets (blocks) of a $v$-element underlying set such that each block has $k$ elements and every $t$-set is contained in at most one block. $P(v,k,t)$ stands for the maximum possible $b$. A…

Combinatorics · Mathematics 2024-01-11 Zoltan Furedi , Alexandr Kostochka , Mohit Kumbhat

A class of doubly-generalized low-density parity-check (D-GLDPC) codes, where single parity-check (SPC) codes are used as variable nodes (VNs), is investigated. An expression for the growth rate of the weight distribution of any D-GLDPC…

Information Theory · Computer Science 2016-11-17 E. Paolini , M. F. Flanagan , M. Chiani , M. P. C. Fossorier

We study the sphere packing problem in Euclidean space where we impose additional constraints on the separations of the center points. We prove that any sphere packing in dimension $48$, with spheres of radii $r$, such that no two centers…

Number Theory · Mathematics 2025-03-05 Felipe Gonçalves , Guilherme Vedana

The evolution of occupied volume under progressive fragmentation of granular matter is studied using a purely geometric model. Rather than modelling disorder directly, properties are investigated by analysing highly ordered reference…

Soft Condensed Matter · Physics 2026-03-25 Malkhazi A. Meladze

In this article, we show the existence of large sets $\operatorname{LS}_2[3](2,k,v)$ for infinitely many values of $k$ and $v$. The exact condition is $v \geq 8$ and $0 \leq k \leq v$ such that for the remainders $\bar{v}$ and $\bar{k}$ of…

Combinatorics · Mathematics 2025-10-02 Michael Kiermaier , Reinhard Laue , Alfred Wassermann

We consider the behavior of the OPE density $c(\Delta,\ell)$ for conformal four-point functions in the flat-space limit where all scaling dimensions become large. We find evidence that the density reduces to the partial waves $f_\ell(s)$ of…

High Energy Physics - Theory · Physics 2024-03-08 Balt C. van Rees , Xiang Zhao

We introduce a vector-valued version of a uniform algebra, called the vector-valued function space over a uniform algebra. The diameter two properties of the vector-valued function space over a uniform algebra on an infinite compact…

Functional Analysis · Mathematics 2021-03-17 Han Ju Lee , Hyung-Joon Tag

Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications. They also find application in various data storage systems because of their…

Information Theory · Computer Science 2021-01-26 Siyi Yang , Ahmed Hareedy , Shyam Venkatasubramanian , Robert Calderbank , Lara Dolecek

We use Razborov's flag algebra method to show an asymptotic upper bound for the maximal induced density $i(\vec P_3)$ of the orgraph $\vec P_3$ in an arbitrary orgraph. A conjecture of Thomass\'e states that $i(\vec P_3)=2/5$. The hitherto…

Combinatorics · Mathematics 2011-11-24 Konrad Sperfeld
‹ Prev 1 8 9 10 Next ›