Related papers: Classification of the relative positions between a…
Several systems involve spatial arrangements of elements such as molecules or cells, the characterization of which bears important implications to biological and physical investigations. Traditional approaches to quantify spatial order and…
In this article, we prove a theorem comparing the dihedral angles of simplices in the hyperbolic, spherical and Euclidean geometries.
The problem of determining whether a given quantum state is separable is known to be computationally difficult. We develop an approach to this problem based on approximations of convex polytopes in high dimensions. By showing that a convex…
The article presents simple analysis of cones which are used to generate a given conic curve by section by a plane. It was found that if the given curve is an ellipse, then the locus of vertexes of the cones is a hyperbola. The hyperbola…
We give an explicit construction of the Brownian sphere biased by the distance between two distinguished points, which is based on the Miermont bijection for quadrangulations. We then describe various conditionings of this object, which are…
We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.
We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…
We introduce the concept of entanglement width as measure of the spatial distribution of entanglement in multiparticle systems. We develop criteria to detect the width of entanglement using global observables such as energy and magnetic…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
This paper is a survey of recent advances as well as open problems in the study of face numbers of centrally symmetric simplicial polytopes and spheres. The topics discussed range from neighborliness of centrally symmetric polytopes and the…
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
We develop new elements of harmonic analysis on the complex sphere on the basis of which Bernstein's, Jackson's and Kolmogorov's inequalities are established. We apply these results to get order sharp estimates of $m$-term approximations.…
Correlation matrices are the sub-class of positive definite real matrices with all entries on the diagonal equal to unity. Earlier work has exhibited a parametrisation of the corresponding Cholesky factorisation in terms of partial…
In this note we characterize isoperimetric regions inside almost-convex cones. More precisely, as in the case of convex cones, we show that isoperimetric sets are given by intersecting the cone with a ball centered at the origin.
We provide the full classification of equidistant decomposition of a two-dimensional Euclidean plane and a two-dimensional sphere.
Imagine two high-dimensional clusters and a hyperplane separating them. Consider in particular the angle between: the direction joining the two clusters' centroids and the normal to the hyperplane. In linear classification, this angle…
The problem of interpolation at $(n+1)^2$ points on the unit sphere $\mathbb{S}^2$ by spherical polynomials of degree at most $n$ is proved to have a unique solution for several sets of points. The points are located on a number of circles…
We introduce a graph structure on Euclidean polytopes. The vertices of this graph are the $d$-dimensional polytopes contained in $\mathbb{R}^d$ and its edges connect any two polytopes that can be obtained from one another by either…
In this paper we generalise a celebrated result of Milnor that characterises whether a rotationally symmetric surface is parabolic or hyperbolic to the case of biharmonic functions.
The usual quantizer based on an n-dimensional lattice L maps a point x in R^n to a closest lattice point. Suppose L is the intersection of lattices L_1, ..., L_r. Then one may instead combine the information obtained by simultaneously…