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

Trend · papers per month

275481108 · Jun 202019922001200920172026
48 results for polynomial criterion

Refines virtual link equality criterion for diagrams with one virtual crossing.

problem Determining when a virtual link diagram represents a properly virtual link.
method Refines the Kauffman-Murasugi-Thislethwaite type inequality for virtual links.
result Criterion for virtual link diagrams with exactly one virtual crossing to represent a properly virtual link.

The paper proves a criterion for L-space knots and their representations.

problem Conditions for abelian SL(2,R)\mathrm{SL}(2,\mathbb{R})-representations of knot groups.
method Continuous family of irreducible representations converging to abelian representations.
result Alexander polynomial of nontrivial L-space knots has odd order on the unit circle.

Cyclotomic polynomials help classify mapping classes on surfaces.

problem Characterizing mapping classes on surfaces using cyclotomic polynomials.
method Investigating characteristic polynomials of integral symplectic matrices and using cyclotomic polynomials to classify them.
result For n3n \geq 3, the polynomial φn(x)\varphi_n(x) is realized by a mapping class of algebraically finite type if and only if nn has at most two distinct prime divisors.

We give a congruence relating a one variable specialization of the two variable Kauffman polynomial of any periodic link to that of its mirror image. Consequently, we obtain a new and simple criterion for periodicity of links.

2015-09-28abs ↗pdf ↗

Murasugi discovered two criteria that must be satisfied by the Alexander polynomial of a periodic knot. We generalize these to the case of twisted Alexander polynomials. Examples demonstrate the application of these new criteria, including to knots with trivial Alexander polynomial, such as the two polynomial 1 knots w…

2004-12-19abs ↗pdf ↗

New model handles complex non-linear relationships with hidden graph structures.

problem Modeling non-linear relationships with hidden graph-structured interactions.
method Block-diagonal localized mixture of polynomial experts (BLoMPE) regression model with penalized maximum likelihood selection criterion.
result Strong theoretical guarantee for finite-sample oracle inequality.

Paper conjectures Links-Gould invariant generalizes Alexander polynomial.

problem Classifying knots and links using the Links-Gould invariant.
method Analyzing classical properties of the Links-Gould invariant.
result Evidence suggests Links-Gould invariant provides lower bounds for genus and fiberedness criteria.

We show how the signed evaluations of link polynomials can be used to calculate unknotting numbers. We use the Jones-Rong value of the Brandt-Lickorish-Millett-Ho polynomial Q to calculate the unknotting numbers of 8_{16}, 9_{49} and 6 further new entries in Kawauchi's tables. Another method is developed by applying an…

2004-05-05abs ↗pdf ↗

This paper continues the study of periodic links started in \cite{Politarczyk2}. It contains a study of the equivariant analogues of the Jones polynomial, which can be obtained from the equivariant Khovanov homology. In this paper we describe basic properties of such polynomials, show that they satisfy an analogue of t…

2015-04-14abs ↗pdf ↗

We prove that twisting any quasi-alternating link LL with no gaps in its Jones polynomial VL(t)V_L(t) at the crossing where it is quasi-alternating produces a link LL^{*} with no gaps in its Jones polynomial VL(t)V_{L^*}(t). This leads us to conjecture that the Jones polynomial of any prime quasi-alternating link, other th…

2018-10-28abs ↗pdf ↗

Study identifies parameters in causal models with latent confounding.

problem Parameter identification in linear non-Gaussian causal models with latent confounding.
method Graphical criterion for necessary and sufficient identifiability of direct causal effects, with polynomial-time algorithm.
result Developed a graphical criterion for identifying direct causal effects in latent variable models with arbitrary non-linear confounding.

Let p2p\geq 2 and q0q\neq 0 an integer. A knot KK in the three-sphere is said to be a (p,q)(p,q)-lens knot if and only if it covers a link in the lens space L(p,q)L(p,q). In this paper, we use the second coefficient of the HOMFLY polynomial to provide a necessary condition for a knot to be a (p,q)(p,q)-lens knot. As an applicat…

2003-10-29abs ↗pdf ↗

Gaussian graphical models are semi-algebraic subsets of the cone of positive definite covariance matrices. Submatrices with low rank correspond to generalizations of conditional independence constraints on collections of random variables. We give a precise graph-theoretic characterization of when submatrices of the cov…

2008-12-10abs ↗pdf ↗

We give a criterion to detect whether the derivatives of the HOMFLY polynomial at a point is a Vassiliev invariant or not. In particular, for a complex number b we show that the derivative P_K^{(m,n)}(b,0)=d^m/da^m d^n/dx^n P_K(a,x)|(a, x) = (b, 0) of the HOMFLY polynomial of a knot K at (b,0) is a Vassiliev invariant …

2002-11-04abs ↗pdf ↗

Milnor fibrations have been studied since 1960's. In this paper, we study singular points of differentiable maps, called Milnor fibration product maps, obtained by several Milnor fibrations. We give a characterization of singular points of such product maps, and for the case of certain weighted homogeneous polynomials,…

2012-11-24abs ↗pdf ↗

Proposes a group-splicing algorithm for efficient BSGS in high-dimensional settings.

problem Efficiently selecting a small part of non-overlapping groups for best interpretability in high-dimensional settings.
method Iteratively detects relevant groups and excludes irrelevant ones using a novel group information criterion.
result Certifiable polynomial-time algorithm for identifying the optimal subset of groups with high probability.

Optimized Franz-Parisi criterion matches SQ lower bounds for various statistical models.

problem Understanding computational hardness in statistical inference.
method Proposed and refined Franz-Parisi criterion, established equivalence with SQ lower bounds.
result Optimized Franz-Parisi criterion is equivalent to Statistical Query (SQ) lower bounds.

This paper addresses the problem of active learning of a multi-output Gaussian process (MOGP) model representing multiple types of coexisting correlated environmental phenomena. In contrast to existing works, our active learning problem involves selecting not just the most informative sampling locations to be observed …

2015-11-21abs ↗pdf ↗

A long-standing open problem is to determine for which values of n the Burau representation Psi_n of the braid group B_n is faithful. Following work of Moody, Long-Paton, and Bigelow, the remaining open case is n = 4. One criterion states that Psi_n is unfaithful if and only if there exists a pair of arcs in the n-punc…

2016-10-14abs ↗pdf ↗

Our goal is to compute the minimal-order recurrence of the colored Jones polynomial of the 7_4 knot, as well as for the first four double twist knots. As a corollary, we verify the AJ Conjecture for the simplest knot 7_4 with reducible non-abelian SL(2,C) character variety. To achieve our goal, we use symbolic summatio…

2012-11-26abs ↗pdf ↗

A three-dimensional Riemannian manifold has locally 6, 4, 3, 2, 1 or none independent Killing vectors. We present an explicit algorithm for computing dimension of the infinitesimal isometry algebra. It branches according to the values of curvature invariants. These are relative differential invariants computed via curv…

2018-04-30abs ↗pdf ↗

We introduce Tristram-Levine signatures of virtual knots and use them to investigate virtual knot concordance. The signatures are defined first for almost classical knots, which are virtual knots admitting homologically trivial representations. The signatures and ωω-signatures are shown to give bounds on the topologic…

2017-08-27abs ↗pdf ↗

This paper continues our study, initiated in [arXiv:1108.3370], of essential state surfaces in link complements that satisfy a mild diagrammatic hypothesis (homogeneously adequate). For hyperbolic links, we show that the geometric type of these surfaces in the Thurston trichotomy is completely determined by a simple gr…

2012-09-25abs ↗pdf ↗

New method uses almost orthonormal bases to prove low-degree lower bounds in complex statistical models.

problem Proving statistical-computational gaps in high-dimensional models with planted structures.
method Constructing an almost orthonormal polynomial basis under the planted distribution.
result Established new low-degree lower bounds for various complex models.

We study the connectedness of the planar self-affine sets T(A,D)T(A,{\mathcal{D}}) generated by an integer expanding matrix AA with det(A)=3|\det(A)|=3 and a non-collinear digit set D={0,v,kAv}{\mathcal D}=\{0, v, kAv\} where kZ{0}k\in {\mathbb Z}\setminus\{0\} and vZ2v\in {\mathbb Z}^2 such that {v,Av}\{v, Av\} is linearly independent. By chec…

2012-08-18abs ↗pdf ↗

Multifractal time series analysis is a approach that shows the possible complexity of the system. Nowadays, one of the most popular and the best methods for determining multifractal characteristics is Multifractal Detrended Fluctuation Analysis (MFDFA). However, it has some drawback. One of its core elements is detrend…

2015-10-17abs ↗pdf ↗

A new tradeoff between regularization and sharpness improves model performance in overparameterized settings.

problem Improving model performance in overparameterized settings with minimum-norm interpolators.
method Proposes a regularization-sharpness tradeoff for overparameterized linear regression with an ℓ^p penalty.
result Empirical validation shows the tradeoff terms can distinguish performant linear interpolators.

We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on which several probability distributions agree. Instead of minimizing an objective f…

2011-08-06abs ↗pdf ↗

New approach to adaptively select bandwidths in nonparametric regression.

problem Adaptive bandwidth selection in nonparametric regression.
method Inspired by 2\ell_2-norms of interval projections, introduces a new bandwidth selection procedure.
result Obtains non-asymptotic risk bounds for local polynomial regression methods that adapt to local Hölder exponent.

Sharp analysis of power iteration for tensor PCA, improving convergence and stopping criteria.

problem Analyzing the power iteration algorithm for tensor PCA to improve convergence and stopping criteria.
method Sharp bounds on the number of iterations, revealing a smaller algorithmic threshold, proposing a stopping criterion.
result Sharp bounds on the number of iterations required for power method to converge, revealing a smaller algorithmic threshold than previously conjectured.

Counterexamples show Salter's question on Burau image is negative for n=4.

problem Conditions for a matrix to be in the Burau image of B4B_4.
method Analyzing the central quotient and using counterexamples.
result The central quotient of the Burau image group does not coincide with the central quotient of a specific subgroup of the unitary group for n=4n=4.