Related papers: Identifying lens spaces in polynomial time
We find a local $(d+1) \times (d+1)$ Riemann-Hilbert problem characterizing the skew-orthogonal polynomials associated to the partition function of the Gaussian Orthogonal Ensemble of random matrices with a potential function of degree $d$.…
We give a dimensionality reduction procedure to approximate the sum of distances of a given set of $n$ points in $R^d$ to any "shape" that lies in a $k$-dimensional subspace. Here, by "shape" we mean any set of points in $R^d$. Our…
We study the method of cyclic projections when applied to closed and linear subspaces $M_i$, $i=1,\ldots,m$, of a real Hilbert space $\mathcal H$. We show that the average distance to individual sets enjoys a polynomial behaviour…
Given a simple polygon P in the plane, we present new algorithms and data structures for computing the weak visibility polygon from any query line segment in P. We build a data structure in O(n) time and O(n) space that can compute the…
In this paper, we give a polynomial-time algorithm for deciding whether an input bipartite graph admits a 2-layer fan-planar drawing, resolving an open problem posed in several papers since 2015.
A 3-dimensional Riemannian manifold equipped with a tensor structure of type $(1,1)$, whose third power is the identity, is considered. This structure and the metric have circulant matrices with respect to some basis, i.e., these structures…
Recent years have demonstrated that using random feature maps can significantly decrease the training and testing times of kernel-based algorithms without significantly lowering their accuracy. Regrettably, because random features are…
Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…
This paper reports the design of a high-accuracy spatial location estimation method using ultrasound waves by exploiting the fixed geometry of the transmitters. Assuming an isosceles triangle antenna configuration, where three antennas are…
This paper deals with two aspects of relativistic cosmologies with closed (compact and boundless) spatial sections. These spacetimes are based on the theory of General Relativity, and admit a foliation into space sections S(t), which are…
We describe a new algorithm to compute the geometric intersection number between two curves, given as edge vectors on an ideal triangulation. Most importantly, this algorithm runs in polynomial time in the bit-size of the two edge vectors.…
We reduced Rudyak's conjecture that a degree one map between closed manifolds cannot raise the Lusternik-Schnirelmann category to the computation of the category of the product of two lens spaces $L^n_p\times L_q^n$ with relatively prime…
We present an efficient algorithm for learning mixed membership models when the number of variables $p$ is much larger than the number of hidden components $k$. This algorithm reduces the computational complexity of state-of-the-art tensor…
We give efficient algorithms for finding power-sum decomposition of an input polynomial $P(x)= \sum_{i\leq m} p_i(x)^d$ with component $p_i$s. The case of linear $p_i$s is equivalent to the well-studied tensor decomposition problem while…
Consider the geometric inverse problem: There is a set of delta-sources in spacetime that emit waves travelling at unit speed. If we know all the arrival times at the boundary cylinder of the spacetime, can we reconstruct the space, a…
We continue work initiated in a 1990 preprint of Mess giving a geometric parameterization of the moduli space of classical solutions to Einstein's equations in 2+1 dimensions with cosmological constant 0 or -1 (the case +1 has been worked…
We answer the question of how large the dimension of a quantum lens space must be, compared to the primary parameter $r$, for the isomorphism class to depend on the secondary parameters. Since classification results in C*-algebra theory…
The Euclidean algorithm in algebra is applied to a class of gravitational lenses for which the lens equation consists of any set of coupled polynomial equations in the image position. In general, this algorithm allows us to reduce an…
In this paper, we study the following problem of reconstructing a simple polygon: Given a cyclically ordered vertex sequence of an unknown simple polygon P of n vertices and, for each vertex v of P, the sequence of angles defined by all the…
Orthogonal polynomials of several variables have a vector-valued three-term recurrence relation, much like the corresponding one-dimensional relation. This relation requires only knowledge of certain recurrence matrices, and allows simple…