Proves divisibility relations for symplectic curve polynomials.
problem Divisibility relations for symplectic curve polynomials.
method New proofs of divisibility relations for Oka and Alexander polynomials of symplectic curves.
result Proves Libgober's divisibility relations for symplectic curves.
We describe the polynomial time complexity algorithm for computing first coefficients of the skein (Homflypt) and Kauffman polynomial invariants of links, discovered by D.Vertigan in 1992 but never published.
The paper studies geometric structures of polynomial spaces.
problem Understanding the geometric and combinatorial structures of polynomial spaces.
method Introducing and analyzing finite piecewise Euclidean cell complexes.
result The branched rectangle and annulus complexes are homeomorphic to specific polynomial spaces.
Study of knots and links in 2-complexes, defining linking numbers and polynomials.
problem Understanding knots and links in 2-dimensional complexes.
method Definition of linking numbers and Kauffman-type bracket polynomials for links in 2-complexes.
result Established relationships between 2-complexes and knots/links in 3-manifolds.
Study on colored Jones polynomial of figure-eight knot for complex parameters.
problem Asymptotic behavior of colored Jones polynomial for figure-eight knot.
method Analyzing the asymptotic growth rate of the polynomial for complex parameters with small imaginary part.
result Growth rate of polynomial is related to the Chern-Simons invariant for large real part of the parameter and to the reciprocal of Alexander polynomial for small real part.
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…
Complexity of signed graphs linked to Alexander polynomials and Lehmer's question.
problem Complexity of signed graphs and its relation to Alexander polynomials.
method Definition of graph complexity using Laplacian matrix and Mahler measure, linking to Alexander polynomials and Lehmer's question.
result Complexity growth of signed graphs is related to the growth rate of Alexander polynomials.
We define twisted Alexander polynomials of a complex hypersurface with arbitrary singularities. These generalize the classical Alexander polynomials of high dimensional hypersurfaces and the twisted Alexander polynomial of plane curves. We recover the classical torsionness and divisibility results, which say that, unde…
For each graph and each positive integer n, we define a chain complex whose graded Euler characteristic is equal to an appropriate n-specialization of the dichromatic polynomial. This also gives a categorification of n-specializations of the Tutte polynomial of graphs. Also, for each graph and integer n≤2, w…
Holomorphic actions on complex spaces for nilpotent groups.
problem Understanding polynomial actions on complex spaces for nilpotent groups.
method Explicit construction of biholomorphisms by polynomial maps.
result Simply connected nilpotent Lie groups are biholomorphic to Cn. New bounds for learning polynomial surrogates with L∞ guarantees.
problem Learning polynomial surrogates for bounded binary functions with L∞ error guarantees. method Characterized minimax sample complexity for two classes of polynomials under subgaussian noise.
result Sample complexity rates differ from noiseless case, scaling as nd+1 for degree d polynomials and ns2 for sparse polynomials. Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an integer {\it arrow number} calculated from each loop in an oriented state summa…
Generalizes positivity conjecture to Roger--Yang skein algebras using polynomials.
problem Positivity conjecture for Roger--Yang skein algebras.
method Used explicit polynomials like Chebyshev polynomials of the first kind to give candidates of positive bases.
result Polynomials form a lower bound in the sense of [Lê18] and [LTY21].
New geometric object for polynomials simplifies complex data.
problem Understanding the combinatorial and geometric properties of polynomials.
method Introducing a compact planar 2-complex for polynomials with distinct roots.
result Extracts combinatorial data from a geometric structure of polynomials.
All link types arise from semiholomorphic polynomials.
problem Proving every link type can be represented by semiholomorphic polynomials.
method Constructive proof showing every link type arises from a weakly isolated singularity of a semiholomorphic polynomial.
result Every link type in the 3-sphere arises as the link of a weakly isolated singularity of a semiholomorphic polynomial.
Paper proves polynomial equivalence of quantum complexity metrics.
problem Quantum complexity metrics equivalence.
method Study of right-invariant metrics on unitary group.
result All metrics in the equivalence class have polynomial slowdown in approximation.
Paper analyzes sample complexity of polynomial neural networks.
problem Understanding the sample complexity of polynomial neural networks.
method Extends previous literature to polynomial neural networks and analyzes sample complexity.
result Obtains novel results on sample complexity of polynomial neural networks.
Recently V. Krushkal and D. Renardy generalized the Tutte polynomial from graphs to cell complexes. We show that evaluating this polynomial at the origin gives the number of cellular spanning trees in the sense of A. Duval, C. Klivans, and J. Martin. Moreover, after a slight modification, the Tutte-Krushkal-Renardy pol…
Proves volume conjecture for twist knots using complex analysis.
problem Volume conjecture for twist knots.
method Equivalence relation, complex analysis, analytic continuation, function of several complex variables.
result Proves volume conjecture for twist knots.
The paper improves bounds on the complexity of computing link polynomials.
problem Computing link polynomials by the skein relation is complex.
method Proved new upper and lower bounds on skein tree depth.
result New bounds on skein tree depth are stronger than previous ones.
The paper provides an almost optimal learning and testing algorithm for sparse polynomials.
problem Learning and testing sparse multivariate polynomials efficiently.
method The paper presents an algorithm with sublinear query complexity in 1/ε and almost linear in s for learning and testing s-sparse polynomials. result The algorithm achieves almost optimal query complexity, making it the first of its kind.
Survey on using low-degree polynomials to assess statistical tasks complexity.
problem Understanding the complexity of statistical tasks using polynomial functions.
method Applying low-degree polynomials to measure the complexity of statistical tasks, including detection, recovery, and estimation.
result Low-degree polynomials provide a framework to predict and explain statistical-computational tradeoffs.
Algorithm classifies surface homeomorphisms with polynomial time complexity.
problem Classifying surface homeomorphisms with polynomial time complexity.
method Algorithm to compute curve distances and decide Nielsen-Thurston types.
result Polynomial time classification of surface homeomorphisms.
Polynomial-time DP algorithm for learning Gaussians with matching sample complexity.
problem Learning Gaussian distributions while maintaining privacy.
method General framework for reducing DP estimation to non-private, polynomial-time algorithm for Gaussian learning.
result Matching sample complexity to information-theoretic upper bound for Gaussian learning.
Novel Jones polynomial for open curves in 3D space.
problem Measuring entanglement complexity of open curves in 3-space.
method Defining Jones polynomial for linkoids and extending to collections of open and closed curves.
result Jones polynomial for open curves has real coefficients and is continuous.
Jones polynomials for knots and links with many crossings calculated efficiently.
problem Computing Jones polynomials for knots and links with a large number of crossings.
method Calculating Tutte polynomials for associated graphs and evaluating with specific substitutions.
result Jones polynomials for knots and links with many crossings calculated efficiently.
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.
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 present a simple, general technique for reducing the sample complexity of matrix and tensor decomposition algorithms applied to distributions. We use the technique to give a polynomial-time algorithm for standard ICA with sample complexity nearly linear in the dimension, thereby improving substantially on previous b…
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) are achieved for specific cases. Study Betti and Hodge numbers of solvmanifolds from integer polynomials.
problem Computing Betti and Hodge numbers of solvmanifolds constructed from integer polynomials.
method Analyzing de Rham and Dolbeault cohomology of solvmanifolds under algebraic conditions.
result Explicit generating polynomials for Hodge numbers in quasi full rank case.
We survey the construction and properties of the Yamada polynomial of spatial graphs and present the Yamada polynomial formulae for some classes of graphs. Then we construct an infinite family of spatial graphs for which roots of Yamada polynomials are dense in the complex plane.
Polynomial bound on Reidemeister moves for each link type.
problem Recognizing whether a given link diagram represents a specific link type.
method Showed existence of a polynomial pK such that any two diagrams of a link type differ by at most pK(c1)+pK(c2) Reidemeister moves. result The problem of recognising a link type is in NP and can be completed in exponential time.
New methods compute Alexander polynomials for complex knots.
problem Efficiently computing higher order Alexander polynomials for complex knots.
method Developed new algorithms to compute the Smith normal form of Alexander matrices.
result Computed Alexander polynomials for knots up to 100 crossings.
Study on Jones polynomials and their roots in the unit circle and complex plane.
problem Understanding the roots of Jones polynomials for knots and links.
method Analyzing solutions of the equation JK(t)=1 for double-twist knots and links. result The set of solutions to JKn(t)=1 is dense in the unit circle and complex plane. As is well-known, the Witten deformation of the De Rham complex computes the De Rham cohomology. In this paper we study the Witten deformation on a noncompact manifold and restrict it to differential forms which behave polynomially near infinity. Such polynomial differential forms naturally appear on manifolds with a c…
The following numerical control over the topological equivalence is proved: two complex polynomials in n=3 variables and with isolated singularities are topologically equivalent if one deforms into the other by a continuous family of polynomial functions fs:Cn→C with isolated sin…
This paper establishes for the first time the predictive performance of speed priors and their computational complexity. A speed prior is essentially a probability distribution that puts low probability on strings that are not efficiently computable. We propose a variant to the original speed prior (Schmidhuber, 2002),…
New algorithm speeds up knot polynomial calculations.
problem Computing Reshetikhin--Turaev knot polynomials efficiently.
method Fixed-parameter tractable computation via tensor networks.
result Knot polynomial computations are fixed-parameter tractable.
Explicit polynomial bound found for subgroup Dehn function.
problem Finding explicit bounds on Dehn functions of subgroups of hyperbolic groups.
method Constructing a specific example of a non-hyperbolic subgroup and analyzing its Dehn function.
result Explicit polynomial upper bound n96 on the Dehn function of a non-hyperbolic subgroup. Polynomial algorithm for multiplication on one-hole torus skein algebra.
problem Complexity of multiplicative structure in skein algebra.
method Provided a polynomial algorithm for one-hole torus.
result Closed form formulas for multiplication of curves with low crossing number.
Prime knots of genus one admitting diagram with at most five classical crossings were classified by Akimova and Matveev in 2014. In 2018 Kaur, Prabhakar and Vesnin introduced families of L-polynomials and F-polynomials for virtual knots which are generalizations of affine index polynomial. Here we introduce a notion of…
In this note, we derive a Liouville theorem for the complex Monge-Ampère equation. Our result states that if the global solution u of the complex Monge-Ampère equation with constant right-hand side differs from a quadratic polynomial solution by $o(\abs{x}^2)$ at infinity, then u is a quadratic polynomial.
Let f be a 1-variable complex polynomial such that f has a singularity at the origin. In the present paper, we show that there exists a deformation of f which has only fold singularities and cusps as singularities of a real polynomial map from the plane to the plane. We then calculate the number of cusps of a deformati…
Local polynomial regression (Fan and Gijbels 1996) is an important class of methods for nonparametric density estimation and regression problems. However, straightforward implementation of local polynomial regression has quadratic time complexity which hinders its applicability in large-scale data analysis. In this pap…
Efficiently samples arbitrary compact bodies with polynomial complexity.
problem Uniform sampling from arbitrary compact bodies efficiently.
method Warm start algorithm under isoperimetry and volume growth condition.
result Substantial generalization of known results for convex and star-shaped bodies.
The paper analyzes tensor recovery from symmetric rank-one measurements using information theory.
problem Recovering tensors with low symmetric rank from symmetric rank-one measurements.
method Covering numbers argument, Carbery-Wright inequality, orthogonal polynomials, Fano's inequality.
result Near-optimal sample complexity bounds for log-concave distributions.
Homological algebra used to study local equivalence of complex rings.
problem Local equivalence of bounded complexes over polynomial rings.
method Homological algebra approach
result Results have been proved in many places in the literature.