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

4387130173 · May 202619922001200920172026
48 results for polynomial equivalence

We study a family of polynomials in two variables having moduli up to bilipschitz equivalence: two distinct polynomials of this family are not bilipschitz equivalent. However any level curve of the first polynomial is bilipschitz equivalent to a level curve of the second.

2019-02-05abs ↗pdf ↗

Using the same method we provide negative answers to the following questions: Is it possible to find real equations for complex polynomials in two variables up to topological equivalence (Lee Rudolph) ? Can two topologically equivalent polynomials be connected by a continuous family of topologically equivalent polynomi…

2002-10-21abs ↗pdf ↗

Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial, the product of a_ix+b_iy+c_i, so that A = (f=0). We prove that the defining polynomials of two generic line arrangements are, up to a small deformation, t…

2012-05-10abs ↗pdf ↗

The following numerical control over the topological equivalence is proved: two complex polynomials in n3n\not= 3 variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of polynomial functions fs ⁣:CnCf_s \colon \mathbb{C}^n \to \mathbb{C} with isolated sin…

2003-09-19abs ↗pdf ↗

Proves transitivity of a specific class of quadratic polynomials.

problem Transitivity of pure Hurwitz classes of post-critically finite quadratic polynomials.
method Uses mapping classes of the sphere with finitely many marked points.
result Establishes transitivity for pure Hurwitz classes of post-critically finite quadratic polynomials.

This paper investigates the equivalence between Yamada polynomial and Jones polynomial of associated links for brunnian θ-curves.

problem Understanding the relationship between Yamada polynomial and Jones polynomial for θ-curves.
method Investigates the equivalence between the normalized Yamada polynomial of θ-curves and the Jones polynomial of their associated links.
result Shows that the two polynomials are equivalent for brunnian θ-curves.

The paper classifies pretzel links with 2 components and gives conditions for those with 3 or more.

problem Classifying pretzel links based on their self delta-equivalence.
method Using Conway polynomials to determine self delta-equivalence for links with 2 or more components.
result Necessary and sufficient conditions for self delta-equivalence of pretzel links with 3 or more components.

In the paper, we provide an effective method for the Lipschitz equivalence of two-branch Cantor sets and three-branch Cantor sets by studying the irreducibility of polynomials. We also find that any two Cantor sets are Lipschitz equivalent if and only if their contraction vectors are equivalent provided one of the cont…

2017-02-10abs ↗pdf ↗

New method detects projective equivalences and symmetries in rational 3D curves.

problem Detecting projective equivalences and symmetries in rational 3D curves.
method Using differential invariants and Möbius transformations to avoid solving large polynomial systems.
result Efficient algorithm for detecting projective equivalences and symmetries without solving large polynomial systems.

A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the Kauffman bracket to an invariant of looped graphs, and an extension of Reidemeis…

2008-08-25abs ↗pdf ↗

The Jones polynomial VL(t)V_{L}(t) for an oriented link LL is a one-variable Laurent polynomial link invariant discovered by Jones. For any integer n3n\ge 3, we show that: (1) the difference of Jones polynomials for two oriented links which are CnC_{n}-equivalent is divisible by $\left(t-1\right)^{n}\left(t^{2}+t+1\right…

2016-02-08abs ↗pdf ↗

We give a new interpretation of the Alexander polynomial Δ0Δ_0 for virtual knots due to Sawollek and Silver and Williams, and use it to show that, for any virtual knot, Δ0Δ_0 determines the writhe polynomial of Cheng and Gao (equivalently, Kauffman's affine index polynomial). We also use it to define a second-order wri…

2016-01-26abs ↗pdf ↗

We give a global version of Le-Ramanujam mu-constant theorem for polynomials. Let f_t, (t in [0,1]), be a family of polynomials of n complex variables with isolated singularities, whose coefficients are polynomials in t. We consider the case where some numerical invariants are constant (the affine Milnor number, the Mi…

2002-01-15abs ↗pdf ↗

Theory is developed for linear-quadratic at infinity generating families for Legendrian knots in R^3. It is shown that the unknot with maximal Thurston--Bennequin invariant of -1 has a unique linear-quadratic at infinity generating family, up to fiber-preserving diffeomorphism and stabilization. From this, invariant ge…

2009-04-17abs ↗pdf ↗

Study reveals an equivalence principle for the spectrum of random inner-product kernel matrices in polynomial scaling.

problem Understanding the spectrum of random kernel matrices in polynomial scaling regimes.
method Investigates random matrices with nonlinear kernel functions applied to inner products of uniformly distributed vectors.
result The spectrum of the random kernel matrix is asymptotically equivalent to a simpler matrix model through free additive convolution.

Research on mixed polynomials, extending non-degeneracy concepts to complex variables.

problem Extending non-degeneracy concepts to mixed polynomials in complex variables.
method Generalization of Mondal's partial non-degeneracy to mixed polynomials, introducing new concepts and proving properties.
result Strong partial non-degeneracy implies isolated singularities, and mixed polynomials that are strongly inner non-degenerate satisfy the strong Milnor condition.

We explain an algorithm for finding a boundary link Seifert matrix for a given Alexander polynomial. The algorithm depends on several choices and therefore makes it possible to find non-equivalent Seifert matrices for a given Alexander polynomial.

2003-05-28abs ↗pdf ↗

In this paper we study the topology of three different kinds of spaces associated to polynomial knots of degree at most dd, for d2d\geq2. We denote these spaces by Od\mathcal{O}_d, Pd\mathcal{P}_d and Qd\mathcal{Q}_d. For d3d\geq3, we show that the spaces Od\mathcal{O}_d and Pd\mathcal{P}_d are path connected and the …

2016-03-30abs ↗pdf ↗

Study Alexander polynomials of links in 3-torus.

problem Investigate Alexander polynomials of links in 3-torus.
method Diagrammatic approach, Reidemeister moves, fundamental group, homology group, Alexander polynomials, twisted Alexander polynomials.
result Computed Alexander and twisted Alexander polynomials of links in 3-torus.

New framework mated Kleinian groups with complex polynomials, revealing unique group properties.

problem Mating Kleinian groups with complex polynomials dynamics.
method Orbit equivalence framework for holomorphic mating, focusing on Fuchsian groups and higher Bowen-Series maps.
result Only torsion-free Fuchsian groups can be mated, with specific properties of Bowen-Series maps.

Study of two-layer NNs under Gaussian mixtures data, proving polynomial models equivalent to neural networks.

problem Training and generalization performance of two-layer NNs under structured Gaussian mixture data.
method Asymptotic analysis of two-layer NNs after one gradient descent step under Gaussian mixture data assumption.
result High-order polynomial models equivalent to nonlinear neural networks under certain conditions.

We consider the Alexander polynomial of a plane algebraic curve twisted by a linear representation. We show that it divides the product of the polynomials of the singularity links, for unitary representations. Moreover, their quotient is given by the determinant of its Blanchfield intersection form. Specializing in the…

2005-04-18abs ↗pdf ↗

Two knots in three-space are S-equivalent if they are indistinguishable by Seifert matrices. We show that S-equivalence is generated by the doubled-delta move on knot diagrams. It follows as a corollary that a knot has trivial Alexander polynomial if and only if it can be undone by doubled-delta moves.

1999-11-02abs ↗pdf ↗

Random Transformers behave like polynomial models in ICL with asymptotic growth.

problem Understanding in-context learning capabilities of pretrained Transformers.
method Asymptotic analysis of a random Transformer with a fixed first layer and a trained second layer, considering growth in context length, input dimension, hidden dimension, and training parameters.
result The random Transformer's ICL error is equivalent to a finite-degree Hermite polynomial model.

Study finds polynomial convergence rate for Farey sequences linked to Riemann hypothesis.

problem Understanding convergence rates of maximum mean discrepancies for Farey sequences.
method Identifying positive-semidefinite kernels and their polynomial convergence rates.
result Polynomial convergence rate of maximum mean discrepancies of Farey sequences is equivalent to the Riemann hypothesis.

For a graph G embedded in an orientable surface Σ, we consider associated links L(G) in the thickened surface Σ\times I. We relate the HOMFLY polynomial of L(G) to the recently defined Bollobas-Riordan polynomial of a ribbon graph. This generalizes celebrated results of Jaeger and Traldi. We use knot theory to prove re…

2006-05-17abs ↗pdf ↗

Develops exact convex optimization formulations for neural networks.

problem Training two-layer neural networks with rectified linear units.
method Uses semi-infinite duality and minimum norm regularization to develop exact convex optimization formulations.
result Shows equivalence of ReLU networks trained with weight decay to block 1\ell_1 penalized convex models.

Study links between surface germs and knot theory in 4D.

problem Understanding the relationship between surface germs and knot theory in R4\mathbb{R}^4.
method Constructing surface germs XKX_K linked to knots KK in S3S^3 and studying their Lipschitz geometry.
result Ambient bi-Lipschitz equivalence of surface germs is related to isotopy of knots, and Jones polynomial can recognize non-equivalent germs.