Related papers: Identifying lens spaces in polynomial time

Let $T^n$ be the real $n$-torus group. We give a new definition of lens spaces and study the diffeomorphic classification of lens spaces. We show that any $3$-dimensional lens space $L(p; q)$ is $T^2$-equivariantly cobordant to zero. We…

K-theoretic Donaldson-Thomas counts of curves in toric and many related threefolds can be computed in terms of a certain canonical 3-valent tensor, the K-theoretic equivariant vertex. In this paper we derive a formula for the vertex in the…

Assume we are given a set of parallel line segments in the plane, and we wish to place a point on each line segment such that the resulting point set maximizes or minimizes the area of the largest or smallest triangle in the set. We analyze…

Let $p$ be a polynomial in several non-commuting variables with coefficients in a field $K$ of arbitrary characteristic. It has been conjectured that for any $n$, for $p$ multilinear, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by…

We compute the Lusternik-Schnirelmann category and the topological complexity of no $k$-equal manifolds $M^{(k)}_d(n)$ for certain values of $d$, $k$ and $n$. This includes instances where $M^{(k)}_d(n)$ is known to be rationally…

Let p be a monic polynomial in one complex variable and K a measurable subset of the complex plane. In terms of the area of K, we give an upper bound on the area of the preimage of K under p and a lower bound on the area of the image of K…

We show that if one can solve 3SUM on a set of size n in time n^{1+\e} then one can list t triangles in a graph with m edges in time O(m^{1+\e}t^{1/3-\e/3}). This is a reversal of Patrascu's reduction from 3SUM to listing triangles (STOC…

We address the question of whether a Riemannian manifold-with-boundary (M,g) in dimension two is uniquely determined from knowledge of the distances between points on its boundary. An affirmative answer is called boundary rigidity for…

If $M$ is a finite volume complete hyperbolic 3-manifold with one cusp and no 2-torsion, the geometric component $X_M$ of its $\SL(2,\BC)$-character variety is an affine complex curve, which is smooth at the discrete faithful representation…

Diagrams and Reidemeister moves for links in a twisted S^1-bundle over an unorientable surface are introduced. Using these diagrams, we compute the Kauffman Bracket Skein Module (KBSM) of the connected sum of two projective spaces. In…

We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…

We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…

We give a deterministic, polynomial-time algorithm for approximately counting the number of {0,1}-solutions to any instance of the knapsack problem. On an instance of length n with total weight W and accuracy parameter eps, our algorithm…

Observational data hints at a finite universe, with spherical manifolds such as the Poincare dodecahedral space tentatively providing the best fit. Simulating the physics of a model universe requires knowing the eigenmodes of the Laplace…

Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…

A manifold is locally \emph{$k$-fold symmetric}, if for any point and any $k$-dimensional vector subspace tangent to this point there exists a local isometry such that this point is a fixed point and the differential of the isometry…

For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…

We study the problem of $k$-means clustering in the space of straight-line segments in $\mathbb{R}^{2}$ under the Hausdorff distance. For this problem, we give a $(1+\epsilon)$-approximation algorithm that, for an input of $n$ segments, for…

We reveal a complexity chasm, separating the trinomial and tetranomial cases, for solving univariate sparse polynomial equations over certain local fields. First, for any fixed field $K\in\{\mathbb{Q}_2,\mathbb{Q}_3,\mathbb{Q}_5,\ldots\}$,…

We will describe some results regarding the algorithmic nature of homeomorphism problems for manifolds; in particular, the following theorem. Theorem 1: Every PL or smooth simply connected manifold M^n of dimension n at least 5 can be…