We show that the problem of showing that a cusped 3-manifold M is not hyperbolic is in NP, assuming -RECOGNITION is in coNP. To this end, we show that IRREDUCIBLE TOROIDAL RECOGNITION lies in NP. Along the way we unconditionally recover SATELLITE KNOT RECOGNITION lying in NP. This was previously known only assumin…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
7 results for “coNP”
The study shows a way to represent Seifert fiber space groups with a limited field size.
problem Representing Seifert fiber space groups with non-abelian .
method Using a triangulation of Seifert fiber spaces and a quotient to limit the field size.
result The lens space recognition problem is shown to be in coNP for Seifert fiber space input.
We developed an efficient algorithm to factorize knots.
problem Computing the prime factorization of knots efficiently.
method Introduced an edge-ideal triangulation to represent knots and developed an algorithm using Regina.
result Our algorithm works well for knots up to 19 crossings and provides new complexity results.
Can deep neural networks learn to solve any task, and in particular problems of high complexity? This question attracts a lot of interest, with recent works tackling computationally hard tasks such as the traveling salesman problem and satisfiability. In this work we offer a different perspective on this question. Give…
The paper improves regret lower bounds for communicating MDPs.
problem Regret lower bounds for communicating MDPs.
method Lower bound proof and optimization problem formulation.
result Regret lower bound becomes significantly more complex in communicating MDPs.
We prove that the fundamental group of any integer homology 3-sphere different from the 3-sphere admits irreducible representations of its fundamental group in SL(2,C). For hyperbolic integer homology spheres this comes with the definition, and for Seifert fibered integer homology spheres this is well known. We prove t…
Paper proves neural networks can be approximated using interval bounds.
problem Verifying safety and robustness of neural networks.
method Introduces interval universal approximation (IUA) theorem for neural networks.
result Neural networks can be approximated using interval bounds for any continuous function and squashable activation functions.