Related papers: Counting the Faces of Randomly-Projected Hypercube…

This paper explores a comparative study of both the linear and kernel implementations of three of the most popular Appearance-based Face Recognition projection classes, these being the methodologies of Principal Component Analysis, Linear…

Most of the current techniques for face recognition require the presence of a full face of the person to be recognized, and this situation is difficult to achieve in practice, the required person may appear with a part of his face, which…

We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

Recent advances suggest that encoding images through Symmetric Positive Definite (SPD) matrices and then interpreting such matrices as points on Riemannian manifolds can lead to increased classification performance. Taking into account…

The face-on projected density profile of the Miyamoto & Nagai disks of arbitrary flattening is obtained analytically in terms of incomplete elliptic integrals of first and second type, by using two complementary approaches, and then checked…

Problems on repeated geometric patterns in finite point sets in Euclidean space are extensively studied in the literature of combinatorial and computational geometry. Such problems trace their inspiration to Erd\H{o}s' original work on that…

Ample evidence suggests that face processing in human and non-human primates is performed differently compared with other objects. Converging reports, both physiologically and psychophysically, indicate that faces are processed in…

We report here a computation giving the complete list of facets for the cut polytopes over several very symmetric graphs with $15-30$ edges, including $K_8$, $K_{3,3,3}$, $K_{1,4,4}$, $K_{5,5}$, some other $K_{l,m}$, $K_{1,l,m}$, $Prism_7,…

Let $f: N^n\to \mathbb{R}^{n+1}$ be a frontal with its Gauss mapping $\nu: N\to S^n$ and let $P\in \mathbb{R}^{n+1}$ be a point such that $(f(x)-P)\cdot \nu(x) \ne 0$ for any $x\in N$. In this paper, for the mapping $\widetilde{f}: N\to…

We develop the relationship between quaternionic hyperbolic geometry and arithmetic counting or equidistribution applications, that arises from the action of arithmetic groups on quaternionic hyperbolic spaces, especially in dimension $2$.…

We build a new probability measure on closed space and plane polygons. The key construction is a map, given by Knutson and Hausmann using the Hopf map on quaternions, from the complex Stiefel manifold of 2-frames in n-space to the space of…

This paper contains a survey of results obtained by the authors mostly during the past few years and published by 2021. In particular, we present the best of known estimates of numerical characteristics related to the research theme.…

In a random unitary matrix model at large N, we study the properties of the expectation value of the character of the unitary matrix in the rank k symmetric tensor representation. We address the problem of whether the standard semiclassical…

We consider tessellations of the Euclidean $(d-1)$-sphere by $(d-2)$-dimensional great subspheres or, equivalently, tessellations of Euclidean $d$-space by hyperplanes through the origin; these we call conical tessellations. For random…

Eberhard proved that for every sequence $(p_k), 3\le k\le r, k\ne 5,7$ of non-negative integers satisfying Euler's formula $\sum_{k\ge3} (6-k) p_k = 12$, there are infinitely many values $p_6$ such that there exists a simple convex…

We prove that for any finite real hyperplane arrangement the average projection volumes of the maximal cones is given by the coefficients of the characteristic polynomial of the arrangement. This settles the conjecture of Drton and Klivans…

An $n\times n$ symmetric matrix $A$ is copositive if the quadratic form $x^TAx$ is nonnegative on the nonnegative orthant $\mathbb{R}^{n}_{\geq 0}$. The cone of copositive matrices contains the cone of matrices which are the sum of a…

The orthogonal projection of a 4-cube onto a uniform random 3-subspace in R^4 is a convex 3-polyhedron P with 14 vertices almost surely. Three numerical characteristics of P -- volume, surface area and mean width -- are studied. These…

Clustering is a fundamental problem in unsupervised machine learning with many applications in data analysis. Popular clustering algorithms such as Lloyd's algorithm and $k$-means++ can take $\Omega(ndk)$ time when clustering $n$ points in…

We give an explicit formula for the expectation of the number of real lines on a random invariant cubic surface, i.e. a surface $Z\subset \mathbb{R}P^3$ defined by a random gaussian polynomial whose probability distribution is invariant…