arXiv research

Strongly polynomial algorithm for approximate Forster transforms and halfspace learning.

A new polynomial invariant for strongly involutive links.

Strongly quasipositive links are those links which can be seen as closures of positive braids in terms of band generators. In this paper we give a necessary condition for a link with braid index 3 to be strongly quasipositive, by proving that in that case it has positive Conway polynomial (that is, all its coefficients…

A polynomial f(t) with rational coefficients is strongly irreducible if f(t^k) is irreducible for all positive integers k. Likewise, two polynomials f and g are strongly coprime if f(t^k) and g(t^l) are relatively prime for all positive integers k and l. We provide some sufficient conditions for strong irreducibility a…

We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these results follow from observing that automorphisms of the free group strongly resemble s…

Study resolves polynomial germs, proving no mixed critical points and strict transform properties.

New bounds for knot complexity based on Jones polynomial coefficients.

In this article we have studied some properties of subharmonic functions in a strongly symmetric Riemannian manifold with a pole. As a generalization of polynomial growth of a function we have introduced the notion of polynomial growth of some degree of a function with respect to a real function and proved that any non…

Efficient algorithm for learning halfspaces in a new model with polynomial time complexity.

Let $L$ be a oriented link such that $Σ_n(L)$, the $n$-fold cyclic cover of $S^3$ branched over $L$, is an L-space for some $n \geq 2$. We show that if either $L$ is a strongly quasipositive link other than one with Alexander polynomial a multiple of $(t-1)^{2g(L) + (|L|-1)}$, or $L$ is a quasipositive link other than …

Study on knots, genera, and algebraic concordance groups.

Minimax optimal convergence rates for classes of stochastic convex optimization problems are well characterized, where the majority of results utilize iterate averaged stochastic gradient descent (SGD) with polynomially decaying step sizes. In contrast, SGD's final iterate behavior has received much less attention desp…

We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Previous approaches to this problem, such as those of Chow ([1]), and Ho gen ([7]) have shown that this class is PAC-learnable by reducing it to …

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 paper we investigate the Alexander polynomial of (1,1)-knots, which are knots lying in a 3-manifold with genus one at most, admitting a particular decomposition. More precisely, we study the connections between the Alexander polynomial and a polynomial associated to a cyclic presentation of the fundamental grou…

Paper defines half-Conway polynomial and computes it for knots up to 12 crossings.

We establish short-time existence and regularity for higher-order flows generated by a class of polynomial natural tensors that, after an adjustment by the Lie derivative of the metric with respect to a suitable vector field, have strongly parabolic linearizations. We apply this theorem to flows by powers of the Laplac…

Study on singularities of specific polynomial functions.

3-manifolds with similar completions have matching slopes and polynomials.

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

Study on 2-bridge knots, proving equivariant concordance order is infinite.

Characterizes diagrams achieving Morton-Franks-Williams inequality for positive knots and links.

New algorithm learns halfspaces with noise using Forster decomposition.

Extended strongly periodic links have been introduced by Przytycki and Sokolov as a symmetric surgery presentation of three-manifolds on which the finite cyclic group acts without fixed points. The purpose of this paper is to prove that the symmetry of these links is reflected by the first coefficients of the HOMFLYPT …

New method uses higher-order Langevin dynamics for efficient parallel sampling.

Proves curvature of conference graphs and finds local matchings.

We study probability measures induced by set functions with constraints. Such measures arise in a variety of real-world settings, where prior knowledge, resource limitations, or other pragmatic considerations impose constraints. We consider the task of rapidly sampling from such constrained measures, and develop fast M…

Paper finds efficient algorithms for computing fixed points in financial networks.

Optimal transport is #P-hard when components are independent, even with approximate solutions.

We investigate refocusing and strong refocusing of light rays in a space-time. A strongly refocusing space-time is refocusing. The converse is unknown. We construct examples of space-times which are refocusing, but not strongly so, at a particular point. These space-times are strongly refocusing at other points. The ge…

New proof for some knots being topologically slice.

Przytycki and Sokolov proved that a three-manifold admits a semi-free action of the finite cyclic group of order $p$ with a circle as the set of fixed points if and only if $M$ is obtained from the three-sphere by surgery along a strongly $p-$periodic link $L$. Moreover, if the quotient three-manifold is an integral ho…

Polynomial-time algorithm finds planted hypercube vectors in Gaussian mixtures.

Using a result of Takata, we prove a formula for the colored Jones polynomial of the double twist knots $K_{(-m,-p)}$ and $K_{(-m,p)}$ where $m$ and $p$ are positive integers. In the $(-m,-p)$ case, this leads to new families of $q$-hypergeometric series generalizing the Kontsevich-Zagier series. Comparing with the cyc…

In this paper, we consider parameter recovery for non-overlapping convolutional neural networks (CNNs) with multiple kernels. We show that when the inputs follow Gaussian distribution and the sample size is sufficiently large, the squared loss of such CNNs is $\mathit{~locally~strongly~convex}$ in a basin of attraction…

Gibbs sampler contracts entropy under strong log-concavity, improving mixing time.

We give upper bounds on the numbers of various classes of polynomials reducible over the integers and over integers modulo a prime and on the number of matrices in SL(n), GL(n) and Sp(2n) with reducible characteristic polynomials, and on polynomials with non-generic Galois groups. We use our result to show that a rando…

Defines a new homomorphism for strongly invertible knots, proving equivariant algebraic concordance.

This paper shows neural networks can solve complex graph problems efficiently.

For right-angled Coxeter groups $W_Γ$, we obtain a condition on $Γ$ that is necessary and sufficient to ensure that $W_Γ$ is thick and thus not relatively hyperbolic. We show that Coxeter groups which are not thick all admit canonical minimal relatively hyperbolic structures; further, we show that in such a structure, …

According to work of Hartley and Kawauchi in 1979 and 1980, the Conway Polynomial of all negative amphicheiral knots and strongly positive amphicheiral knots factors as $φ(z)φ(-z)$ for some $φ(z)\in\mathbb Z[z]$. Moreover, a 2012 example due to Ermotti, Hongler and Weber shows that this is not true for general amphiche…

Survey on strong convergence in random matrices and its applications.

The A-polynomial of a manifold whose boundary consists of a single torus is generalised to an eigenvalue variety of a manifold whose boundary consists of a finite number of tori, and the set of strongly detected boundary curves is determined by Bergman's logarithmic limit set, which describes the exponential behaviour …

Negative momentum accelerates convergence in minimax games but at a suboptimal rate.

Sampling logconcave functions arising in statistics and machine learning has been a subject of intensive study. Recent developments include analyses for Langevin dynamics and Hamiltonian Monte Carlo (HMC). While both approaches have dimension-independent bounds for the underlying $\mathit{continuous}$ processes under s…

Classifies divergence and thickness in right-angled Coxeter groups.

New online conformal prediction methods minimize strongly adaptive regret and achieve near-optimal coverage.

We prove that the mapping torus group $\FN \rtimes_α \Z$ of any automorphism $α$ of a free group $\FN$ of finite rank $n \geq 2$ is weakly hyperbolic relative to the canonical (up to conjugation) family $\mathcal H(α)$ of subgroups of $\FN$ which consists of (and contains representatives of all) conjugacy classes that …