Related papers: A Variant of the VC-dimension with Applications to…

We examine anomalous dimensions of higher spin currents in the critical O(N) scalar model and the Gross-Neveu model in arbitrary d dimensions. These two models are proposed to be dual to the type A and type B Vasiliev theories,…

A $d$-dimensional hypercube drawing of a graph represents the vertices by distinct points in $\{0,1\}^d$, such that the line-segments representing the edges do not cross. We study lower and upper bounds on the minimum number of dimensions…

We investigate computational problems involving large weights through the lens of kernelization, which is a framework of polynomial-time preprocessing aimed at compressing the instance size. Our main focus is the weighted Clique problem,…

Given a sequence \( S = (s_1, s_2, \ldots, s_k) \) of positive integers satisfying \( s_1 \leq s_2 \leq \dots \leq s_k \), an \( S \)-packing coloring of a graph \( G \) is a partition of \( V(G) \) into \( k \) subsets \( V_1, V_2, \dots,…

Let D be a division algebra with center F. A maximal subfield of D is defined to be a field K such that CD(K) = K; that is, K is its own centralizer in D. A maximal subfield K is said to be self-invariant if it normalises by itself, i.e.…

We show that there exists an absolute constant $C>0$ such that any family $\mathcal{F}\subset \{0,1\}^n$ of size at least $Cn^3$ has dual VC-dimension at least 3. Equivalently, every family of size at least $Cn^3$ contains three sets such…

We determine the largest size of $3$-uniform set systems on $[n]$ with VC-dimension $2$ for all $n$.

What is the dimension of spacetime? We address this question in the context of the AdS/CFT Correspondence. We give a prescription for computing the number of large bulk dimensions, $D$, from strongly-coupled CFT$_d$ data, where "large"…

We propose methods towards a systematic determination of d dimensional curved spaces where Euclidean field theories with rigid supersymmetry can be defined. The analysis is carried out from a group theory as well as from a supergravity…

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

The VC-dimension of a set system is a way to capture its complexity and has been a key parameter studied extensively in machine learning and geometry communities. In this paper, we resolve two longstanding open problems on bounding the…

Given an undirected graph $G$, the Densest $k$-subgraph problem (DkS) asks to compute a set $S \subset V$ of cardinality $\left\lvert S\right\rvert \leq k$ such that the weight of edges inside $S$ is maximized. This is a fundamental NP-hard…

The orthogonality dimension of a graph over $\mathbb{R}$ is the smallest integer $d$ for which one can assign to every vertex a nonzero vector in $\mathbb{R}^d$ such that every two adjacent vertices receive orthogonal vectors. For an…

This two-part comprehensive survey is devoted to a computing framework most commonly known under the names Hyperdimensional Computing and Vector Symbolic Architectures (HDC/VSA). Both names refer to a family of computational models that use…

Constant-dimension subspace codes (CDCs), a special class of subspace codes, have attracted significant attention due to their applications in network coding. A fundamental research problem of CDCs is to determine the maximum number of…

The outer multiset dimension ${\rm dim}_{\rm ms}(G)$ of a graph $G$ is the cardinality of a smallest set of vertices that uniquely recognize all the vertices outside this set by using multisets of distances to the set. It is proved that…

In this paper, we extend two classical results about the density of subgraphs of hypercubes to subgraphs $G$ of Cartesian products $G_1\times\cdots\times G_m$ of arbitrary connected graphs. Namely, we show that $\frac{|E(G)|}{|V(G)|}\le…

We investigate the VC-dimension of the perceptron and simple two-layer networks like the committee- and the parity-machine with weights restricted to values $\pm1$. For binary inputs, the VC-dimension is determined by atypical pattern sets,…

We say that a family ${x_i|i\in[m]}$ of vectors in a Banach space $X$ satisfies the $k$-collapsing condition if $|\sum_{i\in I}x_i|\leq 1$ for all $k$-element subsets $I\subseteq{1,2,...,m}$. Let $C(k,d)$ denote the maximum cardinality of a…

A spherical three-distance set is a finite collection $X$ of unit vectors in $\mathbb{R}^{n}$ such that for each pair of distinct vectors has three inner product values. We use the semidefinite programming method to improve the upper bounds…