相关论文: VC dimension of ellipsoids

This paper gives a detailed derivation of the surface of a tri-axial ellipsoid. The general result is in terms of the elliptic integrals of the first and second kind. It is in checked for all special cases included and the corresponding…

We derive explicit formulae for the expected volume and the expected number of facets of the convex hull of several multidimensional Gaussian random walks in terms of the Gaussian persistence probabilities. Special cases include the already…

We provide a representation of the (signed) BMV-measure by stochastic means and prove positivity of the respective measures in dimension $d=3$ in several non-trivial cases by combinatorial methods.

We present constructions and bounds for additive codes over a finite field in terms of their geometric counterpart, i.e., projective systems. It is known that the maximum number of $(h-1)$-spaces in PG$(2,q)$, such that no hyperplane…

We investigate the problem of packing identical hard objects on regular lattices in d dimensions. Restricting configuration space to parallel alignment of the objects, we study the densest packing at a given aspect ratio X. For rectangles…

We study the global distribution and morphology of dark matter voids in a LCDM universe using density fields generated by N-body simulations. Voids are defined as isolated regions of the low-density excursion set specified via density…

We write down estimates for the surface area, and more generally, integral mean curvatures of an ellipsoid E in n-dimensional Euclidean space in terms of the lengths of the major semi-axes. We give applications to estimating the area of…

A sequence $D = \{d_1,...d_n\}$ is a feasible degree sequence if there is a graph on $\{1,...,n\}$ such that $i$ has degree $d_i$. For such a sequence, $G(D)$ is a graph chosen uniformly at random from those with the given degree sequence.…

In a graph G, the cardinality of the smallest ordered set of vertices that distinguishes every element of V(G)U E(G) is called the mixed metric dimension of G, and it is denoted by mdim(G). In [12] it was conjectured that for a graph G with…

By studying commensurators of virtually cyclic groups, we prove that every elementary amenable group of finite Hirsch length h and cardinality aleph-n admits a finite dimensional classifying space with virtually cyclic stabilizers of…

We geometrically prove that in a d-dimensional cube with edges of length n, the number of particular d-dimensional tetrahedrons are given by Eulerian numbers. These tetrahedrons tassellate the cube, In this way the sum of the cubes are the…

We show that the largest possible diameter $\delta(d,k)$ of a $d$-dimensional polytope whose vertices have integer coordinates ranging between $0$ and $k$ is at most $kd-\lceil2d/3\rceil$ when $k\geq3$. In addition, we show that…

In this paper, we study the problem of computing the diameter of a set of $n$ points in $d$-dimensional Euclidean space for a fixed dimension $d$, and propose a new $(1+\varepsilon)$-approximation algorithm with $O(n+ 1/\varepsilon^{d-1})$…

We derive that dpR(n) \leq dens(n) \leq dpR(n)+1, where dens(n) is the supremum of the VC density of all formulas in n parameters, and dpR(n) is the maximum depth of an ICT pattern in n variables. Consequently, strong dependence is…

We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension $d$: i) Given $n$ points in $\Rd$, compute their minimum enclosing cylinder. ii) Given two $n$-point sets in $\Rd$, decide…

The purpose of this paper is to relate the variety parameterizing completely decomposable homogeneous polynomials of degree $d$ in $n+1$ variables on an algebraically closed field, called $\Split_{d}(\PP n)$, with the Grassmannian of $n-1$…

Many high-dimensional uncertainty quantification problems are solved by polynomial dimensional decomposition (PDD), which represents Fourier-like series expansion in terms of random orthonormal polynomials with increasing dimensions. This…

Closed form expressions are given for computing the parameters and vectors that identify and define the $n-1$ dimensional conic section that results from the intersection of a hyperplane with an $n$-dimensional conic section: cone,…

Confidence ellipsoids for linear regression coefficients are constructed by observations from a mixture with varying concentrations. Two approaches are discussed. The first one is the nonparametric approach based on the weighted least…

Suppose that $C$ is a centrally symmetric $d$-dimensional convex polytope; in 1989 Kalai conjectured that $C$ has at least $3^d$ facets. We prove this result if there are $d$ hyperplanes with orthogonal normal vectors so that $C$ is…