相关论文: VC dimension of ellipsoids
We invent the notion of a {\it dimension of a variety} $V$ as the cardinality of all its proper {\it derived} subvarieties (of the same type). The dimensions of varieties of lattices, varieties of regular bands and other general algebraic…
We consider a model Poisson problem in $\R^d$ ($d=2,3$) and establish error estimates for virtual element methods on polygonal or polyhedral meshes that can contain small edges ($d=2$) or small faces ($d=3$).
Moderately large numbers of transitive elliptic spreads are constructed in characteristic $2$ and dimension $\equiv $ 2 (mod 4).
We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its $k$-connected subgraphs. In particular, we give tight upper and lower bounds for the VC-dimension. Moreover, we show that…
We show that Euclidean geometry in suitably high dimension can be expressed as a theory of orthogonality of subspaces with fixed dimensions and fixed dimension of their meet.
We extend classical estimates for the vector balancing constant of $\mathbb{R}^d$ equipped with the Euclidean and the maximum norms proved in the 1980's by showing that for $p =2$ and $p=\infty$, given vector families $V_1, \ldots, V_n…
We study the problem of maximum likelihood (ML) estimation for statistical models defined by reflexive polytopes. Our focus is on the maximum likelihood degree of these models as an algebraic measure of complexity of the corresponding…
We bound the number of nearly orthogonal vectors with fixed VC-dimension over $\setpm^n$. Our bounds are of interest in machine learning and empirical process theory and improve previous bounds by Haussler. The bounds are based on a simple…
Various different random graph models have been proposed in which the vertices of the graph are seen as members of a metric space, and edges between vertices are determined as a function of the distance between the corresponding metric…
We study the ellipticity probability distribution function (PDF) of voids in redshift space with galaxies as tracers of the shapes of voids. We find that the redshift space distortion on the shape of voids statistically increases the…
We classify all the possible $delta$-vectors of d-dimensional integral convex polytopes whose volumes are less than or equal to 3/(d!).
We are interested in the relationship between the virtual cohomological dimension (or vcd) of a discrete group Gamma and the smallest possible dimension of a model for the classifying space of Gamma relative to its family of virtually…
We systematically compile an exhaustive catalogue of multiview varieties and anchored multiview varieties arising from projections of points and lines in 1, 2, and 3-dimensional projective space. We say that two such varieties are…
Metric dimension is an essential parameter in graph theory that aids in addressing issues pertaining to information retrieval, localization, network design, and chemistry through the identification of the least possible number of elements…
Two well studied invariants of a complex projective variety are the unit Euclidean distance degree and the generic Euclidean distance degree. These numbers give a measure of the algebraic complexity for "nearest" point problems of the…
A dissection of a convex d-polytope is a partition of the polytope into d-simplices whose vertices are among the vertices of the polytope. Triangulations are dissections that have the additional property that the set of all its simplices…
Twinned chain polytopes form a broad class of non-centrally symmetric reflexive polytopes and exhibit intriguing structures. In the present paper, we show that the number of facets of $d$-dimensional twinned chain polytopes is at most…
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…
Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…
Vertical decomposition is a widely used general technique for decomposing the cells of arrangements of semi-algebraic sets in ${{\mathbb R}}^d$ into constant-complexity subcells. In this paper, we settle in the affirmative a few…