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,786 papers · 148 categories

Trend · papers per month

count % of corpus

7 results for “non-paneled knotless”

Stick number of non-paneled knotless spatial graphsmath.GT

Study shows stick numbers for specific graphs and explains a protein structure.

problem Determining the minimum number of sticks for knotless embeddings of graphs.

method Analyzing specific graphs like K4 and K5, and using probability theory for K3,3.

result Minimum stick numbers for K4 and K5, and probability of a specific protein structure.

stick number non-paneled knotless K4 K5 K3

2019-09-03abs ↗pdf ↗

Maximal knotless graphsmath.GT

Maximal knotless graphs have at least 74% of their vertices' edges.

problem Characterizing maximal knotless graphs and understanding their edge constraints.

method Analyzing edge maximality and constructing graphs to meet constraints.

result There exists an infinite family of maximal knotless graphs with fewer edges than previously thought.

maximal knotless graphs edge maximality embedding in R^3 clique sum vertex count

2021-01-13abs ↗pdf ↗

Dips at small sizes for topological graph obstruction setsmath.GT

Fewer obstructions for small graphs in knotless embedding.

problem Finite obstructions for knotless embedding of small graphs.

method Analysis of graph minor obstructions and knotless embedding.

result There are only three obstructions for size 23 graphs, significantly fewer than previously known.

Graph Minor Theorem Knotless Embedding Finite Obstructions Small Graphs

2022-05-27abs ↗pdf ↗

Three thousand obstructions to knotless embeddingmath.GT

3028 obstructions found for embedding without knots.

problem Finding obstructions for knotless embedding.

method Surveying recent work, updating obstructions, and proposing new questions.

result New obstructions with μ=6 and insights into connectivity.

knotless embedding obstructions intrinsically knotted Colin de Verdière invariant graph theory

2026-07-01abs ↗pdf ↗

An Algorithm for Detecting Intrinsically Knotted Graphsmath.GT

We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by Goldberg, Mattman, and Naimi [6] to greatly expand the list of known minor minima…

2011-09-05abs ↗pdf ↗

Constructions stemming from non-separating planar graphs and their Colin de Verdière invariantmath.CO

New constructions from non-separating planar graphs improve understanding of graph linkability and knotability.

problem Understanding linkability and knotability of graph complements.

method Using maximal non-separating planar graphs to construct examples of maximal linkless and knotless graphs, and analyzing their Colin de Verdière invariant.

result The Colin de Verdière invariant of the complement of a maximal non-separating planar graph satisfies μ(cG) ≤ n-4, and equality holds.

non-separating planar graphs linkless graphs knotless graphs Colin de Verdière invariant intrinsically linked

2021-01-14abs ↗pdf ↗

Heterogeneous Synthetic Learner for Panel Datastat.ML

New method for estimating heterogeneous treatment effects in panel data.

problem Estimating heterogeneous treatment effects in non-stationary, temporally dependent panel data.

method Proposes H1SL and H2SL, synthetic learners for panel data, based on existing non-panel data estimators.

result Established convergence rates for proposed estimators and demonstrated superior performance.

heterogeneous treatment effect panel data synthetic learners non-stationary temporal dependency

2022-12-30abs ↗pdf ↗