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

Trend · papers per month

6491,2971,9462,594 · Jun 202019922001200920172026
48 results for slope of dual graph

The slope conjecture proposed by Garoufalidis asserts that the Jones slopes given by the sequence of degrees of the colored Jones polynomials are boundary slopes. We verify the slope conjecture for graph knots, i.e. knots whose Gromov volume vanish.

2015-01-06abs ↗pdf ↗

We show that the properties of admitting a co-oriented taut foliation and having a left-orderable fundamental group are equivalent for rational homology 33-sphere graph manifolds and relate them to the property of not being a Heegaard-Floer L-space. This is accomplished in several steps. First we show how to detect fa…

2014-01-30abs ↗pdf ↗

Using elementary ideas from Tropical Geometry, we assign a a tropical curve to every qq-holonomic sequence of rational functions. In particular, we assign a tropical curve to every knot which is determined by the Jones polynomial of the knot and its parallels. The topical curve explains the relation between the AJ Con…

2010-03-23abs ↗pdf ↗

We construct new examples of solutions of the Hull-Strominger system on non-Kähler torus bundles over K3 surfaces, with the property that the connection \nabla on the tangent bundle is Hermite-Yang-Mills. With this ansatz for the connection \nabla, we show that the existence of solutions reduces to known results ab…

2018-10-10abs ↗pdf ↗

The exceptional Dehn filling conjecture of the second author concerning the relationship between exceptional slopes α,βα, β on the boundary of a hyperbolic knot manifold MM has been verified in all cases other than small Seifert filling slopes. In this paper we verify it when αα is a small Seifert filling slope and $β…

2011-04-17abs ↗pdf ↗

In recent years, there has been a surge of interest in developing deep learning methods for non-Euclidean structured data such as graphs. In this paper, we propose Dual-Primal Graph CNN, a graph convolutional architecture that alternates convolution-like operations on the graph and its dual. Our approach allows to lear…

2018-06-03abs ↗pdf ↗

Random matrix models generalize to Group Field Theories (GFT) whose Feynman graphs are dual to gluings of higher dimensional simplices. It is generally assumed that GFT graphs are always dual to pseudo manifolds. In this paper we prove that already in dimension three (and in all higher dimensions), this is not true due…

2010-06-03abs ↗pdf ↗

We introduce \textit{dual graph diagrams} representing oriented knots and links. We use these combinatorial structures to define corresponding algebraic structures we call \textit{biquasiles} whose axioms are motivated by dual graph Reidemeister moves, generalizing the Dehn presentation of the knot group analogously to…

2016-10-21abs ↗pdf ↗

In this note, I discuss in some detail the dual version of the ribbon graph decomposition of the moduli spaces of Riemann surfaces with boundary and marked points, which I introduced in math.AG/0402015, and used in math.QA/0412149 to construct open-closed topological conformal field theories. This dual version of the r…

2006-01-06abs ↗pdf ↗

A graph manifold rational homology 33-sphere WW with a left-orderable fundamental group admits a co-oriented taut foliation, though it is unknown whether it admits a smooth co-oriented taut foliation. In this paper we extend the gluing theorem of arXiv:1401.7726 to graph manifold rational homology solid tori and use …

2015-10-08abs ↗pdf ↗

Dual regularized graph Laplacian improves spectral clustering for community detection.

problem Detecting clusters in networks with improved spectral clustering methods.
method Proposes dual regularized graph Laplacian for three spectral clustering approaches.
result Theoretical analysis shows DRSC and DRSLIM yield stable consistent community detection.

FairDTD improves fairness in GNNs by distilling dual teacher knowledge, balancing utility and bias.

problem Bias in GNN predictions due to sensitive attributes.
method Dual-Teacher Distillation with a causal graph model, feature and structure teachers, and graph-level distillation.
result Achieves optimal fairness while preserving high model utility.

CADE learns dual node representations for better generalization.

problem Transductive graph embeddings cannot generalize to unseen nodes or across different graphs.
method CADE combines real-time neighborhoods with neighbor-attentioned representation, preserving known node memory.
result CADE outperforms state-of-the-art methods in generalization and context-awareness.

Develops a method to construct entire minimal graphs of odd dimensions.

problem Constructing entire minimal graphs of odd dimensions and arbitrary codimensions.
method Evolving-plane ansatz reducing minimal surface system to geodesic equation on Grassmannian.
result Yields a rich family of explicit entire minimal graphs of odd dimension and arbitrary codimension.

Unified analysis of multi-task functional linear regression with manifold and composite penalties.

problem Estimating slope functions from functional data with multi-task learning.
method Penalized splines with manifold constraint and composite quadratic penalty.
result Unified convergence upper bound and phase transition behaviors for estimators.

PDNAS optimizes GNN architectures for diverse datasets.

problem Inadequate adaptability and combinatorial search space in GNNs.
method Dual architecture search (micro- and macro-architectures) with gradient-based optimization.
result PDNAS finds deeper GNNs with better performance on diverse datasets.

Graph convolutional networks (GCNs) have shown the powerful ability in text structure representation and effectively facilitate the task of text classification. However, challenges still exist in adapting GCN on learning discriminative features from texts due to the main issue of graph variants incurred by the textual …

2019-11-28abs ↗pdf ↗

Study properties of self-similar continua with finite intersection property.

problem Characterize self-similar continua with finite intersection property.
method Prove intersection graph criterion, finite order theorem, and parameter matching theorem.
result All Jordan arcs starting from a intersection point in such continuum on a plane should have the same slope parameter at that point.

The main results in this paper provide upper bounds of the second order Dehn functions for three-dimensional groups Nil and Sol. These upper bounds are obtained by using the Varopoulos transport argument on dual graphs. The first step is to start with reduced handlebody diagrams of the three-dimensional balls either im…

2010-10-17abs ↗pdf ↗

Using the Hatcher-Oertel algorithm for finding boundary slopes of Montesinos knots, we prove the Slope Conjecture and the Strong Slope Conjecture for a family of 3-tangle pretzel knots. More precisely, we prove that the maximal degrees of the colored Jones polynomial of such knots determine a boundary slope as predicte…

2016-02-15abs ↗pdf ↗

The Slope Conjecture proposed by Garoufalidis asserts that the degree of the colored Jones polynomial determines a boundary slope, and its refinement, the Strong Slope Conjecture proposed by Kalfagianni and Tran asserts that the linear term in the degree determines the topology of an essential surface that satisfies th…

2018-11-28abs ↗pdf ↗

Local mappings relate dual and primal factor graphs for efficient marginal probability estimation.

problem Efficient estimation of marginal probabilities in statistical physics models.
method Local mappings based on Fourier transform of local factors, applied to Ising, Potts, and clock models.
result Local extrema of fixed points are at phase transition points, and the mapping facilitates efficient estimation.

Let M be a compact, connected, orientable, irreducible 3-manifold and T an incompressible torus boundary component of M such that the pair (M,T) is not cabled. In the paper "Toroidal and Klein bottle boundary slopes" [arXiv:math/0601034] by the author it was established that for any K-incompressible tori F,F' in (M,T) …

2012-12-22abs ↗pdf ↗

A slope p/qp/q is a characterising slope for a knot KK in S3S^3 if the oriented homeomorphism type of p/qp/q-surgery on KK determines KK uniquely. We show that when KK is a hyperbolic knot its set of characterising slopes contains all but finitely many slopes p/qp/q with q3q \geq 3. We prove stronger results for hyper…

2018-07-29abs ↗pdf ↗

The Slope Conjecture relates the degree of the colored Jones polynomial to the boundary slopes of a knot. We verify the Slope Conjecture and the Strong Slope Conjecture for Montesinos knots M(1r,1s1u,1t)M(\frac{1}{r},\frac{1}{s-\frac{1}{u}},\frac{1}{t} ) with r,u,tr,u,t odd, ss even and u1u\leq-1, r<1<1<s,tr<-1<1<s,t.

2017-10-19abs ↗pdf ↗