Related papers: Algorithm for finding boundary link Seifert matric…
A simple multivariable version of the reduced Burau matrix is constructed for any braid. It is shown how the multivariable Alexander polynomial for the closure of the braid can be found directly from this matrix.
This paper presents a new algorithm "A" for constructing Seifert surfaces from n-bridge projections of links. The algorithm produces minimal complexity surfaces for large classes of braids and alternating links. In addition, we consider a…
As a generalization of a fundamental result about the Alexander polynomial of links, we give a description of a Torres condition for the twisted Alexander polynomial of links associated to a unimodular representation.
For an efficient implementation of Buchberger's Algorithm, it is essential to avoid the treatment of as many unnecessary critical pairs or obstructions as possible. In the case of the commutative polynomial ring, this is achieved by the…
In the 1970s, Williams developed an algorithm that has been used to construct and study modular links in the Lorenz template. We introduce an improved algorithm, which we call the bunch algorithm, to provide more insights into the geometry…
In this research paper, structured bi-matrix variate, matrix quadratic equations are considered. Some lemmas related to determining the eigenvalues of unknown matrices are proved. Also, a method of determining the diagonalizabe unknown…
We propose a method to compute the numerical solutions of a polynomial system in complete intersection. This algorithm makes use of Bezout matrices and need only linear algebra computations. All the calculations can be done in floating…
We construct embeddings of boundary algebras B into ZF algebras A. Since it is known that these algebras are the relevant ones for the study of quantum integrable systems (with boundaries for B and without for A), this connection allows to…
We give infinitely many $2$-component links with unknotted components which are topologically concordant to the Hopf link, but not smoothly concordant to any $2$-component link with trivial Alexander polynomial. Our examples are pairwise…
We present a new method for obtaining norm bounds for random matrices, where each entry is a low-degree polynomial in an underlying set of independent real-valued random variables. Such matrices arise in a variety of settings in the…
A semi-algebraic set is a subset of $\mathbb{R}^n$ defined by a finite collection of polynomial equations and inequalities. In this paper, we investigate the problem of determining whether two points in such a set belong to the same…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
We obtain some recurrence relationships among the partition vectors of the partial exponential Bell polynomials. On using such results, the $n$-th Adomian polynomial for any nonlinear operator can be expressed explicitly in terms of the…
We consider a proximal operator given by a quadratic function subject to bound constraints and give an optimization algorithm using the alternating direction method of multipliers (ADMM). The algorithm is particularly efficient to solve a…
We show that 3-braid links with given (non-zero) Alexander or Jones polynomial are finitely many, and can be effectively determined. We classify among closed 3-braids strongly quasipositive and fibered ones, and show that 3-braid links have…
We present a reduced Burau-like representation for the mixed braid group on one strand representing links in lens spaces and show how to calculate the Alexander polynomial of a link directly from the mixed braid.
The Goeritz matrix is an alternative to the Kauffman bracket and, in addition, makes it possible to calculate the Jones polynomial faster with some minimal choice of a checkerboard surface of a link diagram. We introduce a modification of…
Checking that a scalar potential is bounded from below (BFB) is an ubiquitous and notoriously difficult task in many models with extended scalar sectors. Exact analytic BFB conditions are known only in simple cases. In this work, we present…
We construct a family of polynomials with real coefficients that contains as a particular case the Fej\'er and Suffridge polynomials. These polynomials allow us to suggest a robust algorithm to search for cycles of arbitrary length in…
We derive formulas for characterizing bounded orthogonally additive polynomials in two ways. Firstly, we prove that certain formulas for orthogonally additive polynomials derived in \cite{Kusa} actually characterize them. Secondly, by…