English
Related papers

Related papers: The VC-dimension and point configurations in ${\Bb…

200 papers

The {\em overlap number} of a finite $(d+1)$-uniform hypergraph $H$ is defined as the largest constant $c(H)\in (0,1]$ such that no matter how we map the vertices of $H$ into $\R^d$, there is a point covered by at least a $c(H)$-fraction of…

Combinatorics · Mathematics 2010-05-11 Jacob Fox , Mikhail Gromov , Vincent Lafforgue , Assaf Naor , Janos Pach

Let $\mathcal{H}_i$ be a finite dimensional complex Hilbert space of dimension $d_i$ associated with a finite level quantum system $A_i$ for $i = i, 1,2, ..., k$. A subspace $S \subset \mathcal{H} = \mathcal{H}_{A_{1} A_{2}... A_{k}} =…

Quantum Physics · Physics 2007-05-23 K. R. Parthasarathy

We investigate dimension-theoretic properties of concentric topological spheres, which are fractal sets emerging both in pure and applied mathematics. We calculate the box dimension and Assouad spectrum of such collections, and use them to…

Dynamical Systems · Mathematics 2025-04-15 Efstathios Konstantinos Chrontsios Garitsis

The notions of Hausdorff and Fourier dimensions are ubiquitous in harmonic analysis and geometric measure theory. It is known that any hypersurface in $\mathbb{R}^{d+1}$ has Hausdorff dimension $d$. However, the Fourier dimension depends on…

Classical Analysis and ODEs · Mathematics 2024-01-04 Junjie Zhu

This paper constructs a class of non-integer dimensional continuous functions with one unbounded variation point, discusses their H\"older condition and variation on their domains. Specifically, the fractal dimension of a continuous…

Classical Analysis and ODEs · Mathematics 2024-11-08 Pei-Zhi Liu , Yong-Shun Liang , Jun-Ru Wu

Fractal nests are sets defined as unions of unit $n$-spheres scaled by a sequence of $k^{-\alpha}$ for some $\alpha>0$. In this article we generalise the concept to subsets of such spheres and find the formulas for their box counting…

Metric Geometry · Mathematics 2018-08-01 Siniša Miličić

A finite hypergraph $H$ consists of a finite set of vertices $V(H)$ and a collection of subsets $E(H) \subseteq 2^{V(H)}$ which we consider as partition of unity relations between projection operators. These partition of unity relations…

Operator Algebras · Mathematics 2020-04-06 Tobias Fritz

Degrading performance of indexing schemes for exact similarity search in high dimensions has long since been linked to histograms of distributions of distances and other 1-Lipschitz functions getting concentrated. We discuss this…

Data Structures and Algorithms · Computer Science 2012-04-13 Vladimir Pestov

Consider all the level sets of a real function. We can group these level sets according to their Hausdorff dimensions. We show that the Hausdorff dimension of the collection of all level sets of a given Hausdorff dimension can be…

Classical Analysis and ODEs · Mathematics 2016-08-29 Gavin Armstrong

In this paper we construct a model for the classifying space, BVCG, of a crystallographic group G of rank n relative to the family VC of virtually-cyclic subgroups of G. The model is used to show that there exists no other model for the…

Algebraic Topology · Mathematics 2007-05-23 Frank Connolly , Benjamin Fehrman , Michael Hartglass

The metric dimension, $\dim(G)$, and the fractional metric dimension, $\dim_f(G)$, of a graph $G$ have been studied extensively. Let $G$ be a graph with vertex set $V(G)$, and let $d(x,y)$ denote the length of a shortest $x-y$ path in $G$.…

Combinatorics · Mathematics 2021-08-06 Eunjeong Yi

In this paper, we provide a formula for the vector space dimension of the ring $\mathbb{F}_2[x,y,z]/(x^{d_1}, y^{d_2},z^{d_3}, x+y+z)$ over $\mathbb{F}_2$ when $d_1,d_2,d_3$ all lie between successive powers of $2$. For general…

Commutative Algebra · Mathematics 2024-08-21 Fiona Han , Jennifer Kenkel , Daniel Li , Sridhar Venkatesh , Ashley Wiles

We say that a set system $\mathcal{F}\subseteq 2^{[n]}$ shatters a given set $S\subseteq [n]$ if $2^S=\{F \cap S : F \in \mathcal{F}\}$. The Sauer inequality states that in general, a set system $\mathcal{F}$ shatters at least…

Combinatorics · Mathematics 2014-07-22 Tamás Mészáros , Lajos Rónyai

In this paper we study how zeros of the Fourier transform of a function $f: \mathbb{Z}_p^d \to \mathbb{C}$ are related to the structure of the function itself. In particular, we introduce a notion of bandwidth of such functions and discuss…

Classical Analysis and ODEs · Mathematics 2016-01-15 A. Iosevich , A. Liu , A. Mayeli , J. Pakianathan

Let U be a monster model and let D be a subset of U. Let (U,D) denote theexpansion of U with a new predicate for D. Write e(D) for the collection of all subsets C of U such that (U,C) is elementary equivalent to (U,D). We prove that if e(D)…

Logic · Mathematics 2015-08-21 Domenico Zambella

Let $A$ be a set and $V$ a real Hilbert space. Let $H$ be a real Hilbert space of functions $f:A\to V$ and assume $H$ is continuously embedded in the Banach space of bounded functions. For $i=1,\cdots,n$, let $(x_i,y_i)\in A\times V$…

Functional Analysis · Mathematics 2022-02-23 Karen Yeressian

Let $k$ be a number field and $V(k)$ an $n$-dimensional projective variety over $k$. We use the $K$-theory of a $C^*$-algebra $A_V$ associated to $V(k)$ to define a height of points of $V(k)$. The corresponding counting function is…

Number Theory · Mathematics 2024-08-23 Igor V. Nikolaev

In this paper we investigate a connection between the growth rates of certain classes of finite structures and a generalization of $\text{VC}$-dimension called $\text{VC}_{\ell}$-dimension. Let $\mathcal{L}$ be a finite relational language…

Logic · Mathematics 2017-01-03 C. Terry

We study the Convex Set Disjointness (CSD) problem, where two players have input sets taken from an arbitrary fixed domain~$U\subseteq \mathbb{R}^d$ of size $\lvert U\rvert = n$. Their mutual goal is to decide using minimum communication…

Data Structures and Algorithms · Computer Science 2019-09-10 Mark Braverman , Gillat Kol , Shay Moran , Raghuvansh R. Saxena

Given a graph $G$ and a parameter $k$, the Chordal Vertex Deletion (CVD) problem asks whether there exists a subset $U\subseteq V(G)$ of size at most $k$ that hits all induced cycles of size at least 4. The existence of a polynomial kernel…

Data Structures and Algorithms · Computer Science 2017-07-18 Akanksha Agrawal , Daniel Lokshtanov , Pranabendu Misra , Saket Saurabh , Meirav Zehavi