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.
New upper bound on Jones polynomial for fibered positive links.
problem Classifying positive and non-positive knots of crossing number ≤ 12.
method Proved a new upper bound on the maximum degree of Jones polynomial for fibered positive knots.
result Maximum degree of Jones polynomial for fibered positive knots is at most four times the minimum degree.
It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global convexity is of concern. In a number of applications however, one is interested in test…
In this text we give a decomposition result on polynomial poly-vector fields generalizing a result on the decomposition of homogeneous Poisson structures. We discuss consequences of this decomposition result in particular for low dimensions and low degrees. We provide the tools to calculate simple cubic Poisson structu…
Weierstrass representation is a classical parameterization of minimal surfaces. However, two functions should be specified to construct the parametric form in Weierestrass representation. In this paper, we propose an explicit parametric form for a class of parametric polynomial minimal surfaces of arbitrary degree. It …
Extends A-type coefficient polynomials to B-type setting, introducing new invariants.
problem Tackles the B-type skein relation and introduces new coefficient polynomials.
method Introduces coefficient polynomials associated with the B-type skein relation and proves their invariance under Reidemeister moves.
result Shows that the generating series of these coefficient polynomials recovers the Kauffman polynomial.
In this paper we study quasi-linear system of partial differential equations which describes the existence of the polynomial in momenta first integral of the integrable geodesic flow on 2-torus. We proved in [3] that this is a semi-Hamiltonian system and we show here that the metric associated with the system is a metr…
New formula recovers degree of colored Jones polynomials for pretzel knots.
problem Determining the degree of colored Jones polynomials for specific knots.
method Alternate expansion of the colored Jones polynomial for pretzel links, focusing on 3-tangle knots.
result Determined the degrees of the colored Jones polynomials for a new family of 3-tangle pretzel knots.
Explains the pure cactus group of degree three and its relation to four points on a circle.
problem Understanding the relationship between cactus groups and configuration spaces.
method Provides an explicit description of the pure cactus group of degree three and its connection to the configuration space of four points on a circle.
result Explicitly describes the relationship between the pure cactus group of degree three and the configuration space of four points on the circle.
The problem of finding all minimal surfaces presented in parametric form as polynomials of certain degree is discussed by many authors. It is known that the classical Enneper surface is (up to position in space and homothety) the only polynomial minimal surface of degree 3 in isothermal parameters. In higher degrees th…
Presented a simple group presentation for degree four cactus group.
problem Presented a simple group presentation for the pure cactus group of degree four.
method Action on hyperbolic plane, Dirichlet polygon construction.
result Isomorphic to the fundamental group of connected sum of five real projective planes.
We find the minimum dilatation of pseudo-Anosov homeomorphisms that stabilize an orientable foliation on surfaces of genus three, four, or five, and provide a lower bound for genus six to eight. Our technique also simplifies Cho and Ham's proof of the least dilatation of pseudo-Anosov homeomorphisms on a genus two surf…
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.
Polynomial neural networks explore thresholds for maximum expressiveness.
problem Understanding the limits of polynomial neural networks' expressiveness.
method Introducing activation degree threshold to measure network expressiveness and proving its existence and upper bounds.
result Polynomial neural networks with equi-width architectures achieve the maximum expressiveness.
Sharp upper bound for quasi polynomial degree of manifold configuration spaces.
problem Determining the exact degree of quasi-polynomial homology groups of configuration spaces.
method Analyzing extremal homology groups of unordered configuration spaces of manifolds.
result The upper bound for the degree of quasi-polynomials is sharp for every manifold.
Low-degree method fails to predict robust subspace recovery problem.
problem Predicting computational tractability of robust subspace recovery problem.
method Low-degree polynomial framework, anti-concentration properties.
result Low-degree method fails to predict computational tractability of robust subspace recovery problem even up to high degree.
New findings on computational limits for estimating hidden structures.
problem Estimating hidden structures in noisy data.
method Use of low-degree polynomials as a restricted model of computation.
result Established low-degree hardness of recovery problems for easy detection problems.
Study integrable geodesic flows on 2-surfaces with high-degree polynomial first integrals.
problem Integrable geodesic flows on 2-surfaces with high-degree polynomial first integrals.
method Semi-Hamiltonian systems of PDEs and generalized hodograph method.
result Construction of many local explicit and implicit integrable examples with polynomial first integrals of degrees 3, 4, 5.
Alexander polynomial degree correlates with knot defect, proving conjecture for defect zero.
problem Characterizing knot polynomials and their defects.
method Analyzing differential expansions and degree in q±2 of Alexander polynomials. result Proved Alexander polynomial degree correlates with knot defect, especially for defect zero.
Study positive 3-braids to compute Khovanov homology.
problem Compute Khovanov homology of positive 3-braids.
method Classify conjugacy classes of 3-braids using Garside theory, compute Khovanov homology for closed positive 3-braids.
result Compute first four columns and three lowest rows of Khovanov homology for closed positive 3-braids.
A triangulation is an embedding of a graph on surfaces where every face has length three. In this article, we show the existence of contractible Hamiltonian cycle in triangulated maps of which minimum degree is four.
Homology groups of spaces of nonsingular polynomial embeddings R1→Rn of degrees ≤4 are calculated. A general algebraic technique of such calculations for spaces of polynomial knots of arbitrary degrees is described.
We prove duality theorems for twisted Reidemeister torsions and twisted Alexander polynomials generalizing the results of Turaev. As a corollary we determine the parity of the degrees of twisted Alexander polynomials of 3-manifolds in many cases.
We continue our study of the degree of the colored Jones polynomial under knot cabling started in "Knot Cabling and the Degree of the Colored Jones Polynomial" (arXiv:1501.01574). Under certain hypothesis on this degree, we determine how the Jones slopes and the linear term behave under cabling. As an application we ve…
This note gives a proof that the A-polynomial of any nontrivial knot in S3 has nontrivial M-degree.
Study disproves conjecture about low-degree polynomials in hypothesis testing.
problem Conjecture about limitations of polynomial-time algorithms in hypothesis testing.
method Used counterexamples to refute the conjecture and modified the conjecture to rule out the counterexample.
result Disproved conjecture about limitations of low-degree polynomials in hypothesis testing.
Given a configuration x of n distinct points in hyperbolic 3-space H3, Michael Atiyah associated n polynomials p1,…,pn of a variable t∈CP1, of degree n−1, and conjectured that they are linearly independent over C, no matter which configuration x one s…
Solves generalized twisted rabbit problems for higher degree polynomials.
problem When a quadratic polynomial is twisted by a cyclic subgroup, what polynomial is equivalent?
method Uses d2-adic expansion instead of 4-adic for higher degree polynomials. result Provides a solution that depends on the d2-adic expansion of the power of the mapping class element. Proves partial-dual genus polynomial is a knot invariant weight system.
problem Proving the partial-dual genus polynomial is a weight system.
method Proved the polynomial satisfies the four-term relation, thus making it a weight system.
result The partial-dual genus polynomial is a Vassiliev knot invariant weight system.
The paper explores how low-degree polynomials can detect shuffled linear regression models.
problem Detecting multivariate shuffled linear regression models from independent Gaussian random matrices.
method Investigates the effectiveness of low-degree polynomial algorithms for distinguishing the model from independent Gaussian random matrices.
result Establishes a phase transition phenomenon in the performance of low-degree polynomial algorithms for distinguishing the model.
The spaces of harmonic maps of the projective plane to the four-dimensional sphere are investigated in this paper by means of twistor lifts. It is shown that such spaces are empty in case of even harmonic degree. In case of harmonic degree less than 6 it was shown that such spaces are path-connected and an explicit par…
Enhances psyquandle invariants for singular and pseudoknots.
problem Counting invariants for singular knots and pseudoknots.
method Uses quivers to extend in-degree polynomial invariants.
result Obtains biquandle coloring quivers and in-degree polynomial invariants.
We study the degree of polynomial representations of knots. We obtain the lexicographic degree for two-bridge torus knots and generalized twist knots. The proof uses the braid theoretical method developed by Orevkov to study real plane curves, combined with previous results from [KP10] and [BKP14]. We also give a sharp…
New work shows FP potential monotonicity equals low-degree polynomial estimators limits.
problem Establishing a precise mathematical relationship between statistical physics and polynomial estimators limits.
method Analyzing Gaussian additive models (GAMs) to show FP potential monotonicity equals low-degree polynomial estimators limits.
result For a broad family of Gaussian additive models, the power of low-degree polynomials is equivalent to the monotonicity of the annealed FP potential.
In this paper, we investigate twist sequences for Kauffman finite-type invariants and Goussarov-Polyak-Viro finite-type invariants. It is shown that one obtains a Kauffman or GPV type of degree ≤n if and only if an invariant is a polynomial of degree ≤n on every twist lattice of the right form. The main resul…
Study polynomial cubic differentials on Riemann surfaces using spectral networks.
problem Characterize polynomial cubic differentials with saddle connections or critical tripods.
method Introduced spectral core, refined classical core concept, and applied Gaiotto-Moore-Neitzke's algorithm.
result Completely characterized polynomial cubic differentials up to degree 3, including wall-and-chamber structure.
The study characterizes and constructs polynomial harmonic morphisms on spheres.
problem Characterizing and constructing polynomial harmonic morphisms on spheres.
method Characterization and construction of polynomial harmonic morphisms using eigenfamilies.
result Strong restrictions and classification of polynomial harmonic morphisms in low dimensions.
New bound on Jones polynomial for specific positive links.
problem Finding bounds on the Jones polynomial for positive links.
method Using previous results on positive fibered links, we found a new bound for a specific family of positive links.
result We provided a bound on the maximum degree of the Jones polynomial for positive links with a specific coefficient.
Two new polynomial invariants for long virtual knots.
problem Defining new polynomial invariants for long virtual knots.
method Introducing V1(K;t) and V2(K;t), establishing properties, and showing realizability. result First derivatives of V1(K;t) and V2(K;t) at t=1 define finite type invariants of degree three. Enhanced invariant for linkoids using quivers.
problem Counting invariants for linkoids.
method Use of quivers to generalize in-degree polynomial invariant.
result Introduced in-degree quiver polynomial matrix as a new invariant.
The paper defines and classifies Cappell-Shaneson polynomials.
problem Characterizing Cappell-Shaneson polynomials.
method Algebraic conditions on polynomials, reduction modulo primes, and construction of infinite series.
result Complete lists of Cappell-Shaneson polynomials of degrees 4 and 5, and several infinite series of degree 6.
New knots with specific properties have identical polynomial values.
problem Identifying knots with matching polynomial values after braiding.
method Constructing infinitely many hyperbolic knots and analyzing their braided satellites.
result Mutually distinct hyperbolic knots have identical HOMFLY polynomial values up to given z-degrees. New bounds on HOMFLY polynomial for homogeneous links.
problem Bounding the minimum v-degree of HOMFLY polynomial for homogeneous links. method Proved a slice version of Cromwell's inequality and a related conjecture.
result New bounds on the minimum v-degree of HOMFLY polynomial for homogeneous links. In-degree quiver polynomials for surface-links computed.
problem Computing in-degree quiver polynomials for surface-links.
method Defined using a quandle and set of endomorphisms, computed for surface-links with ch-index up to 10.
result Example computations for surface-links with ch-index up to 10.
We prove that the metric balls of a Hilbert geometry admit a volume growth at least polynomial of degree their dimension. We also characterise the convex polytopes as those having exactly polynomial volume growth of degree their dimension.
Study robustness of polynomial neural networks using algebraic geometry.
problem Certify robustness radius of polynomial neural networks.
method Metric algebraic geometry, Euclidean distance degree, symbolic elimination, homotopy-continuation methods.
result Found decision boundaries with lower ED degree than generic cubic hypersurfaces.
The Penrose-Kauffman polynomial connects knot theory to graph coloring.
problem Understanding the Penrose-Kauffman polynomial for cubic graphs.
method Using knot theory, the polynomial is shown equivalent to 3-coloring link diagrams.
result The Four Color Theorem is linked to 3-coloring link diagrams.
The colored HOMLFY polynomial is an important knot invariant depending on two variables a and q. We give bounds on the degree in both a and q generalizing Morton's bounds \cite{Mo86} for the ordinary HOMFLY polynomial. Our bounds suggest that the degree detects certain incompressible surfaces in the knot comple…