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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920182026
48 results for polynomial subset

We say that a given knot JS3J\subset S^3 is detected by its knot Floer homology and AA-polynomial if whenever a knot KS3K\subset S^3 has the same knot Floer homology and the same AA-polynomial as JJ, then K=JK=J. In this paper we show that every torus knot T(p,q)T(p,q) is detected by its knot Floer homology and AA-polynom…

2014-11-03abs ↗pdf ↗

Invariants for surfaces up to rigid transformations, with a comeagre subset retrieval algorithm.

problem Identifying compact surfaces up to rigid transformations.
method Degree four polynomials in moments of delta function, effective inversion algorithm.
result Invariants and retrieval algorithm work on a comeagre subset of surfaces.

We describe the Polyak-Viro arrow diagram formulas for the coefficients of the Conway polynomial. As a consequence, we obtain the Conway polynomial as a state sum over some subsets of the crossings of the knot diagram. It turns out to be a simplification of a special case of Jaeger's state model for the HOMFLY polynomi…

2008-10-17abs ↗pdf ↗

Study bounds the volume of moduli space for convex RP² structures.

problem Bounding the volume of moduli space for convex RP² structures.
method Investigates subsets defined by bounded projective invariants and fixed boundary lengths, showing finite volume and analog of Mumford's compactness theorem.
result Goldman symplectic volume is bounded by a polynomial of (t,L)(t, \mathbf{L}).

Turning the skein relation for HOMFLY into a Fibonacci recurrence, we prove that there are only three rational specializations of HOMFLY polynomial: Alexander-Conway, Jones, and a new one. Using the recurrence relation, we find general and relative expansion formulae and rational generating functions for Alexander-Conw…

2010-03-04abs ↗pdf ↗

In this paper, we study the asymptotic behavior of the volume of spheres in metric measure spaces. We first introduce a general setting adapted to the study of asymptotic isoperimetry in a general class of metric measure spaces. We then introduce a notion of "being asymptotically isoperimetric" for a family of finite a…

2005-06-17abs ↗pdf ↗

Let R\R be a real closed field, QR[Y1,...,Y,X1,...,Xk], {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], with $ °_{Y}(Q) \leq 2, °_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m$, and PR[X1,...,Xk] {\mathcal P} \subset \R[X_1,...,X_k] with $°_{X}(P) \leq d, P \in {\mathcal P}, #({\mathcal P})=s$. Let SR+kS \subset \R^{\ell+k} be a semi-alg…

2008-06-24abs ↗pdf ↗

We consider the problem of decomposing a multivariate polynomial as the difference of two convex polynomials. We introduce algebraic techniques which reduce this task to linear, second order cone, and semidefinite programming. This allows us to optimize over subsets of valid difference of convex decompositions (dcds) a…

2015-10-06abs ↗pdf ↗

Algorithm finds safe zones in policy Markov Decision Processes to limit trajectory escape.

problem Finding safe zones in policy Markov Decision Processes to limit trajectory escape.
method Bi-criteria approximation learning algorithm with polynomial sample complexity.
result Achieves almost 2 approximation for both escape probability and safe zone size.

This paper investigates symmetric ribbon numbers of low-complexity knots.

problem Determining the minimum number of ribbon singularities in symmetric ribbon disks for knots with up to 12 crossings.
method Systematic investigation using knot polynomials and determinants.
result Novel lower bounds for symmetric ribbon numbers of knots with up to 12 crossings.

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.

We give the first polynomial-time algorithm for performing linear or polynomial regression resilient to adversarial corruptions in both examples and labels. Given a sufficiently large (polynomial-size) training set drawn i.i.d. from distribution D and subsequently corrupted on some fraction of points, our algorithm out…

2018-03-08abs ↗pdf ↗

The paper characterizes complex projective spaces using Ehrhart polynomials.

problem Characterizing complex projective spaces via Ehrhart polynomials.
method Using Ehrhart polynomials associated with integral multiples of the standard simplex, the paper proves characterizations of polarized toric manifolds.
result Characterizations of complex projective spaces (CPn)(\mathbb{C} P^n) are achieved for specific cases.

In this paper we address the following questions: (i) Let CC2C\subset \mathbb C^2 be an orbit of a polynomial vector field which has finite total Gaussian curvature. Is CC contained in an algebraic curve? (ii) What can be said of a polynomial vector field which has a finitely curved transcendent orbit? We give a positi…

2006-12-05abs ↗pdf ↗

We consider a basic problem at the interface of two fundamental fields: submodular optimization and online learning. In the online unconstrained submodular maximization (online USM) problem, there is a universe [n]={1,2,...,n}[n]=\{1,2,...,n\} and a sequence of TT nonnegative (not necessarily monotone) submodular functions arrive …

2018-06-08abs ↗pdf ↗

A topological invariant of a polynomial map p:XBp:X\to B from a complex surface containing a curve CXC\subset X to a one-dimensional base is given by a rational second homology class in the compactification of the moduli space of genus gg curves with nn labeled points $\modmgn$. Here the generic fibre of pp has genus …

2006-05-10abs ↗pdf ↗

We study a general online linear optimization problem(OLO). At each round, a subset of objects from a fixed universe of nn objects is chosen, and a linear cost associated with the chosen subset is incurred. To measure the performance of our algorithms, we use the notion of regret which is the difference between the to…

2018-06-12abs ↗pdf ↗

Upper bounds for Steklov eigenvalues in subgraphs of polynomial growth Cayley graphs.

problem Finding upper bounds for Steklov eigenvalues in subgraphs of polynomial growth Cayley graphs.
method Discretizing a bounded domain and using comparison theorems.
result The $k^{\mbox{th}}$ eigenvalue tends to 00 proportionally to 1/B1d11/|B|^{\frac{1}{d-1}}.

Let R\R be a real closed field, QR[Y1,...,Y,X1,...,Xk], {\mathcal Q} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], with $ °_{Y}(Q) \leq 2, °_{X}(Q) \leq d, Q \in {\mathcal Q}, #({\mathcal Q})=m,$ and PR[X1,...,Xk] {\mathcal P} \subset \R[X_1,...,X_k] with $°_{X}(P) \leq d, P \in {\mathcal P}, #({\mathcal P})=s$, and SR+kS \subset \R^{\ell+k} a semi-algebr…

2007-08-27abs ↗pdf ↗

Optimal experiments tighten causal effect bounds efficiently.

problem Selecting experiments to tighten causal effect bounds from observational data.
method Formalized as max-potency problem, NP-hard. Polynomial-programming framework with graphical pruning criteria.
result Pruning criteria reduce search space significantly, enabling efficient experiment selection.

The paper shows neural networks can approximate functions over non-compact domains with non-polynomial activation.

problem Approximating functions over non-compact domains using neural networks.
method Using single-hidden-layer feedforward neural networks with non-polynomial activation functions over non-compact subsets of Euclidean spaces.
result Neural networks can approximate functions in weighted CkC^k-spaces and weighted Sobolev spaces over unbounded domains.

The paper associates knots to numerical semigroups and shows their Alexander polynomials coincide with semigroups' Poincaré series.

problem Understanding the algebraic structure of numerical semigroups through topological representations.
method Associaing iterated torus knots to free numerical semigroups and analyzing their knot complements and Alexander polynomials.
result Alexander polynomials of knots associated with free numerical semigroups coincide with the semigroup's Poincaré series.

Designs efficient algorithms to maximize the expectation of Gaussian random variables.

problem Maximizing the expectation of the supremum of Gaussian random variables.
method Polynomial time approximation scheme and O(logn)O(\log n) approximation algorithm for general m>1m>1.
result Characterizes optimal variance allocation and provides approximation algorithms.

New connection found between complex polynomials and surface homeomorphisms.

problem Investigating the existence of generalized pseudo-Anosov maps from quadratic polynomials.
method Developed a new connection between dynamics of quadratic polynomials and surface homeomorphisms, focusing on Hubbard trees.
result Identified conditions for constructing generalized pseudo-Anosov maps from quadratic polynomials.

A fast algorithm selects best subsets in high-dimensional models.

problem Identifying sparse models in high-dimensional generalized linear models.
method Splicing technique for fast and consistent best subset selection.
result Our algorithm achieves high certainty in selecting best subsets with polynomial computational complexity.

We consider the family MPd\mathrm{MP}_d of affine conjugacy classes of polynomial maps of one complex variable with degree d2d \geq 2, and study the map Φd:MPdΛ~dCd/SdΦ_d:\mathrm{MP}_d\to \widetildeΛ_d \subset \mathbb{C}^d / \mathfrak{S}_d which maps each fMPdf \in \mathrm{MP}_d to the set of fixed-point multipliers of ff. We show t…

2007-08-19abs ↗pdf ↗

The AJAJ-conjecture for a knot KS3K \subset S^3 relates the AA-polynomial and the colored Jones polynomial of KK. If a two-bridge knot KK satisfies the AJAJ-conjecture, we give sufficient conditions on KK for the (r,2)(r,2)-cable knot CC to also satisfy the AJAJ-conjecture. If a reduced alternating diagram of KK has …

2014-12-02abs ↗pdf ↗

Let ff be an ordinary polynomial in C[z1,...,zn]\mathbb{C}[z_1,..., z_n] with no negative exponents and with no factor of the form z1α1...znαnz_1^{α_1}... z_n^{α_n} where αiα_i are non zero natural integer. If we assume in addicting that ff is maximally sparse polynomial (that its support is equal to the set of vertices of its Newton p…

2007-04-17abs ↗pdf ↗

This work connects knot invariants to Chern-Simons theories via factorization homology.

problem Understanding knot invariants in Chern-Simons theories.
method Constructing a filtered E3\mathcal{E}_3-algebra and proving an equality between factorization homology trace and Reshetikhin-Turaev link invariant.
result Established a connection between knot invariants and Chern-Simons theories.

The paper generalizes polynomial functions on Lie groups and their properties.

problem Generalizing polynomial functions on Lie groups and understanding their properties.
method Generalizing the notion of polynomial functions and horizontally affine maps on Lie groups.
result S-polynomial functions are equivalent to polynomial functions in the sense of Leibman in connected nilpotent Lie groups.